Related papers: Pfaffian formulas for spanning tree probabilities
In this paper, we define a class of auxiliary graphs associated with simple undirected graphs. This class of auxiliary graphs is based on the set of spanning trees of the original graph and the edges constituting those spanning trees. A…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
The Pfaffian structure of the boundary monomer correlation functions in the dimer-covering planar graph models is rederived through a combinatorial / topological argument. These functions are then extended into a larger family of…
In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…
In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic…
Recently, Zheng and Wu defined the concept of odd spanning tree of a graph, meaning a spanning tree in which every vertex has odd degree. Similar to Cayley's formula, Feng, Chen and Wu counted the number of odd spanning trees in complete…
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
We find explicit formulas for the probabilities of general boundary visit events for planar loop-erased random walks, as well as connectivity events for branches in the uniform spanning tree. We show that both probabilities, when suitably…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
We find explicit SLE(8) partition functions for the scaling limits of Peano curves in the uniform spanning tree (UST) in topological polygons with general boundary conditions. They are given in terms of Coulomb gas integral formulas, which…
We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\epsilon}} for some constant \epsilon>0, then with high probability the random graph G(n,p) contains a copy of T.…