Abstract
Random regular graphs are, at least theoretically, popular communication networks. The reason for this is that they combine low (that is constant) degree with good expansion properties crucial for efficient communication and load balancing. When any kind of communication network gets large one is faced with the question of fault tolerance of this network. Here we consider the question: Are the expansion properties of random regular graphs preserved when each edge gets faulty independently with a given fault probability? We improve previous results on this problem: Expansion properties are shown to be preserved for much higher fault probabilities and lower degrees than was known before. Our proofs are much simpler than related proofs in this area.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bollobas, B.: Random Graphs. Academic Press, London (1985)
Bollobas, B.: The isoperimetric number of random regular graphs. European Journal of Combinatorics 9, 241–244 (1988)
Cole, R., Maggs, B., Sitaraman, R.: Routing on Butterfly networks with random faults. In: Proceedings FoCS 1995, pp. 558–570. IEEE, Los Alamitos (1995)
Goerdt, A.: The giant component threshold for random regular graphs with edge faults. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 279–288. Springer, Heidelberg (1997)
Goerdt, A.: Random regular graphs with edge faults: expansion through cores. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 219–228. Springer, Heidelberg (1998)
Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. Journal of Combinatorial Theory B 67, 111–151 (1996)
Molloy, M., Pittel, B.: Subgraphs with average degree 3 in a random graph (in preparation)
Molloy, M., Wormald, N.: (in preparation)
Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Vertex disjoint paths and multconnectivity in random graphs: Secure network computing. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 508–519. Springer, Heidelberg (1994)
Spirakis, P., Nikoletseas, S.: Expansion properties of random regular graphs with edge faults. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 421–432. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A., Molloy, M. (2000). Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_4
Download citation
DOI: https://doi.org/10.1007/10719839_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive