Left and right convergence of graphs with bounded degree
暂无分享,去创建一个
László Lovász | Jeff Kahn | Christian Borgs | Jennifer T. Chayes | J. Kahn | C. Borgs | J. Chayes | L. Lovász
[1] Christian Borgs,et al. Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs , 2006, Combinatorics, Probability and Computing.
[2] Dror Weitz,et al. Counting independent sets up to the tree threshold , 2006, STOC '06.
[3] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .
[4] Béla Bollobás,et al. Sparse graphs: Metrics and random models , 2008, Random Struct. Algorithms.
[5] Vadim Malyshev,et al. Uniform cluster estimates for lattice models , 1979 .
[6] G. Rota. On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .
[7] Gábor Elek. Note on limits of finite graphs , 2007, Comb..
[8] László Lovász,et al. Very large graphs , 2009, 0902.0132.
[9] James B. Shearer,et al. On a problem of spencer , 1985, Comb..
[10] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.
[11] Oded Schramm,et al. Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..
[12] O. Cohen. Recurrence of Distributional Limits of Finite Planar Graphs , 2000 .
[13] Paola Campadelli,et al. An Upper Bound for the Maximum Cut Mean Value , 1997, WG.
[14] D. Gamarnik,et al. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models , 2008 .
[15] R. L. Dobrushin,et al. Estimates of semiinvariants for the Ising model at low temperatures , 1996 .
[16] R. Stanley. What Is Enumerative Combinatorics , 1986 .
[17] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .
[18] O. Schramm. Hyperfinite graph limits , 2007, 0711.3808.
[19] Hans-Otto Georgii,et al. Gibbs Measures and Phase Transitions , 1988 .
[20] J. Jonasson. Uniqueness of uniform random colorings of regular trees , 2002 .
[21] Alan D. Sokal,et al. On Dependency Graphs and the Lattice Gas , 2006, Combinatorics, Probability and Computing.
[22] Erhard Seiler,et al. Gauge Theories as a Problem of Constructive Quantum Field Theory and Statistical Mechanics , 1982 .
[23] J. Spencer,et al. Strong independence of graph copy functions , 1978 .
[24] Tamás Hubai,et al. Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs , 2012, Comb..
[25] P. Erdos,et al. Strong Independence of Graphcopy Functions , 1979 .
[26] Alan D. Sokal,et al. Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions , 1999, Combinatorics, Probability and Computing.
[27] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .
[28] L. Lovász. Combinatorial problems and exercises , 1979 .
[29] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.
[30] G. Elek. On limits of finite graphs , 2005, math/0505335.
[31] Russell Lyons. Asymptotic Enumeration of Spanning Trees , 2005, Comb. Probab. Comput..
[32] V. Sós,et al. Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .