Related papers: Spanning Forests on Random Planar Lattices
I consider a lattice model of a gauge field interacting with matrix-valued scalars in $D$ dimensions. The model includes an adjustable parameter $\s$, which plays role of the string tension. In the limit $\s=\infty$ the model coincides with…
In this article we report a preliminary investigation of the large $N$ limit of a generalized one-matrix model which represents an $O(n)$ symmetric model on a random lattice. The model on a regular lattice is known to be critical only for…
The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers under linear operations generated by rotations, reflections, and positive scalar dilations. It may be viewed as a point in the…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
We introduce a two-parameter family of probability measures on spanning trees of a planar map. One of the parameters controls the activity of the spanning tree and the other is a measure of its bending energy. When the bending parameter is…
In this paper we present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, for arbitrary temperature on $n$-vertex strip graphs, of width $L_y=2$ and arbitrary length, of the…
We consider flexible branched polymer, with quenched branch structure, and show that its conformational entropy as a function of its gyration radius $R$, at large $R$, obeys, in the scaling sense, $\Delta S \sim R^2/(a^2L)$, with $a$ bond…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
This paper provides an extension of the constructive loop vertex expansion to stable matrix models with interactions of arbitrarily high order. We introduce a new representation for such models, then perform a forest expansion on this…
A critical dilute O($n$) model on the kagome lattice is investigated analytically and numerically. We employ a number of exact equivalences which, in a few steps, link the critical O($n$) spin model on the kagome lattice to the exactly…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
Recently it has been claimed that ordinary perturbation theory (OPT) gives incorrect weak coupling expansions for lattice O(N) non-linear sigma models in the infinite volume limit, and in particular that the two-dimensional non-abelian…
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…