Left and right convergence of graphs with bounded degree
From MaRDI portal
Publication:4903275
DOI10.1002/rsa.20414zbMath1257.05172arXiv1002.0115MaRDI QIDQ4903275
László Lovász, Jeffry Kahn, Christian Borgs, Jennifer T. Chayes
Publication date: 21 January 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0115
Related Items
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials, Sparse exchangeable graphs and their limits via graphon processes, Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank, Weighted counting of solutions to sparse systems of equations, The Complexity of Counting Surjective Homomorphisms and Compactions, Counting Hypergraph Colorings in the Local Lemma Regime, The Interpolation Method for Random Graphs with Prescribed Degrees, Unnamed Item, Efficient algorithms for approximating quantum partition functions, Subgraph densities in a surface, Absence of zeros implies strong spatial mixing, Invertible subalgebras, Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures, Fast algorithms at low temperatures via Markov chains†, Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \), Homomorphisms from the torus, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs, First order convergence of matroids, Matchings on infinite graphs, Right-convergence of sparse random graphs, Benjamini-Schramm continuity of root moments of graph polynomials, A short proof of the equivalence of left and right convergence for sparse graphs, The Ising partition function: zeros and deterministic approximation, Computing the number of induced copies of a fixed graph in a bounded degree graph, An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence, Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees, Zero-free regions of partition functions with applications to algorithms and graph limits, Recurrence of planar graph limits, A proof of the upper matching conjecture for large graphs, Characteristic power series of graph limits, Polymer dynamics via cliques: new conditions for approximations, An FPTAS for the hardcore model on random regular bipartite graphs, Zeros and approximations of holant polynomials on the complex plane, Evaluations of Tutte polynomials of regular graphs, Algorithmic Pirogov-Sinai theory, Limiting entropy of determinantal processes, Announce of an entropy formula for a class of actions coming from Gibbs measures, Asymptotic behavior and distributional limits of preferential attachment graphs, The replica symmetric solution for Potts models on \(d\)-regular graphs, Limits of locally-globally convergent graph sequences, Random cluster model on regular graphs, Statistical Matching Theory
Cites Work
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Hyperfinite graph limits
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Gibbs measures and phase transitions
- Uniform cluster estimates for lattice models
- Uniqueness of uniform random colorings of regular trees
- Recurrence of distributional limits of finite planar graphs
- The cavity method at zero temperature
- Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Sparse graphs: Metrics and random models
- Asymptotic Enumeration of Spanning Trees
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
