Related papers: Spanning trees, cycle-rooted spanning forests on d…
The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a…
We study the scaling limit of a divisible sandpile model associated to a truncated $\alpha$-stable random walk. We prove that the limiting distribution is related to an obstacle problem for a truncated fractional Laplacian. We also provide,…
Fix a bounded $3$-polygon $(\Omega; x_1, x_2, x_3)$ with three marked boundary points $x_1, x_2, x_3\in\partial\Omega$ and suppose $(\Omega^{\delta}; x_1^{\delta}, x_2^{\delta}, x_3^{\delta})$ is an approximation of $(\Omega; x_1, x_2,…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…
We establish an exact analytic relation between random spanning forests and the heat-kernel partition function. This identity enables estimation of partition functions, energies, and the Von Neumann entropy by Wilson sampling of forests,…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…
We study the perturbative unitarity of scattering amplitudes in general dimensional reductions of Yang-Mills theories and general relativity on closed internal manifolds. For the tree amplitudes of the dimensionally reduced theory to have…
We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…
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,…
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$…
In the objective of studying concentration and oscillation properties of eigenfunctions of the discrete Laplacian on regular graphs, we construct a pseudo-differential calculus on homogeneous trees, their universal covers. We define symbol…
We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…
For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…