Left and right convergence of graphs with bounded degree

G.-C. Rota: On the foundations of combinatorial theory, I Theory of Möbius functions

1964

Earlier work this paper cites.

Malyshev, V.A.: Uniform Cluster Estimates for Lattice Models. Commun. Math. Phys. 64

1979

Earlier work this paper cites.

E. Seiler: Gauge theories as a problem of constructive field theory and statistical mechanics

1982

Earlier work this paper cites.

J.B. Shearer: On a problem of Spencer. Combinatorica 5 (1985), 241–245

1985

Earlier work this paper cites.

H.-O. Georgii, Gibbs Measures and Phase Transitions

1988

Earlier work this paper cites.

R.L. Dobrushin: Estimates of semi-invariants for the Ising model at low temperatures. In: Topics in Statistical and Theoretical Physics, Vol. 177 of American Mathematical Society Translations, Ser. 2 (1996), 59-–81

1996

Earlier work this paper cites.

R. Stanley: Enumerative combinatorics

1999

Earlier work this paper cites.

I. Benjamini and O. Schramm: Recurrence of Distributional Limits of Finite Planar Graphs, Electronic J. Probab

2001

Cited alongside, same era.

J. Jonasson, Uniqueness of uniform random colorings of regular trees, Statistics and Probability Letters

2002

Cited alongside, same era.

M. Mezard and G. Parisi, The cavity method at zero temperature, J. Statist. Phys

2003

Cited alongside, same era.

R. Lyons: Asymptotic enumeration of spanning trees Combin. Prob. Comput

2005

Cited alongside, same era.

C. Borgs: Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs, Combinatorics, Probability and Computing

2006

Cited alongside, same era.

A.D.Scott and A.D.Sokal: On Dependency Graphs and the Lattice Gas, Combinatorics, Probability and Computing (2006) 15, 253–279

G. Elek: On limits of finite graphs, Combinatorica

2007

Later among the works it cites.

L. Lovász: Combinatorial Problems and Exercises

2007

Later among the works it cites.

A. Bandyopadhyay and D. Gamarnik, Counting without sampling. Asymptotics of the log-partition function for certain statistical physics models, Random Structures & Algorithms

2008

Later among the works it cites.

I. Benjamini, O. Schramm, A. Shapira: Every Minor-Closed Property of Sparse Graphs is Testable, 40th Ann. ACM Symp. on Th. Comp

2008

Later among the works it cites.

C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent Graph Sequences I: Subgraph frequencies, metric properties, and testing, Advances in Math

2008

Later among the works it cites.