Related papers: One-point large deviations of the directed landsca…
A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in…
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…
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…
When the value $L$ of the directed landscape at a point $(\mathbf{p};\mathbf{q})$ is sufficiently large, the geodesic from $\mathbf{p}$ to $\mathbf{q}$ is rigid and its location fluctuates of order $L^{-1/4}$ around its expectation. We…
A basic question about the directed landscape is how much of it can be reconstructed simply by knowing the shapes of its geodesics. We prove that the directed landscape can be reconstructed from the shapes of its semi-infinite geodesics. In…
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…
We study maximal length collections of disjoint paths, or 'disjoint optimizers', in the directed landscape. We show that disjoint optimizers always exist, and that their lengths can be used to construct an extended directed landscape. The…
We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…
In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…
We investigate first-passage percolation on the lattice $\Z^d$ for dimensions $d \geq 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\tau$. We only assume $\P[\tau=0]0$ is explicit) for the…
The study of transversal fluctuations of the optimal path is a crucial aspect of the Kardar-Parisi-Zhang (KPZ) universality class. In this work, we establish the large deviation limit for the midpoint transversal fluctuations in a general…
The Sharpened Distance Conjecture and Tower Scalar Weak Gravity Conjecture are closely related but distinct conjectures, neither one implying the other. Motivated by examples, I propose that both are consequences of two new conjectures: 1.…
The term 'KPZ' stands for the initials of three physicists, namely Kardar, Parisi and Zhang, which, in 1986 conjectured the existence of universal scaling behaviours for many random growth processes in the plane. A process is said to belong…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
We study the path of light rays passing near a massive object, in the context of the scale invariant equation of the geodesics first obtained by Dirac (1973). Using the exterior Schwarzschild solution for the metric, we derive the complete…
In first-passage percolation, we place i.i.d. continuous weights at the edges of Z^2 and consider the weighted graph metric. A distance-minimizing path between points x and y is called a geodesic, and a bigeodesic is a doubly-infinite path…
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…
Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…
In first-passage percolation, one places nonnegative i.i.d. random variables (T(e)) on the edges of Z^d. A geodesic is an optimal path for the passage times T(e). Consider a local property of the time environment. We call it a pattern. We…
We introduce an ensemble of spatial networks built from the junctions of hindered-rotation chains, incorporating directional correlations between bonds, an aspect ignored in the standard network modeling paradigm. The emergent random…