A short proof of the equivalence of left and right convergence for sparse graphs

DOI10.1016/j.ejc.2015.10.009zbMath1328.05104arXiv1504.02892OpenAlexW2138690996MaRDI QIDQ901148

László Miklós Lovász

Publication date: 23 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

left convergencesequences of bounded degree graphsweighted target graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (2)

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

Cites Work

• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Computing the partition function for graph homomorphisms
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Endomorphisms of symbolic algebraic varieties
• Recurrence of distributional limits of finite planar graphs
• Limits of locally-globally convergent graph sequences
• Processes on unimodular random networks
• Left and right convergence of graphs with bounded degree
• Sparse graphs: Metrics and random models
• Convergent sequences of sparse graphs: A large deviations approach

This page was built for publication: A short proof of the equivalence of left and right convergence for sparse graphs