scholarly journals The Problem of Predecessors on Spanning Trees

10.14311/1364 ◽  
2011 ◽  
Vol 51 (2) ◽  
Author(s):  
V. S. Poghosyan ◽  
V. B. Priezzhev
Keyword(s):  
Spanning Trees ◽  
Nearest Neighbors ◽  
Square Lattice ◽  
Directed Path ◽  
Conformal Field ◽  
Return Probability ◽  
Theoretical Predictions ◽  
Neighboring Site ◽  
Self Avoiding Walk ◽  
Equiprobable Distribution

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 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) ∼ 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 states 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.

scholarly journals Anisotropic scaling of the two-dimensional Ising model II: surfaces and boundary fields

2020 ◽  
Vol 8 (3) ◽  
Author(s):  
Hendrik Hobrecht ◽  
Fred Hucht
Keyword(s):  
Ising Model ◽  
Boundary Conditions ◽  
Scaling Limit ◽  
Finite Size ◽  
Square Lattice ◽  
Conformal Field ◽  
Anisotropic Scaling ◽  
Finite Lattices ◽  
Antiferromagnetic Ising Model ◽  
Boundary Fields

Based on the results published recently [SciPost Phys. 7, 026 (2019)], the influence of surfaces and boundary fields are calculated for the ferromagnetic anisotropic square lattice Ising model on finite lattices as well as in the finite-size scaling limit. Starting with the open cylinder, we independently apply boundary fields on both sides which can be either homogeneous or staggered, representing different combinations of boundary conditions. We confirm several predictions from scaling theory, conformal field theory and renormalisation group theory: we explicitly show that anisotropic couplings enter the scaling functions through a generalised aspect ratio, and demonstrate that open and staggered boundary conditions are asymptotically equal in the scaling regime. Furthermore, we examine the emergence of the surface tension due to one antiperiodic boundary in the system in the presence of symmetry breaking boundary fields, again for finite systems as well as in the scaling limit. Finally, we extend our results to the antiferromagnetic Ising model.

scholarly journals Random minimal directed spanning trees and Dickman-type distributions

2004 ◽  
Vol 36 (03) ◽  
pp. 691-714 ◽  
Author(s):  
Mathew D. Penrose ◽  
Andrew R. Wade
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Dirichlet Distribution ◽  
Maximal Length ◽  
Directed Path ◽  
Limiting Distributions ◽  
Limit Distributions ◽  
Tree Construction ◽  
Directed Spanning Tree ◽  
Westerly Direction

In Bhatt and Roy's minimal directed spanning tree construction fornrandom points in the unit square, all edges must be in a south-westerly direction and there must be a directed path from each vertex to the root placed at the origin. We identify the limiting distributions (for largen) for the total length of rooted edges, and also for the maximal length of all edges in the tree. These limit distributions have been seen previously in analysis of the Poisson-Dirichlet distribution and elsewhere; they are expressed in terms of Dickman's function, and their properties are discussed in some detail.

Spanning Trees of the Generalised Union Jack Lattice

2016 ◽  
Vol 71 (4) ◽  
pp. 331-335
Author(s):  
Lingyun Chen ◽  
Weigen Yan
Keyword(s):  
Boundary Condition ◽  
Spanning Trees ◽  
Square Lattice ◽  
Aztec Diamond

AbstractThe Union Jack lattice UJL(n, m) with toroidal boundary condition can be obtained from an n×m square lattice with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f), and u4(f) are four vertices on the boundary of f. The Union Jack lattice has been studied extensively by statistical physicists. In this article, we consider the problem of enumeration of spanning trees of the so-called generalised Union Jack lattice UDn, which is obtained from the Aztec diamond $AD_n^t$ of order n with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f) and u4(f) are four vertices on the boundary of f.

scholarly journals Random minimal directed spanning trees and Dickman-type distributions

2004 ◽  
Vol 36 (3) ◽  
pp. 691-714 ◽  
Author(s):  
Mathew D. Penrose ◽  
Andrew R. Wade
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Dirichlet Distribution ◽  
Maximal Length ◽  
Directed Path ◽  
Limiting Distributions ◽  
Limit Distributions ◽  
Tree Construction ◽  
Directed Spanning Tree ◽  
Westerly Direction

In Bhatt and Roy's minimal directed spanning tree construction for n random points in the unit square, all edges must be in a south-westerly direction and there must be a directed path from each vertex to the root placed at the origin. We identify the limiting distributions (for large n) for the total length of rooted edges, and also for the maximal length of all edges in the tree. These limit distributions have been seen previously in analysis of the Poisson-Dirichlet distribution and elsewhere; they are expressed in terms of Dickman's function, and their properties are discussed in some detail.

scholarly journals Self-avoiding walk on a square lattice with correlated vacancies

2018 ◽  
Vol 97 (4) ◽  
Author(s):  
J. Cheraghalizadeh ◽  
M. N. Najafi ◽  
H. Mohammadzadeh ◽  
A. Saber
Keyword(s):  
Square Lattice ◽  
Self Avoiding Walk

scholarly journals Families of prudent self-avoiding walks

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Mireille Bousquet-Mélou
Keyword(s):  
Generating Function ◽  
Recurrence Relations ◽  
Square Lattice ◽  
Random Generation ◽  
Fourth Class ◽  
End Distance ◽  
International Audience ◽  
Self Avoiding Walk ◽  
Natural Classes ◽  
Self Avoiding Walks

International audience A self-avoiding walk on the square lattice is $\textit{prudent}$, if it never takes a step towards a vertex it has already visited. Préa was the first to address the enumeration of these walks, in 1997. For 4 natural classes of prudent walks, he wrote a system of recurrence relations, involving the length of the walks and some additional "catalytic'' parameters. The generating function of the first class is easily seen to be rational. The second class was proved to have an algebraic (quadratic) generating function by Duchi (FPSAC'05). Here, we solve exactly the third class, which turns out to be much more complex: its generating function is not algebraic, nor even $D$-finite. The fourth class ―- general prudent walks ―- still defeats us. However, we design an isotropic family of prudent walks on the triangular lattice, which we count exactly. Again, the generating function is proved to be non-$D$-finite. We also study the end-to-end distance of these walks and provide random generation procedures. Un chemin auto-évitant sur le réseau carré est $\textit{prudent}$, s'il ne fait jamais un pas en direction d'un point qu'il a déjà visité. Préa est le premier à avoir cherché à énumérer ces chemins, en 1997. Pour 4 classes naturelles de chemins prudents, il donne un système de relations de récurrence, impliquant la longueur des chemins et plusieurs paramètres "catalytiques'' supplémentaires. La première classe a une série génératrice simple, rationnelle. La deuxième a une série algébrique (quadratique) (Duchi, FPSAC'05). Nous comptons ici les chemins de la troisième classe, et observons un saut de complexité: la série obtenue n'est ni algébrique, ni même différentiellement finie. La quatrième classe, celle des chemins prudents généraux, résiste encore. Cependant, nous définissons un modèle isotrope de chemins prudents sur réseau triangulaire, que nous résolvons de nouveau, la série obtenue n'est pas différentiellement finie. Nous étudions aussi la vitesse d'éloignement de ces chemins, et proposons des algorithmes de génération aléatoire.

An extension of the two-dimensional self-avoiding walk series on the square lattice

1992 ◽  
Vol 25 (7) ◽  
pp. L365-L369 ◽  
Author(s):  
B Masand ◽  
U Wilensky ◽  
J P Massar ◽  
S Redner
Keyword(s):  
Square Lattice ◽  
Two Dimensional ◽  
Self Avoiding Walk
Sign in / Sign up

Export Citation Format

Share Document