Related papers: Longest increasing paths with gaps
We perform the discrete-to-continuum limit passage for a microscopic model describing the time evolution of dislocations in a one dimensional setting. This answers the related open question raised by Geers et al. in [GPPS13]. The proof of…
We introduce a model of a randomly growing interface in multidimensional Euclidean space. The growth model incorporates a random order model as an ingredient of its graphical construction, in a way that replicates the connection between the…
We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…
A limit theorem for the largest interpoint distance of $p$ independent and identically distributed points in $\mathbb{R}^n$ to the Gumbel distribution is proved, where the number of points $p=p_n$ tends to infinity as the dimension of the…
On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…
For a set $A\subset C[0,\infty)$, we give new results on the growth of the number of particles in a dyadic branching Brownian motion whose paths fall within A. We show that it is possible to work without rescaling the paths. We give large…
The one-dimensional Brownian motion starting from the origin at time $t=0$, conditioned to return to the origin at time $t=1$ and to stay positive during time interval $0 < t < 1$, is called the Bessel bridge with duration 1. We consider…
We introduce two stationary versions of two discrete variants of Hammersley's process in a finite box, this allows us to recover in a unified and simple way the laws of large numbers proved by T. Sepp{\"a}l{\"a}inen for two generalized…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
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 limiting properties of ratios of ordered points of point processes whose intensity measures have regularly varying tails, giving a systematic treatment which points the way to "large-trimming" properties of extremal processes and a…
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
We consider the transfer operators of non-uniformly expanding maps for potentials of various regularity, and show that a specific property of potentials ("flatness") implies a Ruelle-Perron-Frobenius Theorem and a decay of the transfer…
In this paper we consider the distribution of the location of the path supremum in a fixed interval for self-similar processes with stationary increments. To this end, a point process is constructed and its relation to the distribution of…
It has been conjectured since the work of Lalley and Sellke (1987) that the branching Brownian motion seen from its tip (e.g. from its rightmost particle) converges to an invariant point process. Very recently, it emerged that this can be…
In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general…
We introduce new probabilistic arguments to derive optimal-order central moment bounds in planar directed last-passage percolation. Our technique is based on couplings with the increment-stationary variants of the model, and is presented in…
We develop perturbative methods to study and control dynamical phenomena related to exceptional points in Non-Hermitian systems. In particular, we show how to find perturbative solutions based on the Magnus expansion that accurately…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…