Left and right convergence of graphs with bounded degree
From MaRDI portal
Publication:4903275
DOI10.1002/RSA.20414zbMath1257.05172arXiv1002.0115OpenAlexW2017186918MaRDI QIDQ4903275
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 (43)
Subgraph densities in a surface ⋮ Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs ⋮ First order convergence of matroids ⋮ 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 ⋮ Announce of an entropy formula for a class of actions coming from Gibbs measures ⋮ Matchings on infinite graphs ⋮ 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 \) ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ Homomorphisms from the torus ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ A short proof of the equivalence of left and right convergence for sparse graphs ⋮ Unnamed Item ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Recurrence of planar graph limits ⋮ The Interpolation Method for Random Graphs with Prescribed Degrees ⋮ Random cluster model on regular graphs ⋮ Asymptotic behavior and distributional limits of preferential attachment graphs ⋮ Limiting entropy of determinantal processes ⋮ The replica symmetric solution for Potts models on \(d\)-regular graphs ⋮ Right-convergence of sparse random graphs ⋮ Limits of locally-globally convergent graph sequences ⋮ Statistical Matching Theory ⋮ The Ising partition function: zeros and deterministic approximation ⋮ Computing the number of induced copies of a fixed graph in a bounded degree graph ⋮ A proof of the upper matching conjecture for large graphs ⋮ 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 ⋮ Sparse exchangeable graphs and their limits via graphon processes ⋮ Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ 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 ⋮ Efficient algorithms for approximating quantum partition functions ⋮ Characteristic power series of graph limits ⋮ Polymer dynamics via cliques: new conditions for approximations
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]
This page was built for publication: Left and right convergence of graphs with bounded degree
