Related papers: A Flow in the Forest
The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q -> 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have…
We apply the matrix-tree theorem to establish a link between various diagrammatic and determinant expressions, which naturally appear in scattering amplitudes of gravity theories. Using this link we are able to give a general…
On large scales, the Lyman-$\alpha$ forest provides insights into the expansion history of the Universe, while on small scales, it imposes strict constraints on the growth history, the nature of dark matter, and the sum of neutrino masses.…
We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special case, we show that unrooted spanning forests, which arise as a q…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…
In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…
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 propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs, it takes into account all paths between vertices. Formally, it is defined as d(i,j)=q_{ii}+q_{jj}-q_{ij}-q_{ji}, where q_{ij}…
The most general large N eigenvalues distribution for the one matrix model is shown to consist of tree-like structures in the complex plane. For the m=2 critical point, such a split solution describes the strong coupling phase of 2d quantum…
We generalize the Marinari-Parisi definition for pure two dimensional quantum gravity $(k = 2)$ to all non unitary minimal multicritical points $(k \geq 3)$. The resulting interacting Fermi gas theory is treated in the collective field…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
Understanding the flow dynamics of yield stress fluids in porous media presents a substantial challenge. Both experiments and extensive numerical simulations frequently show a non-linear relationship between the flow rate and the pressure…
Using local detailed balance we rewrite the Kirchhoff formula for stationary distribution of Markov jump processes in terms of a physically interpretable tree-ensemble. We use that arborification of path-space integration to derive a…
We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…
We present a self-contained analysis of theories of discrete 2D gravity coupled to matter, using geometric methods to derive equations for generating functions in terms of free (noncommuting) variables. For the class of discrete gravity…
We introduce a technique for restoring general coordinate invariance into theories where it is explicitly broken. This is the analog for gravity of the Callan-Coleman-Wess-Zumino formalism for gauge theories. We use this to elucidate the…
We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…
The forest matrix plays a crucial role in network science, opinion dynamics, and machine learning, offering deep insights into the structure of and dynamics on networks. In this paper, we study the problem of querying entries of the forest…