Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
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.
KeywordsRandom Graph Fault Tolerance Linear Size Local Algorithm Fault Probability
Unable to display preview. Download preview PDF.
- 3.Cole, R., Maggs, B., Sitaraman, R.: Routing on Butterfly networks with random faults. In: Proceedings FoCS 1995, pp. 558–570. IEEE, Los Alamitos (1995)Google Scholar
- 7.Molloy, M., Pittel, B.: Subgraphs with average degree 3 in a random graph (in preparation) Google Scholar
- 8.Molloy, M., Wormald, N.: (in preparation) Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar