Related papers: Optimal tail exponents in general last passage per…
We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically exponentially large.
Large deviation behavior of the largest eigenvalue $\lambda_1$ of Gaussian networks (Erd\H{o}s-R\'enyi random graphs $\mathcal{G}_{n,p}$ with i.i.d. Gaussian weights on the edges) has been the topic of considerable interest. Recently in…
We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…
We prove the convergence and ergodicity of a wide class of real and higher-dimensional continued fraction algorithms, including folded and $\alpha$-type variants of complex, quaternionic, octonionic, and Heisenberg continued fractions,…
We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…
Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…
A common bottleneck in evaluating extremal performance measures is that, due to their very nature, tail data are often very limited. The conventional approach selects the best probability distribution from tail data using parametric…
For the last passage percolation (LPP) on $\mathbb{Z}^2$ with exponential passage times, let $T_{n}$ denote the passage time from $(1,1)$ to $(n,n)$. We investigate the law of iterated logarithm of the sequence $\{T_{n}\}_{n\geq 1}$; we…
Geodesic coalescence, or the tendency of geodesics to merge together, is a hallmark phenomenon observed in a variety of planar random geometries involving a random distortion of the Euclidean metric. As a result of this, the union of…
We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves…
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…
A perturbative method is developed to calculate the finite size corrections of the low lying energies of the asymmetric XXZ hamiltonian near the stochastic line. The crossover from isotropic to anisotropic, Kardar-Parisi-Zhang (KPZ) scaling…
We study a symmetrized (half-space) version of geometric last passage percolation with a boundary parameter $c$ that interpolates between subcritical, critical, and supercritical behavior. This model gives rise to a family of interlacing…
The interplay between two-dimensional percolation growth models and one-dimensional particle processes has been a fruitful source of interesting mathematical phenomena. In this paper we develop a connection between the construction of…
We provide a generalisation of Pinelis' Rademacher-Gaussian tail comparison to complex coefficients. We also establish uniform bounds on the probability that the magnitude of weighted sums of independent random vectors uniform on Euclidean…
Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…
The study of loss function distributions is critical to characterize a model's behaviour on a given machine learning problem. For example, while the quality of a model is commonly determined by the average loss assessed on a testing set,…
We prove that two half-space models in the KPZ universality class, exponential last-passage percolation and a family of Poisson-avoiding metrics generalizing colored TASEP, converge to a common scaling limit. This scaling limit is the…
Let $N$ be the number of triangles in an Erd\H{o}s-R\'enyi graph $\mathcal{G}(n,p)$ on $n$ vertices with edge density $p=d/n,$ where $d>0$ is a fixed constant. It is well known that $N$ weakly converges to the Poisson distribution with mean…