Related papers: Upper tail large deviation for the one-dimensional…
In this paper we consider the problem of estimating the joint upper and lower tail large deviations of the edge eigenvalues of an Erd\H{o}s-R\'enyi random graph $\mathcal{G}_{n,p}$, in the regime of $p$ where the edge of the spectrum is no…
For one-dimensional Jump-Drift and Jump-Diffusion processes converging towards some steady state, the large deviations of a long dynamical trajectory are described from two perspectives. Firstly, the joint probability of the empirical…
We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…
We consider one or more independent random walks on the $d\ge 3$ dimensional discrete torus. The walks start from vertices chosen independently and uniformly at random. We analyze the fluctuation behavior of the size of some random sets…
We study an inhomogeneous generalization of the classical corner growth in which the weights are exponentially distributed with random parameters. Our main interest is in the quenched and annealed large deviation properties of the last…
In this paper we prove a large deviation principle for the empirical drift of a one-dimensional Brownian motion with self-repellence called the Edwards model. Our results extend earlier work in which a law of large numbers, respectively, a…
Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond the Erd\H{o}s-R\'enyi model, we establish…
The paper deals with the asymptotic behavior of the bridge of a Gaussian process conditioned to stay in $n$ fixed points at $n$ fixed past instants. In particular, functional large deviation results are stated for small time. Several…
In this paper, we study lower tail probabilities of the height function $\mathfrak{h}(M,N)$ of the stochastic six-vertex model. We introduce a novel combinatorial approach to demonstrate that the tail probabilities…
We present a unified framework for first-passage time and residence time of random walks in finite one-dimensional disordered biased systems. The derivation is based on exact expansion of the backward master equation in cumulants. The…
In biological, glassy, and active systems, various tracers exhibit Laplace-like, i.e., exponential, spreading of the diffusing packet of particles. The limitations of the central limit theorem in fully capturing the behaviors of such…
We study the distribution of first-passage functionals ${\cal A}= \int_0^{t_f} x^n(t)\, dt$, where $x(t)$ is a Brownian motion (with or without drift) with diffusion constant $D$, starting at $x_0>0$, and $t_f$ is the first-passage time to…
We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…
We examine a system of interacting random walks with leftward drift on $\mathbb{Z}$, which begins with a single active particle at the origin and some distribution of inactive particles on the positive integers. Inactive particles become…
Financial markets provide an ideal frame for the study of crossing or first-passage time events of non-Gaussian correlated dynamics mainly because large data sets are available. Tick-by-tick data of six futures markets are herein considered…
We study the statistics of the first passage of a random walker to absorbing subsets of the boundary of compact domains in different spatial dimensions. We describe a novel diagnostic method to quantify the trajectory-to-trajectory…
We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of $N$ nodes with degree distribution $P(k)$. We focus on the case…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…
For the M/M/1+M model at the law-of-large-numbers scale, the long run reneging count per unit time does not depend on the individual (i.e., per customer) reneging rate. This paradoxical statement has a simple proof. Less obvious is a large…