Related papers: Determinantal spanning forests on planar graphs
We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem has long been known to be polynomial-time solvable; the…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…
We construct a natural discrete random field on $\mathbb{Z}^{d}$, $d\geq 5$ that converges weakly to the bi-Laplacian Gaussian field in the scaling limit. The construction is based on assigning i.i.d. Bernoulli random variables on each…
An essential spanning forest of an infinite graph $G$ is a spanning forest of $G$ in which all trees have infinitely many vertices. Let $G_n$ be an increasing sequence of finite connected subgraphs of $G$ for which $\bigcup G_n=G$.…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
Sparse trees are trees with sparse branchings. The Laplacian on some of these trees can be shown to have singular spectral measures. We focus on a simple family of sparse trees for which the dimensions can be naturally defined and shown to…
We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the…
We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
To any positive contraction $Q$ on $\ell^2(W)$, there is associated a determinantal probability measure ${\mathbf P}^Q$ on $2^W$, where $W$ is a denumerable set. Let $\Gamma$ be a countable sofic finitely generated group and $G = (\Gamma,…
We introduce a one-parameter family of massive Laplacian operators $(\Delta^{m(k)})_{k\in[0,1)}$ defined on isoradial graphs, involving elliptic functions. We prove an explicit formula for the inverse of $\Delta^{m(k)}$, the massive Green…
We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…
We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…
The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar family is crossed. This generalizes the well-studied…
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…