Related papers: On large deviations and intersection of random int…
The zero range process is of particular importance as a generic model for domain wall dynamics of one-dimensional systems far from equilibrium. We study this process in one dimension with rates which induce an effective attraction between…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
Strongly interacting particles in one dimension subject to external confinement have become a topic of considerable interest due to recent experimental advances and the development of new theoretical methods to attack such systems. In the…
In this short note, we propose a new and short approach to polynomial escape rates, which can be applied to various open systems with intermittency. The tool of our approach is the maximal large deviations developed in \cite{mldp}.
In this paper we obtain a couple of explicit expressions for the derivative of the probability of an increasing event in the random interlacements model. The event is supported in a finite subset of the lattice, and the derivative is with…
We analyze a trapping reaction with a single penetrable trap, in a one dimensional lattice, where both species (particles and trap) are mobile and have a drift velocity. We obtain the density as seen from a reference system attached to the…
Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…
We numerically study the structure of the interactions occurring in three-dimensional systems of hard spheres at jamming, focusing on the large-scale behavior. Given the fundamental role they play in the configuration of jammed packings, we…
We establish a large deviation principle for time dependent trajectories (paths) of the empirical density of $N$ particles with long range interactions, for homogeneous systems. This result extends the classical kinetic theory that leads to…
We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…
We consider the branching process in random environment $\{Z_n\}_{n\geq 0}$, which is a~population growth process where individuals reproduce independently of each other with the reproduction law randomly picked at each generation. We…
In this note we prove a large deviation result for the intersection of the ranges of two independent random walks in dimension two. This complements the study of Phetpradap from 2011, where the intersection in dimension three and above was…
Consider standard first-passage percolation on $\mathbb Z^d$. We study the lower-tail large deviations of the rescaled random metric $\widehat{\mathbf T}_n$ restricted to a box. If all exponential moments are finite, we prove that…
We discuss the relationships between large deviations in stochastic systems, and "effective interactions" that induce particular rare events. We focus on the nature of these effective interactions in physical systems with many interacting…
Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P_n} be a sequence of transition matrices on a…
In a generalized framework, where multi-state and inter-state linkages are allowed, we derive a sufficient condition for the stability of synchronization in a network of chaotic attractors. This condition explicitly relates the network…
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high…