New transience bounds for long walks in weighted digraphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

New transience bounds for long walks in weighted digraphs

Résumé

We consider the sequence of maximal weights of walks of lengt n between two fixed nodes in a weighted digraph. It is known that these sequences show a periodic behavior after an initial transient. We identify relevant graph parameters and propose a modular strategy to derive new upper bounds on the transient. To the best of our knowledge, our bounds are the first that are both asymptotically tight and potentially subquadratic. In particular, the new bounds show that the transient is linear in the number of nodes in bi-directional trees. Besides, our results enable a fine-grained performance analysis and give guidelines for the design of distributed systems based on max-plus recursions.
Fichier principal
Vignette du fichier
paper.pdf (32.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00993814 , version 1 (21-05-2014)

Identifiants

Citer

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak. New transience bounds for long walks in weighted digraphs. Eurocomb 2013, Sep 2013, Pise, Italy. pp.623-624, ⟨10.1007/978-88-7642-475-5_103⟩. ⟨hal-00993814⟩
537 Consultations
137 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More