English
Related papers

Related papers: Upper tail large deviation for the one-dimensional…

200 papers

We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…

Probability · Mathematics 2026-01-27 Omer Angel , Daniel de la Riva , Jonathan Hermon , Yuliang Shi

We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…

Probability · Mathematics 2018-08-13 Erin Beckman , Natalie Frank , Yufeng Jiang , Matthew Junge , Si Tang

The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…

Statistical Mechanics · Physics 2010-01-30 Zhongzhi Zhang , Yi Qi , Shuigeng Zhou , Shuyang Gao , Jihong Guan

The motion of a lazy Pearson walker is studied with different probability ($p$) of jump in two and three dimensions. The probability of exit ($P_e$) from a zone of radius $r_e$, is studied as a function of $r_e$ with different values of…

Statistical Mechanics · Physics 2016-08-01 Muktish Acharyya

The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\mu$ on the full $d$-ary tree of height $n$. If $\mu= \Omega( d^2)$, all of the vertices are…

Probability · Mathematics 2019-12-04 Christopher Hoffman , Tobias Johnson , Matthew Junge

We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.

Probability · Mathematics 2017-09-14 Dariusz Buraczewski , Mariusz Maslanka

We study the asymptotic tail behaviour of the first-passage time over a moving boundary for asymptotically $\alpha$-stable L\'evy processes with $\alpha<1$. Our main result states that if the left tail of the L\'evy measure is regularly…

Probability · Mathematics 2015-01-14 Frank Aurzada , Tanja Kramm

We investigate the large deviation probabilities of first passage times (FPT) of discrete-time supercritical non-lattice branching random walks (BRWs) in $\mathbb{R}^d$ where $d\geq 1$. The FPT refers to the first time the BRW enters a ball…

Probability · Mathematics 2025-08-21 Jose Blanchet , Wei Cai , Shaswat Mohanty , Zhenyuan Zhang

We study sample-path large deviations for L\'evy processes and random walks with heavy-tailed jump-size distributions that are of Weibull type. Our main results include an extended form of an LDP (large deviations principle) in the $J_1$…

Probability · Mathematics 2019-12-06 Mihail Bazhba , Jose Blanchet , Chang-Han Rhee , Bert Zwart

We investigate the behaviour of the response function in the one dimensional trap model using scaling arguments that we confirm by numerical simulations. We study the average position of the random walk at time tw+t given that a small bias…

Disordered Systems and Neural Networks · Physics 2009-11-10 E. M. Bertin , J. -P. Bouchaud

In a variety of problems in pure and applied probability, it is of relevant to study the large exceedance probabilities of the perpetuity sequence $Y_n := B_1 + A_1 B_2 + \cdots + (A_1 \cdots A_{n-1}) B_n$, where $(A_i,B_i) \subset…

Probability · Mathematics 2014-12-01 Dariusz Buraczewski , Jeffrey F. Collamore , Ewa Damek , Jacek Zienkiewicz

We investigate the phase diagram and critical behavior of a three-dimensional lattice CP(N-1) model in the large-N limit. Numerical evidence of first-order transitions is always observed for sufficiently large values of N, i.e. N>2 up to…

Statistical Mechanics · Physics 2020-04-22 Andrea Pelissetto , Ettore Vicari

We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail…

Combinatorics · Mathematics 2019-04-12 Yufei Zhao

We investigate the moderate and large deviations in first-passage percolation (FPP) with bounded weights on $\mathbb{Z}^d$ for $d \geq 2$. Write $T(\mathbf{x}, \mathbf{y})$ for the first-passage time and denote by $\mu(\mathbf{u})$ the time…

Probability · Mathematics 2025-12-04 Wai-Kit Lam , Shuta Nakajima

We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…

Probability · Mathematics 2024-04-16 Julien Verges

We study large deviation probabilities for a sum of dependent random variables from a heavy-tailed factor model, assuming that the components are regularly varying. We identify conditions where both the factor and the idiosyncratic terms…

Probability · Mathematics 2007-12-05 Boualem Djehiche , Jens Svensson

The focus of this article is on the different behavior of large deviations of random subadditive functionals above the mean versus large deviations below the mean in two random media models. We consider the point-to-point first passage…

Probability · Mathematics 2009-06-24 M. Cranston , D. Gauthier , T. S. Mountford

In this paper, we study the tail behavior of $\max_{i\leq N}\sup_{s>0}\left(W_i(s)+W_A(s)-\beta s\right)$ as $N\to\infty$, with $(W_i,i\leq N)$ i.i.d. Brownian motions and $W_A$ an independent Brownian motion. This random variable can be…

Probability · Mathematics 2022-08-10 Dennis Schol , Maria Vlasiou , Bert Zwart

We study the small-time behaviour of the rough Bergomi model, introduced by Bayer, Friz and Gatheral (2016), and prove a large deviations principle for a rescaled version of the normalised log stock price process, which then allows us to…

Probability · Mathematics 2019-07-10 Antoine Jacquier , Mikko S. Pakkanen , Henry Stone

The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…

Probability · Mathematics 2019-09-25 Tobias Johnson , Matthew Junge