English
Related papers

Related papers: On Long Range Percolation with Heavy Tails

200 papers

We study the possible scaling limits of percolation interfaces in two dimensions on the triangular lattice. When one lets the percolation parameter p(N) vary with the size N of the box that one is considering, three possibilities arise in…

Probability · Mathematics 2017-07-19 Pierre Nolin , Wendelin Werner

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…

Probability · Mathematics 2024-12-31 David Coupier , Benoît Henry , Benedikt Jahnel , Jonas Köppl

In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…

Probability · Mathematics 2007-05-23 Jinho Baik , Percy Deift , Ken McLaughlin , Peter Miller , Xin Zhou

We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $x$ and $y$ are connected with probability $1-e^{-\beta\|x-y\|^{-d-\alpha}}$ for $\alpha > 0$. Provided the critical exponents $\delta$ and $2-\eta$ defined by…

Probability · Mathematics 2024-10-15 Johannes Bäumler , Noam Berger

Consider an n x n Hermitian random matrix with, above the diagonal, independent entries with alpha-stable symmetric distribution and 0 < alpha < 2. We establish new bounds on the rate of convergence of the empirical spectral distribution of…

Probability · Mathematics 2012-02-01 Charles Bordenave , Alice Guionnet

This article proposes a new method of truncated estimation to estimate the tail index $\alpha$ of the extremely heavy-tailed distribution with infinite mean or variance. We not only present two truncated estimators $\hat{\alpha}$ and…

Statistics Theory · Mathematics 2022-09-13 F. Q. Tang , D. Han

We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy…

Probability · Mathematics 2022-07-27 Milad Bakhshizadeh , Arian Maleki , Victor H. de la Pena

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

Probability · Mathematics 2021-07-30 Jieliang Hong

Suppose that $(Z_n)_{n\geq0}$ is a supercritical branching process in independent and identically distributed random environment. The right tail function of the scaled growth rate for $(Z_n)_{n\geq0}$ is studied. The upper bounds for…

Probability · Mathematics 2021-03-02 Yinna Ye

In this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank- and tree-width of…

Combinatorics · Mathematics 2024-01-29 Tuan Anh Do , Joshua Erde , Mihyun Kang

On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…

Probability · Mathematics 2026-04-21 Isaac Meilijson

We address the important question of the extent to which random variables and vectors with truncated power tails retain the characteristic features of random variables and vectors with power tails. We define two truncation regimes, soft…

Probability · Mathematics 2010-01-20 Arijit Chakrabarty , Gennady Samorodnitsky

We introduce a non-standard model for percolation on the integer lattice $\mathbb Z^2$. Randomly assign to each vertex $a \in \mathbb Z^2$ a potential, denoted $\phi_a$, chosen independently and uniformly from the interval $[0, 1]$. For…

Probability · Mathematics 2021-10-26 James Campbell , Alexandra Deane , Anthony Quas

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…

Probability · Mathematics 2015-02-11 Hugo Duminil-Copin , Vincent Tassion

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

Probability · Mathematics 2021-11-02 Rémy Sanchis , Diogo C. dos Santos , Roger W. C. Silva

Let $0<a<b<\infty$, and for each edge $e$ of $Z^d$ let $\omega_e=a$ or $\omega_e=b$, each with probability 1/2, independently. This induces a random metric $\dist_\omega$ on the vertices of $Z^d$, called first passage percolation. We prove…

Probability · Mathematics 2008-11-26 Itai Benjamini , Gil Kalai , Oded Schramm

In this paper we study Lifshitz tails for continuous Laplacian in a continuous site percolation situation. By this we mean that we delete a random set $\Gamma_\omega$ from $IR^d$ and consider the Dirichlet or Neumann Laplacian on…

Mathematical Physics · Physics 2012-10-18 Werner Kirsch , Hatem Najar

In this short note we consider mixed short-long range independent bond percolation models on $\Z^{k+d}$. Let $p_{uv}$ be the probability that the edge $(u,v)$ will be open. Allowing a $x,y$-dependent length scale and using a multi-scale…

Mathematical Physics · Physics 2007-09-10 Gastao A. Braga , Leandro M. Cioletti , Remy Sanchis

We consider some general facts concerning convergence P_{n}-Q_{n}\to 0 as n\to \infty, where P_{n} and Q_{n} are probability measures in a complete separable metric space. The main point is that the sequences {P_{n}} and {Q_{n}} are not…

Probability · Mathematics 2007-06-30 Davydov Youri , Rotar Vladimir

The upper tail problem for the largest eigenvalue of the Erd\H{o}s--R\'enyi random graph $\mathcal{G}_{n,p}$ is to estimate the probability that the largest eigenvalue of the adjacency matrix of $\mathcal{G}_{n,p}$ exceeds its typical value…

Probability · Mathematics 2020-12-01 Bhaswar B. Bhattacharya , Shirshendu Ganguly
‹ Prev 1 4 5 6 7 8 10 Next ›