The DOI matches its Crossref record.
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Abstract
A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a convex body. These results are combined to simplify an algorithm of M. Dyer et al. (1989) for approximating the volume of a convex body and to improve running-time bounds.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Metropolized independent sampling with comparisons to rejection sampling and importance sampling
Liu, J. S. (1996) · Statistics and Computing · doi:10.1007/bf00162521 · Cited by 507
Some applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Random walks in a convex body and an improved volume algorithm
Lovász, L., & Simonovits, M. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040402 · Cited by 409
Self-citationRandom Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
Spielman, D. A., & Teng, S.-H. (2013) · SIAM Journal on Computing · doi:10.1137/080744888 · Cited by 316
Brightwell, G., & Winkler, P. (1991) · Order · doi:10.1007/bf00383444 · Cited by 276
Random walks and anO*(n5) volume algorithm for convex bodies
Kannan, R., Lov�sz, L., & Simonovits, M. (1997) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199708)11:1<1::aid-rsa1>3.0.co;2-x · Cited by 275
Self-citationOn selecting a satisfying truth assignment
Papadimitriou, C. H. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185365 · Cited by 266
The heat kernel as the pagerank of a graph
Chung, F. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708838104 · Cited by 254
Metadata
- Authors
- Lovasz, L., & Simonovits, M.
- Venue
- Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-04
- Pages
- 346-354
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1559116151
- Cited by
- 190
- References
- 0
- FWCI
- 11.95
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.