Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T19:38:33.164Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximately counting bases of bicircular matroids

Part of: Markov processes Algorithms - Computer Science Graph theory

Published online by Cambridge University Press:  06 August 2020

Heng Guo  and
Mark Jerrum
Heng Guo*
Affiliation:
School of Informatics, University of Edinburgh, Informatics Forum, EdinburghEH8 9AB, UK
Mark Jerrum
Affiliation:
School ofMathematical Sciences, Queen Mary, University of London, Mile End Road, LondonE1 4NS, UK
*
*Corresponding author. Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.

MSC classification

Primary: 68W20: Randomized algorithms 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 05C31: Graph polynomials
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 30 , Issue 1 , January 2021 , pp. 124 - 135
Check for updates
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

The work described here was supported by the EPSRC research grant EP/N004221/1 ‘Algorithms that Count’.

References

Anari, N., Liu, K., Oveis Gharan, S. and Vinzant, C. (2019) Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), pp. 1–12. ACM.CrossRefGoogle Scholar
Chávez Lomelí, L. and Welsh, D. J. A. (1996) Randomized approximation of the number of bases. In Matroid Theory (Seattle, WA, 1995), Vol. 197 of Contemporary Mathematics, pp. 371–376. AMS.Google Scholar
Cohn, H., Pemantle, R. and Propp, J. G. (2002) Generating a random sink-free orientation in quadratic time. Electron. J. Combin. 9 #R10.CrossRefGoogle Scholar
Cryan, M., Guo, H. and Mousa, G. (2019) Modified log-Sobolev inequalities for strongly log-concave distributions. In 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2019), pp. 1358–1370. IEEE.Google Scholar
Eriksson, K. (1996) Strong convergence and a game of numbers. European J. Combin. 17 379–390.Google Scholar
Feder, T. and Mihail, M. (1992) Balanced matroids. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC ’92), pp. 26–38. ACM.Google Scholar
Giménez, O., de Mier, A. and Noy, M. (2005) On the number of bases of bicircular matroids. Ann. Combin. 9 35–45.Google Scholar
Giménez, O. and Noy, M. (2006) On the complexity of computing the Tutte polynomial of bicircular matroids. Combin. Probab. Comput. 15 385–395.CrossRefGoogle Scholar
Gorodezky, I. and Pak, I. (2014) Generalized loop-erased random walks and approximate reachability. Random Struct. Algorithms 44 201–223.Google Scholar
Guo, H. and He, K. (2018) Tight bounds for popping algorithms. Random Struct. Algorithms. doi: 10.1002/rsa.20928.Google Scholar
Guo, H. and Jerrum, M. (2019) A polynomial-time approximation algorithm for all-terminal network reliability. SIAM J. Comput. 48 964–978.CrossRefGoogle Scholar
Guo, H., Jerrum, M. and Liu, J. (2019) Uniform sampling through the Lovász local lemma. J. Assoc. Comput. Mach. 66 18.Google Scholar
Huber, M. (2015) Approximation algorithms for the normalizing constant of Gibbs distributions. Ann. Appl. Probab. 25 974–985.CrossRefGoogle Scholar
Jerrum, M. (2003) Counting, Sampling and Integrating: Algorithms and Complexity, Lectures in Mathematics ETH Zürich. Birkhäuser.CrossRefGoogle Scholar
Jerrum, M. (2006) Two remarks concerning balanced matroids. Combinatorica 26 733–742.Google Scholar
Jerrum, M., Son, J.-B., Tetali, P. and Vigoda, E. (2004) Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains. Ann. Appl. Probab. 14 1741–1765.CrossRefGoogle Scholar
Kassel, A. (2015) Learning about critical phenomena from scribbles and sandpiles. In Modélisation Aléatoire et Statistique: Journées MAS 2014, Vol. 51 of ESAIM Proc. Surveys, pp. 60–73. EDP Sciences, Les Ulis.CrossRefGoogle Scholar
Kassel, A. and Kenyon, R. (2017) Random curves on surfaces induced from the Laplacian determinant. Ann. Probab. 45 932–964.Google Scholar
Kolipaka, K. B. R. and Szegedy, M. (2011) Moser and Tardos meet Lovász. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), pp. 235–244. ACM.Google Scholar
Kolmogorov, V. (2018) A faster approximation algorithm for the Gibbs partition function. In Proceedings of the 31st Conference On Learning Theory (COLT), Vol. 75 of Proceedings of Machine Learning Research, pp. 228–249. PMLR.Google Scholar
Matthews, L. R. (1977) Bicircular matroids. Quart. J. Math. Oxford Ser. (2) 28 213–227.CrossRefGoogle Scholar
Maurer, S. B. (1976) Matrix generalizations of some theorems on trees, cycles and cocycles in graphs. SIAM J. Appl. Math. 30 143–148.CrossRefGoogle Scholar
Motwani, R. and Raghavan, P. (1995) Randomized Algorithms. Cambridge University Press.CrossRefGoogle Scholar
Piff, M. J. and Welsh, D. J. A. (1971) The number of combinatorial geometries. Bull. London Math. Soc. 3 55–56.Google Scholar
Propp, J. G. and Wilson, D. B. (1998) How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms 27 170–217.Google Scholar
Snook, M. (2012) Counting bases of representable matroids. Electron. J. Combin. 19 P41.CrossRefGoogle Scholar
Štefankovič, D., Vempala, S. and Vigoda, E. (2009) Adaptive simulated annealing: a near-optimal connection between sampling and counting. J. Assoc. Comput. Mach. 56 18.CrossRefGoogle Scholar
Wilson, D. B. (1996) Generating random spanning trees more quickly than the cover time. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 296–303. ACM.Google Scholar