Convergent sequences of sparse graphs: A large deviations approach

DOI10.1002/rsa.20694zbMath1370.05119arXiv1302.4615OpenAlexW1767800602MaRDI QIDQ5360869

David Gamarnik, Christian Borgs, Jennifer T. Chayes

Publication date: 26 September 2017

Full work available at URL: https://arxiv.org/abs/1302.4615

zbMATH Keywords

combinatorial optimizationstatistical physicssparse graphsgraph convergence

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Density (toughness, etc.) (05C42)

Related Items (5)

A short proof of the equivalence of left and right convergence for sparse graphs ⋮ Sparse Graphs Using Exchangeable Random Measures ⋮ The Interpolation Method for Random Graphs with Prescribed Degrees ⋮ An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence ⋮ First order limits of sparse graphs: Plane trees and path-width

This page was built for publication: Convergent sequences of sparse graphs: A large deviations approach