The Problem of Predecessors on Spanning Trees

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 to find the probability that a path along the oriented bonds passes sequentially...

Full description

Bibliographic Details
Published in:Acta Polytechnica
Main Authors: V. S. Poghosyan, V. B. Priezzhev
Format: Article
Language:English
Published: CTU Central Library 2011-01-01
Subjects:
Online Access:https://ojs.cvut.cz/ojs/index.php/ap/article/view/1364