Related papers: Longest increasing paths with gaps

The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter are called diametrically opposite vertices. The collection of shortest paths between…

In [7], Berthelin, Degond, Delitala and Rascle introduced a traffic flow model describing the formation and the dynamics of traffic jams. This model consists of a Pressureless Gas Dynamics system under a maximal constraint on the density…

We consider finite collections of $N$ non-intersecting Brownian paths on the line and on the half-line with both absorbing and reflecting boundary conditions (corresponding to Brownian excursions and reflected Brownian motions) and compute…

To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…

We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…

Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…

The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…

In the Hammersley-Aldous-Diaconis process infinitely many particles sit in R and at most one particle is allowed at each position. A particle at x$ whose nearest neighbor to the right is at y, jumps at rate y-x to a position uniformly…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

We extend the Aw-Rascle macroscopic model of car traffic into a two-way multi-lane model of pedestrian traffic. Within this model, we propose a technique for the handling of the congestion constraint, i.e. the fact that the pedestrian…

One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…

We consider an affine Euclidean lattice and record the directions of all lattice vectors of length at most $T$. Str\"ombergsson and the second author proved in [Annals of Math.~173 (2010), 1949--2033] that the distribution of gaps between…

We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…

Maximum a posteriori (MAP) estimation, like all Bayesian methods, depends on prior assumptions. These assumptions are often chosen to promote specific features in the recovered estimate. The form of the chosen prior determines the shape of…

We define the reflection of a random walk at a general barrier and derive, in case the increments are light tailed and have negative mean, a necessary and sufficient criterion for the global maximum of the reflected process to be finite…

The conjectured limit of last passage percolation is a scale-invariant, independent, stationary increment process with respect to metric composition. We prove this for Brownian last passage percolation. We construct the Airy sheet and…

We investigate the extremal process of four-dimensional membrane models as the size of the lattice $N$ tends to infinity. We prove the cluster-like geometry of the extreme points and the existence as well as the uniqueness of the extremal…

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…

We consider extremal processes and random walks generated by heavy-tailed random vectors taking values in $\mathbb{R}^d$ endowed with the $\ell_p$ metric. We establish limit theorems for the associated paths in the triangular array setting…