English
Related papers

Related papers: Uniqueness of the infinite tree in low-dimensional…

200 papers

We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…

Probability · Mathematics 2016-07-20 Gabriel Berzunza

We study a conductance-weighted arboricity for a finite simple undirected graph $G=(V,E,c)$ with a conductance assignment $c:E\to[0,\infty)$: \[ A_c(G):=\max\bigl\{ D_c(H): H\subseteq G\text{ connected}, |V(H)|\ge 2 \bigr\},\qquad…

Combinatorics · Mathematics 2026-03-10 Rowan Moxley

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

Dynamical Systems · Mathematics 2022-10-07 Karl Petersen , Ibrahim Salama

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

Condensed Matter · Physics 2008-11-26 C. Destri , L. Donetti

In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…

Probability · Mathematics 2016-12-06 Joel Spencer , Moumanti Podder

Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm…

Probability · Mathematics 2013-01-15 Louigi Addario-Berry

We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…

Group Theory · Mathematics 2025-12-02 Yukun Du , Sa'ar Hersonsky

We study properties of the harmonic measure of balls in typical large discrete trees. For a ball of radius $n$ centered at the root, we prove that, although the size of the boundary is of order $n$, most of the harmonic measure is supported…

Probability · Mathematics 2017-07-04 Nicolas Curien , Jean-François Le Gall

For any small constant $\epsilon>0$, the Erd\H{o}s-R\'enyi random graph $G(n,\frac{1+\epsilon}{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon))2\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by…

Combinatorics · Mathematics 2023-08-29 Tolson Bell , Alan Frieze

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…

Computational Geometry · Computer Science 2011-06-03 Luc Devroye , James King

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

Probability · Mathematics 2012-11-12 Nicolas Broutin , Philippe Flajolet

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

Probability · Mathematics 2016-02-16 Paul Jung

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

Combinatorics · Mathematics 2014-05-27 Richard Montgomery

The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…

Statistics Theory · Mathematics 2014-09-09 Erwan Scornet

We study the chaotic behavior of the Gibbs state of spin-glasses under the application of an external magnetic field, in the crossover region where the field intensity scales proportional to $1/\sqrt{N}$, being $N$ the system size. We show…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

Combinatorics · Mathematics 2007-05-23 Graham R. Brightwell , Peter Winkler

We conjecture that in a consistent supergravity theory with non-vanishing gravitino mass, the limit $m_{3/2}\rightarrow 0$ is at infinite distance. In particular one can write $M_{\mathrm{tower}} \sim m_{3/2}^\delta$ so that as the…

High Energy Physics - Theory · Physics 2021-09-15 Alberto Castellano , Anamaría Font , Alvaro Herraez , Luis E. Ibáñez

We establish a Mermin--Wagner type theorem for Gibbs states on infinite random Lorentzian triangulations (LT) arising in models of quantum gravity. Such a triangulation is naturally related to the distribution $\sf P$ of a critical…

Mathematical Physics · Physics 2015-06-11 M. Kelbert , Yu. Suhov , A. Yambartsev

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

Probability · Mathematics 2021-07-28 Othmane Safsafi

Given n independent Bernoulli(p) random variables X_i, i = 1, ..., n, representing the opinions of individuals connected by an underlying random k-regular graph G_n on {1, ..., n}, we show that when conditioned on an atypical empirical…

Probability · Mathematics 2026-03-03 I-Hsun Chen , Ivan Lee , Kavita Ramanan , Sarath Yasodharan