HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

On the Robustness of Interconnections in Random Graphs: A Symbolic Approach

Abstract : Graphs are models of communication networks. This paper applies symbolic combinatorial techniques in order to characterize the interplay between two parameters of a random graph, namely its density (the number of edges in the graph) and its robustness to link failures. Here, robustness means multiple connectivity by short disjoint paths. We determine the expected number of ways to get from a source to a destination via two edge-disjoint paths of length $\ell$ in the classical random graph model $\G_n,p$. We then derive bounds on related threshold probabilities.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:18:13 AM
Last modification on : Thursday, February 3, 2022 - 11:14:07 AM
Long-term archiving on: : Tuesday, February 22, 2011 - 12:06:19 PM


  • HAL Id : inria-00072567, version 1



Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, Paul Spirakis. On the Robustness of Interconnections in Random Graphs: A Symbolic Approach. [Research Report] RR-4069, INRIA. 2000. ⟨inria-00072567⟩



Record views


Files downloads