English
Related papers

Related papers: Perfect Matchings and Essential Spanning Forests i…

200 papers

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

Probability · Mathematics 2023-08-21 Héloïse Constantin

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

Metric Geometry · Mathematics 2017-10-26 Jeff Lindquist

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…

Probability · Mathematics 2019-06-05 Ori Gurel-Gurevich , Daniel C. Jerison , Asaf Nachmias

The arboreal gas is the random (unrooted) spanning forest of a graph in which each forest is sampled with probability proportional to $\beta^{\# \text{edges}}$ for some $\beta\geq 0$, which arises as the $q\to 0$ limit of the…

Probability · Mathematics 2024-12-11 Noah Halberstam , Tom Hutchcroft

In this article we study the double dimer model on hyperbolic Temperleyan graphs via circle packings. We prove that on such graphs, the weak limit of the dimer model exists if and only if the removed black vertex from the boundary of the…

Probability · Mathematics 2024-07-01 Gourab Ray

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

Combinatorics · Mathematics 2007-05-23 Richard W. Kenyon , James G. Propp , David B. Wilson

We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the…

Probability · Mathematics 2018-01-24 Tom Hutchcroft , Asaf Nachmias

Benjamini and Schramm (1996) used circle packing to prove that every transient, bounded degree planar graph admits non-constant harmonic functions of finite Dirichlet energy. We refine their result, showing in particular that for every…

Probability · Mathematics 2019-01-11 Tom Hutchcroft

We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…

Probability · Mathematics 2021-07-06 Roland Bauerschmidt , Nicholas Crawford , Tyler Helmuth , Andrew Swan

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…

Probability · Mathematics 2019-05-31 Tom Hutchcroft

Past studies on the local limit of maximal weight matchings in edge-weighted large random graphs rely fundamentally on the assumption that the weights are atomless, which ensures that the maximal weight matching is unique. This excludes de…

Probability · Mathematics 2026-01-29 Nathanaël Enriquez , Mike Liu , Laurent Ménard , Vianney Perchet

Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…

High Energy Physics - Theory · Physics 2023-03-20 Alexander Gorsky , Vladimir Kazakov , Fedor Levkovich-Maslyuk , Victor Mishnyakov

Invariant correlation functions for ${\rm SO}(1,N)$ hyperbolic sigma-models are investigated. The existence of a large $N$ asymptotic expansion is proven on finite lattices of dimension $d \geq 2$. The unique saddle point configuration is…

Mathematical Physics · Physics 2008-11-26 Max Niedermaier , Erhard Seiler

We show that nontrivial bi-infinite polymer Gibbs measures do not exist in typical environments in the inverse-gamma (or log-gamma) directed polymer model on the planar square lattice. The precise technical result is that, except for…

Probability · Mathematics 2020-11-12 Ofer Busani , Timo Seppäläinen

Plaquette models are short range ferromagnetic spin models that play a key role in the dynamic facilitation approach to the liquid glass transition. In this paper we perform a rigorous study of the thermodynamic properties of two…

Mathematical Physics · Physics 2017-10-25 P. Chleboun , A. Faggionato , F. Martinelli , C. Toninelli

An essential spanning forest of an infinite graph $G$ is a spanning forest of $G$ in which all trees have infinitely many vertices. Let $G_n$ be an increasing sequence of finite connected subgraphs of $G$ for which $\bigcup G_n=G$.…

Probability · Mathematics 2007-05-23 Scott Sheffield

We investigate the asymptotic behavior of perfect matchings on rail-yard graphs with doubly free boundary conditions and Jack weights. While a special case of this model reduces to the half space Macdonald process with Jack weights…

Probability · Mathematics 2025-05-27 Zhongyang Li , Kaili Shi

We study the nonlinear supersymmetric hyperbolic sigma model introduced by Zirnbauer in 1991. This model can be related to the mixing measure of a vertex- reinforced jump process. We prove that the two-point correlation function has a…

Probability · Mathematics 2015-06-08 Margherita Disertori , Franz Merkl , Silke W. W. Rolles

We consider a class of doubly nonlinear degenerate hyperbolic-parabolic equations with homogeneous Dirichlet boundary conditions, for which we first establish the existence and uniqueness of entropy solutions. We then turn to the…

Analysis of PDEs · Mathematics 2009-01-08 Boris Andreianov , Mostafa Bendahmane , Kenneth H. Karlsen

Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of…

Functional Analysis · Mathematics 2025-03-11 Chris Gartland
‹ Prev 1 2 3 10 Next ›