Regularity of the time constant for last passage percolation on complete directed acyclic graphs - IPHT Access content directly
Preprints, Working Papers, ... Year : 2023

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 {−∞} ∪ R. 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.
Fichier principal
Vignette du fichier
Article_v4-27.pdf (550.91 Ko) Télécharger le fichier

Dates and versions

hal-04039839 , version 1 (21-03-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04039839 , version 1

Cite

Benjamin Terlat. Regularity of the time constant for last passage percolation on complete directed acyclic graphs. 2023. ⟨hal-04039839⟩
8 View
5 Download

Share

Gmail Facebook X LinkedIn More