Gauges, Loops, and Polynomials for Partition Functions of Graphical Models

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=jSjmWRN0kbc


Duration: 45:24
176 views
1

Michael Chertkov (University of Arizona, Tucson)
https://simons.berkeley.edu/talks/talk-48
Deterministic Counting, Probability, and Zeros of Partition Functions



Other Videos By Simons Institute for the Theory of Computing


2019-04-08Differentially Private Inference for Binomial Data
2019-04-08Robust Statistics and Bias Correction: Ideas for Differential Privacy and Utility
2019-04-08Differential Privacy with Elliptical Stochastic Processes
2019-04-08Finite Sample Differentially Private Confidence Intervals
2019-04-08Locally Private Bayesian Inference for Count Models
2019-04-03What We Can Learn from AdNauseam about the Threat and Power of Data Obfuscation
2019-03-22A Combinatorial Approach to Complexity Transitions in Quantum Physics
2019-03-22Christoffel-Darboux Type Identities for the Independence Polynomial
2019-03-22Counting Hypergraph Colorings in the Local Lemma Regime
2019-03-22Negative Dependence and Lorentzian Polynomials
2019-03-21Gauges, Loops, and Polynomials for Partition Functions of Graphical Models
2019-03-21Finding Eigenvalues in Exponential Size Space:...
2019-03-21Algorithmic Pirogov-Sinai Theory
2019-03-21Counting Independent Sets and Colorings on Almost Every Random Regular Bipartite Graph
2019-03-21Abstract Polymer Models and the Cluster Expansion
2019-03-20A Poly-time Deterministic Algorithm for Simply Exponential Approximation...
2019-03-20Zeros of the Partition Function of the Ising Model on Bounded Degree Graphs
2019-03-20Approximate Deterministic Counting via Marginal Entropy Optimization
2019-03-20Approximating the Matching Polynomial
2019-03-20Zeros of Moment Generating Functions and the Riemann Hypothesis
2019-03-19Counting Matchings via the Capacity Method


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Deterministic Counting Probability and Zeros of Partition Functions
Michael Chertkov