Abstract
Let G be a given graph (modelling a communication network) which we assume suffers from static edge faults: That is we let each edge of G be present independently with probability p (or absent with fault probability f = 1 - p). In particular we are interested in robustness results for the case that the graph G itself is a random member of the class of all regular graphs with given degree. Our result is: If the degree d is fixed then p = 1/(d - 1) is a threshold probability for the existence of a linear-sized component in a faulty version of almost all random regular graphs. We show: If each edge of an arbitrary graph G with maximum degree bounded above by d is present with, probability p = Λ/(d - 1) where Λ < 1 is fixed then the faulted version of G has only components whose size is at most logarithmic in the number of nodes with high probability. If on the other hand G is a random regular graph with degree d and p = Λ/(d - 1) where Λ > 1 then for almost all G the faulted version of G has a linear-sized component with high probability. Note that these results imply some kind of optimality of random regular graphs among the class of graphs with the same degree bound. The theme is: Use the known expansion properties of almost all random regular graphs to obtain strong robustness results. This has not been done systematically before.
Preview
Unable to display preview. Download preview PDF.
References
Noga Alon, Joel H. Spencer. The Probabilistic Method. Wiley, 1992.
M. Ajtai, J. Komlos, E. Szemeredi. The Longest Path in a Random Graph. Combinatorica, 1, 1981, 1–12.
M. Ajtai, J. Komlos, E. Szemeredi.Largest Random Component of a k-Cube. Combinatorica,2(1), 1982, 1–7.
Bela Bollobas. Random Graphs. Academic Press, 1985.
Bela Bollobas. The Isoperimetric Number of Random Regular Graphs. European Journal of Combinatorics. 9, 1988, 241–244.
A. Karlin, G. Nelson, H. Tamaki. On the Fault Tolerance of the Butterfly. In Proceedings STOC 1994, 125–133.
S. Nikoletseas, K. Palem, P. Spirakis, M. Yung. Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. In Proceedings ICALP 1994. 508–519.
S. Nikoletseas, P. Spirakis. Expander Properties in Random Regular Graphs with Edge Faults. In Proceedings STAGS 1995. 422–423.
H. Kesten. The Critical Probability of Bond Percolation on the Square Lattice Equals 1/2. Communication in Mathematical Physics. 74, 1980, 41–59.
T. R. Mathies. Percolation Theory and Computing with Faulty Arrays of Processors. In 3rd SODA 1992. 100–103.
P. Raghavan. Robust Algorithms for Packet Routing in a Mesh. In Proceedings 1st SPAA 1989. 344–350.
W. Feller. An Introduction to Probability Theory an its Applications, vol. 1. Wiley 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A. (1997). The giant component threshold for random regular graphs with edge faults. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029971
Download citation
DOI: https://doi.org/10.1007/BFb0029971
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive