The cavity method for counting spanning subgraphs subject to local constraints

Details The cavity method for counting spanning subgraphs subject to local constraints The cavity method for counting spanning subgraphs subject to local constraints

2011-03-16

arxiv.org/abs/1103.3281v1

Mathematics

Probability

Scientific paper

Using the theory of negative association for measures and the notion of 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 corresponding free entropy density 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 explicitely. As an illustration, we provide an explicit-limit formula for the $b-$matching number of an Erd\H{o}s-R\'enyi random graph with fixed average degree and diverging size, for any $b\in\mathbb N$.

Affiliated with

Also associated with

No associations

Rating

The cavity method for counting spanning subgraphs subject to local constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The cavity method for counting spanning subgraphs subject to local constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The cavity method for counting spanning subgraphs subject to local constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247131