Related papers: Lower deviation and moderate deviation probabiliti…
We prove moderate deviations bounds for the lower tail of the number of odd cycles in a $\calG(n, m)$ random graph. We show that the probability of decreasing triangle density by $t^3$, is $\exp(-\Theta(n^2 t^2))$ whenever $n^{-3/4} \ll t^3…
The extremal process of a branching random walk is the point measure recording the position of particles alive at time $n$, shifted around the expected position of the minimal position. Madaule proved that this point measure converges, as…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…
We introduce a set of tools which simplify and streamline the proofs of limit theorems concerning near-critical particles in branching random walks under optimal assumptions. We exemplify our method by giving another proof of the…
We write $R_n$ for the minimal position attained after time $n$ by a branching random walk in the boundary case. In this article, we prove that $R_n - \frac{1}{2} \log n$ converges in law toward a shifted Gumbel distribution.
The biased random walk on supercritical Galton--Watson trees is known to exhibit a multiscale phenomenon in the slow regime: the maximal displacement of the walk in the first $n$ steps is of order $(\log n)^3$, whereas the typical…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton--Watson (GW) tree with offspring distribution $\nu$. The…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a…
We study the distribution of the maximum $M$ of a random walk whose increments have a distribution with negative mean and belonging, for some $\gamma>0$, to a subclass of the class $\mathcal{S}_\gamma$--see, for example, Chover, Ney, and…
We investigate first-passage statistics of an ensemble of N noninteracting random walks on a line. Starting from a configuration in which all particles are located in the positive half-line, we study S_n(t), the probability that the nth…
These notes were written for the mini-course "Extrema of log-correlated random variables: Principles and Examples" at the Introductory School held in January 2015 at the Centre International de Rencontres Math\'ematiques in Marseille. There…
We study the convergence rate of translation-invariant discrete-time quantum dynamics on a one-dimensional lattice. We prove that the cumulative distributions function of the ballistically scaled position $X(n)/{n}$ after $n$ steps…
In a recent paper, K. Raschel and R. Garbit proved that the exponential decreasing rate of the probability that a random walk (with all exponential moments) stays in a $d$-dimensional orthant is given by the minimum on this orthant of the…
We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…
Let $W_n, n\in\mn_{0}$ be an intrinsic martingale with almost sure limit $W$ in a supercritical branching random walk. We provide criteria for the $L_p$-convergence of the series $\sum_{n\ge 0} e^{an}(W-W_n)$ for $p>1$ and $a>0$. The result…
We provide Monte Carlo estimates of the scaling of the length $L_{n}$ of the longest increasing subsequences of $n$-steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate…
In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different…
Infinite sums of i.i.d. random variables discounted by a multiplicative random walk are called perpetuities and have been studied by many authors. The present paper provides a log-type moment result for such random variables under minimal…