Regularity of the time constant for last passage percolation on complete directed acyclic graphs
Abstract
We study the time constant C() of last passage percolation on the complete directed acyclic graph on the set of non-negative integers, where edges have i.i.d. weights with distribution with support included in \-∞\. We show that C() is strictly increasing in . We also prove that C() is continuous in for a large set of measures . Furthermore, when is purely atomic, we show that C() is analytic with respect to the weights of the atoms. In the special case of two positive atoms, it is an explicit rational function of these weights.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.