Related papers: Disjoint optimizers and the directed landscape
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 apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are…
We develop a new probabilistic method for deriving deviation estimates in directed planar polymer and percolation models. The key estimates are for exit points of geodesics as they cross transversal down-right boundaries. These bounds are…
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root.…
For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…
This paper studies the large scale limits of multi-type invariant distributions and Busemann functions of planar stochastic growth models in the Kardar-Parisi-Zhang (KPZ) class. We identify a set of sufficient hypotheses for convergence of…
Directed assembly of block polymers is rapidly becoming a viable strategy for lithographic patterning of nanoscopic features. One of the key attributes of directed assembly is that an underlying chemical or topographic substrate pattern…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
The directed landscape, the central object in the Kardar-Parisi-Zhang universality class, is shown to be the scaling limit of various models by Dauvergne and Vir\'ag (2022) and Dauvergne, Ortmann and Vir\'ag (2018). In his study of…
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar graph. By planar duality this is equivalent to packing cuts…
We prove the upper-tail Large Deviation Principle (LDP) for the parabolic Airy process and characterize the limit shape of the directed landscape under the upper-tail conditioning. The LDP result answers Conjecture 10.1 in Das, Dauvergne,…
This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive…
This paper proves the convergence of the narrow wedge solutions of the KPZ equation to the Airy sheet and the directed landscape in the locally uniform topology. This is the first convergence result to the Airy sheet and the directed…
Optimal Transport has recently gained interest in machine learning for applications ranging from domain adaptation, sentence similarities to deep learning. Yet, its ability to capture frequently occurring structure beyond the "ground…
The $k$ disjoint shortest paths problem ($k$-DSPP) on a graph with $k$ source-sink pairs $(s_i, t_i)$ asks for the existence of $k$ pairwise edge- or vertex-disjoint shortest $s_i$-$t_i$-paths. It is known to be NP-complete if $k$ is part…
We design efficient deterministic algorithms for finding short edge-disjoint paths in expanders. Specifically, given an $n$-vertex $m$-edge expander $G$ of conductance $\phi$ and minimum degree $\delta$, and a set of pairs $\{(s_i,t_i)\}_i$…
The Airy wanderer line ensembles are infinite-parameter generalizations of the classical Airy line ensemble that arise naturally as scaling limits of inhomogeneous (spiked) models in the Kardar-Parisi-Zhang universality class. In this…
Many applications using large datasets require efficient methods for minimizing a proximable convex function subject to satisfying a set of linear constraints within a specified tolerance. For this task, we present a proximal projection…
Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…
Deep Neural Networks and Reinforcement Learning methods have empirically shown great promise in tackling challenging combinatorial problems. In those methods a deep neural network is used as a solution generator which is then trained by…