Approximating the Permanent of a Random Matrix with Vanishing Mean

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


Duration: 46:18
478 views
8

Saeed Mehraban (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/talk-42
Deterministic Counting, Probability, and Zeros of Partition Functions



Other Videos By Simons Institute for the Theory of Computing


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
2019-03-19Approximating the Permanent of a Random Matrix with Vanishing Mean
2019-03-19Entropy, Capacity, and Counting
2019-03-19Counting Degree-constrained Subgraphs and Orientations
2019-03-19Zeros for Partition Functions and Graph-counting Polynomials.
2019-03-19Reflection Positivity as Complement to the Location of Zeros of Partition Functions
2019-03-18The Six- and the Eight-vertex Models and Counting Perfect Matchings
2019-03-18Deterministic Approximation of the Ising Partition Function
2019-03-18Inapproximability of the Independent Set Polynomial in the Complex Plane
2019-03-18Computation of the Multivariate Independence Polynomial by Correlation Decay
2019-03-15Mechanism Design: Sample Complexity and Loss Functions
2019-03-15(Part 2) Operationally Motivating IT Leakage Measures – A Path to Maximal Leakage (Part 2)


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