The problem of predecessors on spanning trees

Details The problem of predecessors on spanning trees The problem of predecessors on spanning trees

2010-10-26

arxiv.org/abs/1010.5415v1

Physics

Condensed Matter

Statistical Mechanics

7 pages, 2 figures

Scientific paper

We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the probability that a path along the oriented bonds passes sequentially fixed sites $i$ and $j$. The conformal field theory for the Potts model predicts the fractal dimension of the path to be 5/4. Using this result, we show that the probability in the predecessors problem for two sites separated by large distance $r$ decreases as $P(r) \sim r^{-3/4}$. If sites $i$ and $j$ are nearest neighbors on the square lattice, the probability $P(1)=5/16$ can be found from the analytical theory developed for the sandpile model. The known equivalence between the loop erased random walk (LERW) and the directed path on the spanning tree says that $P(1)$ is the probability for the LERW started at $i$ to reach the neighboring site $j$. By analogy with the self-avoiding walk, $P(1)$ can be called the return probability. Extensive Monte-Carlo simulations confirm the theoretical predictions.

Affiliated with

Also associated with

No associations

Rating

The problem of predecessors on spanning trees 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 problem of predecessors on spanning trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The problem of predecessors on spanning trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159603