Nima Anari
Shayan Oveis Gharan
ABSTRACT
We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where 0<q<1. Consequently, we can sample random spanning forests in a graph and estimate the reliability polynomial of any matroid. We also prove the thirty year old conjecture of Mihail and Vazirani that the bases exchange graph of any matroid has edge expansion at least 1.
Our algorithm and proof build on the recent results of Dinur, Kaufman, Mass and Oppenheim who show that a high dimensional walk on a weighted simplicial complex mixes rapidly if for every link of the complex, the corresponding localized random walk on the 1-skeleton is a strong spectral expander. One of our key observations is that a weighted simplicial complex X is a 0-local spectral expander if and only if a naturally associated generating polynomial pX is strongly log-concave. More generally, to every pure simplicial complex with positive weights on its maximal faces, we can associate to X a multiaffine homogeneous polynomial pX such that the eigenvalues of the localized random walks on X correspond to the eigenvalues of the Hessian of derivatives of pX.
- {AHK18} Karim Adiprasito, June Huh, and Eric Katz. “Hodge theory for combinatorial geometries”. In: Annals of Mathematics 188.2 (2018), pp. 381– 452. {Alo86} N Alon. “Eigenvalues and expanders”. In: Combinatorica 6 (2 Jan. 1986), pp. 83–96. issn: 0209-9683. Google Scholar
Digital Library
- {AM85} N. Alon and V. Milman. “Isoperimetric inequalities for graphs, and superconcentrators”. In: Journal of Combinatorial Theory, Series B 38.1 (Feb. 1985), pp. 73–88. {Ana+18a} Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. “Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid”. In: arXiv preprint arXiv:1811.01816 (2018).Google ScholarCross Ref
- {Ana+18b} Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. “Log-Concave Polynomials III: Mason’s Ultra-Log-Concavity Conjecture for Independent Sets of Matroids”. In: arXiv preprint arXiv:1811.01600 (2018).Google Scholar
- {AOR16} Nima Anari, Shayan Oveis Gharan, and Alireza Rezaei. “Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes”. In: COLT. 2016, pp. 103–115.Google Scholar
- {AOV18} Nima Anari, Shayan Oveis Gharan, and Cynthia Vinzant. “Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids”. In: FOCS. to appear. 2018.Google Scholar
- {BH18} Petter Brändén and June Huh. “Hodge-Riemann relations for Potts model partition functions”. In: arXiv preprint arXiv:1811.01696 (2018).Google Scholar
- {BH19} Petter Brändén and June Huh. “Lorentzian polynomials”. In: arXiv preprint arXiv:1902.03719 (2019).Google Scholar
- {BS07} Alexander Barvinok and Alex Samorodnitsky. “Random weighting, asymptotic counting, and inverse isoperimetry”. In: Israel Journal of Mathematics 158.1 (Mar. 2007), pp. 159–191. issn: 1565-8511.Google ScholarCross Ref
- {BŚ97} W. Ballmann and J. Światkowski. “On L2-cohomology and property (T) for automorphism groups of polyhedral cell complexes”. In: Geom. Funct. Anal. 7.4 (1997), pp. 615–645. {Clo10} Brian D. Cloteaux. “Approximating the Number of Bases for Almost All Matroids”. In: Congressus Numerantium 202 (2010), pp. 149–154.Google ScholarCross Ref
- {CTY15} Emma Cohen, Prasad Tetali, and Damir Yeliussizov. “Lattice path matroids: negative correlation and fast mixing”. In: arXiv preprint arXiv:1505.06710 (2015).Google Scholar
- {DK17} I. Dinur and T. Kaufman. “High Dimensional Expanders Imply Agreement Expanders”. In: FOCS. 2017, pp. 974–985.Google Scholar
- {DS91} Persi Diaconis and Daniel Stroock. “Geometric bounds for eigenvalues of Markov chains”. In: The Annals of Applied Probability (1991), pp. 36– 61.Google ScholarCross Ref
- {FK72} Cornelis Marius Fortuin and Pieter Willem Kasteleyn. “On the randomcluster model: I. Introduction and relation to other models”. In: Physica 57 (4 1972), pp. 536–564.Google ScholarCross Ref
- {FM92} Tomás Feder and Milena Mihail. “Balanced matroids”. In: STOC. 1992, pp. 26–38. {For71} Cornelis Marius Fortuin. “On the random-cluster model”. PhD thesis. Leiden University, 1971. Google ScholarDigital Library
- {For72a} Cornelis Marius Fortuin. “On the random-cluster model: II. The percolation model”. In: Physica 58 (3 1972), pp. 393–418. {For72b} Cornelis Marius Fortuin. “On the random-cluster model: III. The simple random-cluster model”. In: Physica 59 (4 1972), pp. 545–570. {Gam99} Anna Gambin. “On approximating the number of bases of exchange preserving matroids”. In: International Symposium on Mathematical Foundations of Computer Science. Springer. 1999, pp. 332–342. {Gar73} H. Garland. “p-adic curvature and the cohomology of discrete subgroups of p-adic groups”. In: Annals of Mathematics 97.3 (1973), pp. 375–423. Google ScholarDigital Library
- {GJ08} L. A. Goldberg and M. Jerrum. “Inapproximability of the Tutte polynomial”. In: Inform. and Comput 206.7 (2008), pp. 908–929. {GJ12a} L. A. Goldberg and M. Jerrum. “Approximating the partition function of the ferromagnetic Potts model”. In: J. ACM 59.5 (2012), pp. 1–31. {GJ12b} L. A. Goldberg and M. Jerrum. “Inapproximability of the Tutte polynomial of a planar graph”. In: Computational Complexity 21 (4 2012), pp. 605–642. Google ScholarDigital Library
- {GJ13} L. A. Goldberg and M. Jerrum. “Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials”. In: Journal of Computer and System Sciences 79 (1 2013), pp. 68–78. Google ScholarDigital Library
- {GJ14} L. A. Goldberg and M. Jerrum. “The complexity of computing the sign of the Tutte polynomial”. In: SIAM J. Comput. 43 (2014), pp. 1921–1952.Google ScholarCross Ref
- {GJ17} Heng Guo and Mark Jerrum. “Random cluster dynamics for the Ising model is rapidly mixing”. In: SODA. 2017, pp. 1818–1827. Google ScholarDigital Library
- {GJ18a} Heng Guo and Mark Jerrum. “A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability”. In: ICALP. 2018, 68:1– 68:12. {GJ18b} Heng Guo and Mark Jerrum. “Approximately counting bases of bicircular matroids”. 2018.Google Scholar
- {Gri09} G. R Grimmett. The Random-Cluster Model. Berlin: Springer-Verlag, 2009.Google Scholar
- {Gur09} Leonid Gurvits. “A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor”. In: Discrete & Computational Geometry 41.4 (2009), pp. 533–555. {Gur10} Leonid Gurvits. “On multivariate Newton-like inequalities”. In: Advances in Combinatorial Mathematics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 61–78.Google ScholarDigital Library
- {HJ13} Roger A Horn and Charles R Johnson. Matrix analysis. 2nd ed. Cambridge university press, 2013.Google Scholar
- {HW16} June Huh and Botong Wang. “Enumeration of points, lines, planes, etc”. In: arXiv preprint arXiv:1609.05484 (2016).Google Scholar
- {Jer+04} Mark Jerrum, Jung-Bae Son, Prasad Tetali, and Eric Vigoda. “Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains”. In: Annals of Applied Probability (2004), pp. 1741–1765.Google ScholarCross Ref
- {Jer06} Mark Jerrum. “Two Remarks Concerning Balanced Matroids”. In: Combinatorica 26.6 (2006), pp. 733–742. Google ScholarDigital Library
- {JS02} Mark Jerrum and Jung Bae Son. “Spectral gap and log-Sobolev constant for balanced matroids”. In: FOCS. 2002, pp. 721–729. Google ScholarDigital Library
- {JS93} Mark Jerrum and Alistair Sinclair. “Polynomial-time approximation algorithms for the Ising model”. In: SIAM J. Comput. 22.5 (1993), pp. 1087– 1116. Google ScholarDigital Library
- {JVV86} Mark Jerrum, Leslie Valiant, and Vijay Vazirani. “Random Generation of Combinatorial Structures from a Uniform Distribution”. In: Theoretical Computer Science 43 (1986), pp. 169–188. Google ScholarCross Ref
- {JVW90} F. Jaeger, D. L. Vertigan, and D. J. A. Welsh. “On the computational complexity of the Jones and Tutte polynomials”. In: Mathematical Proceedings of the Cambridge Philosophical Society 108 (1 1990), pp. 35– 53.Google ScholarCross Ref
- {KM17} Tali Kaufman and David Mass. “High Dimensional Random Walks and Colorful Expansion”. In: ITCS. 2017, 4:1–4:27.Google Scholar
- {KO18} Tali Kaufman and Izhar Oppenheim. “High Order Random Walks: Beyond Spectral Gap”. In: APPROX/RANDOM. 2018, 47:1–47:17.Google Scholar
- {KT12} Alex Kulesza and Ben Taskar. “Determinantal point processes for machine learning”. In: Foundations and Trends in Machine Learning 5(2-3) (2012), pp. 123–286. {Lub17} Alexander Lubotzky. “High Dimensional Expanders”. 2017.Google ScholarCross Ref
- {MS91} Milena Mihail and Madhu Sudan. Connectivity Properties of Matroids. Tech. rep. EECS Department, University of California, Berkeley, Dec. 1991.Google Scholar
- {MV89} M. Mihail and U. Vazirani. “On the expansion of 0/1 polytopes”. In: Journal of Combinatorial Theory. B (1989).Google Scholar
- {Opp18} Izhar Oppenheim. “Local spectral expansion approach to high dimensional expanders part I: Descent of spectral gaps”. In: Discrete and Computational Geometry 59.2 (2018), pp. 293–330. {Ver91} D.L. Vertigan. “On the computational complexity of tutte, jones, homfly and kauffman invariants”. PhD thesis. University of Oxford, 1991. Google ScholarDigital Library
Index Terms
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Recommendations
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingWe show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs. While perfect matchings on planar ...
Ehrhart Polynomials of Matroid Polytopes and Polymatroids
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that, for fixed rank, Ehrhart polynomials of matroid polytopes and polymatroids are ...
Ehrhart Polynomials of Matroid Polytopes and Polymatroids
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that, for fixed rank, Ehrhart polynomials of matroid polytopes and polymatroids are ...
Comments