Related papers: Pfaffian formulas for spanning tree probabilities
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$…
The alpha model, a parametrized family of probabilities on cladograms (rooted binary leaf labeled trees), is introduced. This model is Markovian self-similar, deletion-stable (sampling consistent), and passes through the Yule, Uniform and…
The present paper is a contribution to categorial index theory. Its main result is the calculation of the Pfaffian line bundle of a certain family of real Dirac operators as an object in the category of line bundles. Furthermore, it is…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the…
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…
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…
We present a determinantal formula for the number of spanning trees of a complete multipartite graph containing a given spanning forest $F$. Our approach relies on the Generalized Matrix Determinant Lemma and Jacobi's formula for the…
We derive a variant of the loop-tree duality for Feynman integrals in the Schwinger parametric representation. This is achieved by decomposing the integration domain into a disjoint union of cells, one for each spanning tree of the graph…
The cophenetic metrics $d_{\varphi,p}$, for $p\in {0}\cup[1,\infty[$, are a recent addition to the kit of available distances for the comparison of phylogenetic trees. Based on a fifty years old idea of Sokal and Rohlf, these metrics…
This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from…
From the perturbative expansion of the exact Green function, an exact counting formula is derived to determine the number of different types of connected Feynman diagrams. This formula coincides with the Arqu\`es-Walsh sequence formula in…
We present new short proofs of known spanning tree enumeration formulae for threshold and Ferrers graphs by showing that the Laplacian matrices of such graphs admit triangular rank-one perturbations. We then characterize the set of graphs…
An arborescence of a directed graph $\Gamma$ is a spanning tree directed toward a particular vertex $v$. The arborescences of a graph rooted at a particular vertex may be encoded as a polynomial $A_v(\Gamma)$ representing the sum of the…
We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…
Integrals of the Pfaffian form over the nonsingular part of a projective variety compute information closely related to the Mather-Chern class of the variety and to other invariants such as the local Euler obstruction along strata of its…
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…