Weighted enumeration of spanning subgraphs in locally tree‐like graphs

Abstract

Using the theory of negative association for measures and the notion of unimodularity for random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically tree‐like graphs. Specifically, the normalized logarithm of the associated partition function (free energy) is shown to converge along any sequence of graphs whose random weak limit is a tree, and the limit is directly expressed in terms of the unique solution to a limiting cavity equation. On a Galton–Watson tree, the latter simplifies into a recursive distributional equation which can be solved explicitly. As an illustration, we provide a new asymptotic formula for the maximum size of a b‐matching in the Erdős–Rényi random graph with fixed average degree and diverging size, for any \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}$b\in\mathbb{N}$\end{document}. To the best of our knowledge, this is the first time that correlation inequalities and unimodularity are combined together to yield a general proof of uniqueness of Gibbs measures on infinite trees. We believe that a similar argument is applicable to other Gibbs measures than those over spanning subgraphs considered here. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013

Bypassing correlation decay for matchings with an application to XORSAT

“…In the rest of this paper, we will deal with sequences of graphs with size diverging to infinity and compute the asymptotics for their matching numbers. As shown in [2], [5], this computation can be done using the local weak convergence of graphs and then interpreting the Gibbs distribution (1) on infinite trees. As explained in [6], the analysis made in previous section extends to unimodular trees [8].…”

“…The main purpose of this paper is to present recent contributions to a rigorous formalization of the cavity method [2], [5], [6] and [7]. We will concentrate on the finite graph case and give a self-contained presentation of the computation of the matching number (Section II).…”

Solution of the Monomer–Dimer Model on Locally Tree-Like Graphs. Rigorous Results

“…Then Bayati and Nair [15] obtained rigorous results for a class of graphs satisfying a quite restrictive large girth condition. Salez [12], using the language of cavity method, made a rigorous study for locally tree-like graphs that partially overlap with the one presented here and deals also with non hard-core dimer interactions (b-matching).…”

A greedy algorithm for finding a large 2‐matching on a random cubic graph

“…since Δ ≤ 2 and Φ( ) ≤ 9(1− ) 3 9(1− ) 2 ≤ 1 (by (18), (15), and (32)). Suppose condition (22) triggers the stopping time .…”

“…In the binomial random graph with , there is no 2‐factor and therefore studying the size of the largest 2‐matching is an interesting problem. In the recent article , an explicit asymptotic formula is given for the maximum size of a 2‐ matching in such graphs. The article generalizes this result to random hypergraphs.…”