English
Related papers

Related papers: Disjoint optimizers and the directed landscape

200 papers

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…

Probability · Mathematics 2024-04-24 Duncan Dauvergne , Janosch Ortmann , Balint Virag

Consider the restriction of the directed landscape $\mathcal L(x, s; y, t)$ to a set of the form $\{x_1, \dots, x_k\} \times \{s_0\} \times \mathbb R \times \{t_0\}$. We show that on any such set, the directed landscape is given by a last…

Probability · Mathematics 2021-10-29 Duncan Dauvergne

We provide a framework for proving convergence to the directed landscape, the central object in the Kardar-Parisi-Zhang universality class. For last passage models, we show that compact convergence to the Airy line ensemble implies…

Probability · Mathematics 2022-10-13 Duncan Dauvergne , Bálint Virág

We construct an almost sure bijection that recovers the directed landscape on the half-plane from a sequence of independent Brownian motions. This map is the natural scaling limit of the Robinson--Schensted--Knuth (RSK) correspondence. The…

Probability · Mathematics 2026-05-18 Duncan Dauvergne , Bálint Virág

The directed landscape is a random directed metric on the plane that arises as the scaling limit of metric models in the KPZ universality class. For a pair of points p, q, the disjointness gap G(p; q) measures the shortfall when we optimize…

Probability · Mathematics 2026-02-11 Duncan Dauvergne , Oliver Scott Pankratz

Within the Kardar-Parisi-Zhang universality class, the space-time Airy sheet is conjectured to be the canonical scaling limit for last passage percolation models. In recent work arXiv:1812.00309 of Dauvergne, Ortmann, and Vir\'ag, this…

Probability · Mathematics 2021-08-26 Erik Bates , Shirshendu Ganguly , Alan Hammond

Study of the KPZ universality class has seen the emergence of universal objects over the past decade which arise as the scaling limit of the member models. One such object is the directed landscape, and it is known that exactly solvable…

Probability · Mathematics 2025-11-03 Pranay Agarwal

We show that the directed landscape is the unique coupling of the KPZ fixed point from all initial conditions satisfying three natural properties: independent increments, monotonicity, and shift commutativity. Equivalently, we show that the…

Probability · Mathematics 2025-08-12 Duncan Dauvergne , Lingfu Zhang

The directed landscape is a random directed metric on the plane that arises as the scaling limit of classical metric models in the KPZ universality class. Typical pairs of points in the directed landscape are connected by a unique geodesic.…

Probability · Mathematics 2023-06-23 Duncan Dauvergne

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…

Probability · Mathematics 2026-05-11 Duncan Dauvergne , Lingfu Zhang

It is believed that for metric-like models in the KPZ class the following property holds: with probability one, starting from any point, there are at most two semi-infinite geodesics with the same direction that do not coalesce. Until now,…

Probability · Mathematics 2024-01-31 Ofer Busani

We define the log-gamma sheet and the log-gamma landscape in terms of the 2-parameter and 4-parameter free energy of the log-gamma polymer model and prove that they converge to the Airy sheet and the directed landscape, which are central…

Probability · Mathematics 2025-10-24 Xinyi Zhang

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…

Probability · Mathematics 2024-04-03 Manan Bhatia

We consider the limiting fluctuations of the geodesic in the directed landscape, conditioning on its length going to infinity. It was shown in \cite{Liu22b,Ganguly-Hegde-Zhang23} that when the directed landscape $\mathcal{L}(0,0;0,1) = L$…

Probability · Mathematics 2026-03-26 Zhipeng Liu , Chen Ma , Tejaswi Tripathi

We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong $d$-regular expander graph $G$ with $n$ vertices. In particular, we describe a deterministic, polynomial time algorithm which…

Data Structures and Algorithms · Computer Science 2023-10-23 Nemanja Draganić , Rajko Nenadov

Traditional landscape analysis of deep neural networks aims to show that no sub-optimal local minima exist in some appropriate sense. From this, one may be tempted to conclude that descent algorithms which escape saddle points will reach a…

Machine Learning · Computer Science 2020-01-01 Shiyu Liang , Ruoyu Sun , R. Srikant

Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…

Combinatorics · Mathematics 2017-11-03 Joshua Erde

We show that the directed landscape is a black noise in the sense of Tsirelson and Vershik. As a corollary, we show that for any microscopic system in which the height profile converges in law to the directed landscape, the driving noise is…

Probability · Mathematics 2025-04-08 Zoe Himwich , Shalin Parekh

In this note, we prove convergence of the half-space exponential last passage percolation (LPP) model, away from the boundary, to the directed landscape. Our approach couples the half-space and full-space LPP models and constructs two…

Probability · Mathematics 2026-02-23 Xinyi Zhang

Since 1997 there has been a steady stream of advances for the maximum disjoint paths problem. Achieving tractable results has usually required focusing on relaxations such as: (i) to allow some bounded edge congestion in solutions, (ii) to…

Data Structures and Algorithms · Computer Science 2021-01-05 Guyslain Naves , Bruce Shepherd , Henry Xia
‹ Prev 1 2 3 10 Next ›