Related papers: Pfaffian formulas for spanning tree probabilities
In this paper, we characterize a mixed graph $F$ which contains $k$ edge and arc disjoint spanning mixed arborescences $F_{1}, \ldots, F_{k}$, such that for each $v \in V(F)$, the cardinality of $\{i \in [k]: v \text{ is the root of }…
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit…
Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical…
We compute expectation values of mixed traces containing both matrices in a two matrix model, i.e. generating function for counting bicolored discrete surfaces with non uniform boundary conditions. As an application, we prove the $x-y$…
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…
We propose a general method to obtain the scalar worldline Green function on an arbitrary 1D topological space, with which the first-quantized method of evaluating 1-loop Feynman diagrams can be generalized to calculate arbitrary ones. The…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…
When a simply connected domain $D\subset{\mathbb{R}}^d$ ($d\ge 2$) is approximated in a "good" way by embedded connected weighted graphs, we prove that the transfer current matrix (defined on the edges of the graph viewed as an electrical…
Using a generating function approach, the correlation coefficients of four different graph-theoretical indices, namely the number of independent vertex subsets, the number of matchings, the number of subtrees and the Wiener index, are…
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d in d dimensions under free, periodic, and…
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
A conjecture for computing all genus topological closed string amplitudes on toric local Calabi-Yau threefolds, by interpreting the associated 5-brane web as a Feynman diagram, is given. A propagator and a three point vertex is defined…
In order to use the Gaussian representation for propagators in Feynman amplitudes, a representation which is useful to relate string theory and field theory, one has to prove first that each $\alpha$- parameter (where $\alpha$ is the…
Given a gene-tree labeled topology $G$ and a species tree $S$, the "ancestral configurations" at an internal node $k$ of $S$ represent the combinatorially different sets of gene lineages that can be present at $k$ when all possible…
A new way of computing scattering amplitudes in a certain very important QFT (N=4 SYM) has recently been developed, in which an algebraic structure called the positive Grassmannian plays a very important role. The mathematics of the…