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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072567
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:18:13 AM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, February 22, 2011 - 12:06:19 PM

Identifiers

  • HAL Id : inria-00072567, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

131

Files downloads

282