Negative association in uniform forests and connected graphs

Details Negative association in uniform forests and connected graphs Negative association in uniform forests and connected graphs

2003-02-17

arxiv.org/abs/math/0302185v3

Mathematics

Probability

With minor corrections

Scientific paper

We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the negative association of two edges is reviewed for a uniform forest, and a related conjecture is posed for a uniform connected subgraph. The former conjecture is verified numerically for all graphs $G$ having eight or fewer vertices, or having nine vertices and no more than eighteen edges, using a certain computer algorithm which is summarised in this paper. Negative association is known already to be valid for a uniform spanning tree. The three cases of uniform forest, uniform spanning tree, and uniform connected subgraph are special cases of a more general conjecture arising from the random-cluster model of statistical mechanics.

Affiliated with

Also associated with

No associations

Rating

Negative association in uniform forests and connected graphs 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 Negative association in uniform forests and connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Negative association in uniform forests and connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381491