English
Related papers

Related papers: A quantitative Burton-Keane estimate under strong …

200 papers

Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…

Probability · Mathematics 2024-10-08 Hugo Vanneuville

We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…

Probability · Mathematics 2026-04-23 Antonio Blanca , Reza Gheissari , Heehyun Park , Xusheng Zhang

We analyse a two-particle quantum system in $\R^d$ with interaction and in presence of a random external potential field with a continuous argument (an Anderson model in a continuous space). Our aim is to establish the so-called Wegner-type…

Mathematical Physics · Physics 2008-12-16 A. Boutet de Monvel , V. Chulaevsky , Y. Suhov

We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…

Probability · Mathematics 2011-12-05 Svante Janson

Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…

Probability · Mathematics 2022-04-08 Van Hao Can , David A. Croydon , Takashi Kumagai

The probabilities for gaps in the eigenvalue spectrum of finite $ N\times N $ random unitary ensembles on the unit circle with a singular weight, and the related hermitian ensembles on the line with Cauchy weight, are found exactly. The…

Mathematical Physics · Physics 2016-09-07 N. S. Witte , P. J. Forrester

This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…

Probability · Mathematics 2013-01-29 Jean Bertoin

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

Probability · Mathematics 2013-12-06 Markus Heydenreich , Remco van der Hofstad , Tim Hulshof

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set $A$, the suitably rescaled probability that the cluster of $z$ intersects $A$ converges as $\|z\|\to\infty$. This can be viewed…

Probability · Mathematics 2025-09-26 Amine Asselah , Bruno Schapira , Perla Sousi

We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour spreads out trough an infinite number of individuals. We present sharp lower…

Probability · Mathematics 2010-11-29 Valdivino V. Junior , Fábio P. Machado , Mauricio Zuluaga

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

In the high-energy limit, we compute the gauge-invariant three-parton forward clusters, which in the BFKL theory constitute the tree parts of the NNLO impact factors. In the triple collinear limit, we obtain the polarized double-splitting…

High Energy Physics - Phenomenology · Physics 2008-11-26 Vittorio Del Duca , Alberto Frizzo , Fabio Maltoni

We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…

Combinatorics · Mathematics 2024-04-09 Sam Mattheus , Geertrui Van de Voorde

Ahlberg, Griffiths, Morris and Tassion have proved that, asymptotically almost surely, the quenched crossing probabilities for critical planar Voronoi percolation do not depend on the environment. We prove an analogous result for arm…

Probability · Mathematics 2021-10-04 Hugo Vanneuville

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

Probability · Mathematics 2010-06-04 Florian Sobieczky

We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration…

Probability · Mathematics 2026-03-05 Matteo D'Achille , Francesco Mattesini , Dario Trevisan

Recently, van den Berg and Jonasson gave the first substantial extension of the BK inequality for non-product measures: they proved that, for k-out-of-n measures, the probability that two increasing events occur disjointly is at most the…

Probability · Mathematics 2012-03-19 J. van den Berg , A. Gandolfi

We develop an Ornstein--Zernike theory for the two-dimensional random-cluster model with $1 \leq q <4$ that also applies in its near-critical regime. In particular, we prove an asymptotic formula for the two-point function which holds…

Probability · Mathematics 2025-10-21 Lucas D'Alimonte , Ioan Manolescu

We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…

Probability · Mathematics 2025-09-03 Frankie Higgs

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

Probability · Mathematics 2026-03-10 Partha S. Dey , S. Rasoul Etesami , Aditya S. Gopalan
‹ Prev 1 4 5 6 7 8 10 Next ›