English
Related papers

Related papers: Pfaffian formulas for spanning tree probabilities

200 papers

We define natural probability measures on cycle-rooted spanning forests (CRSFs) on graphs embedded on a surface with a Riemannian metric. These measures arise from the Laplacian determinant and depend on the choice of a unitary connection…

Probability · Mathematics 2017-04-06 Adrien Kassel , Richard Kenyon

We prove the existence of an automorphism-invariant coupling for the wired and the free uniform spanning forests on Cayley graphs of finitely generated residually amenable groups.

Probability · Mathematics 2007-05-23 Lewis Bowen

Some Pfaffian manifolds admit the construction of an associated Weyl line-bundle in which the lift of the Pfaffian structure defines a 2-form which is basic. We identify the conditions under which this construction is possible, implement…

Mathematical Physics · Physics 2009-11-17 F. A. M. Frescura , G. Lubczonok

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

Combinatorics · Mathematics 2023-01-31 Ron Rosenthal , Lior Tenenbaum

We attempt to systematically derive tree-level scattering amplitudes in four-dimensional, planar, maximally supersymmetric Yang-Mills theory from integrability. We first review the connections between integrable spin chains, Yangian…

High Energy Physics - Theory · Physics 2019-04-15 Nils Kanning , Matthias Staudacher

Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…

Combinatorics · Mathematics 2013-10-21 Jang Soo Kim , Karola Meszaros , Greta Panova , David B. Wilson

We give a Pfaffian formula to compute the partition function of the Ising model on any graph $G$ embedded in a closed, possibly non-orientable surface. This formula, which is suitable for computational purposes, is based on the relation…

Mathematical Physics · Physics 2020-08-26 Anh Minh Pham

We introduce and study the general problem of finding a most "scale-free-like" spanning tree of a connected graph. It is motivated by a particular problem in epidemiology, and may be useful in studies of various dynamical processes in…

Combinatorics · Mathematics 2023-07-12 Yury Orlovich , Kirill Kukharenko , Volker Kaibel , Pavel Skums

We derive an expression for the product of the Pfaffians of two skew-symmetric matrices A and B as a sum of products of the traces of powers of AB and an expression for the inverse matrix A$^{-1}$, or equivalently B$^{-1}$, as a…

Mathematical Physics · Physics 2016-07-14 M. I. Krivoruchenko

Pfaffians of matrices with entries z[i,j]/(x\_i+x\_j), or determinants of matrices with entries z[i,j]/(x\_i-x\_j), where the antisymmetrical indeterminates z[i,j] satisfy the Pl\"ucker relations, can be identified with a trace in an…

Combinatorics · Mathematics 2007-05-23 Alain Lascoux

We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.

History and Overview · Mathematics 2018-11-27 Anton Petrunin

Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present…

Combinatorics · Mathematics 2017-06-15 Alexander P. Kartun-Giles , Orestis Georgiou , Carl P. Dettmann

Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…

Combinatorics · Mathematics 2023-03-10 Maksim Zhukovskii

We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann , Alexei Myasnikov

Given a closed orientable surface (\Sigma) of genus at least two, we establish an affine isomorphism between the convex compact set of isotopy-invariant topological measures on (\Sigma) and the convex compact set of additive functions on…

General Topology · Mathematics 2009-03-17 Frol Zapolsky

We classify weakly connected spanning closed (WCSC) subgraphs of $\overrightarrow{C_n^2}$, the square of a directed $n$-vertex cycle. Then we show that every spanning tree of $\overrightarrow{C_n^2}$ is contained in a unique nontrivial WCSC…

Combinatorics · Mathematics 2026-01-21 Yuuho Tanaka

Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…

Soft Condensed Matter · Physics 2026-05-19 Pieter H. W. van der Hoek , Angelo Rosa , Elham Ghobadpour , Ralf Everaers

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

Probability · Mathematics 2014-07-01 Rudolf Grübel , Igor Michailow

We consider the covariant quantization of generalized abelian gauge theories on a closed and compact n-dimensional manifold whose space of gauge invariant fields is the abelian group of Cheeger-Simons differential characters. The space of…

High Energy Physics - Theory · Physics 2009-11-28 Gerald Kelnhofer

We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…

Combinatorics · Mathematics 2025-11-04 Rebecca Carter