Analysis of edge deletion processes on random regular graphs.

2002 Elsevier Science B.V. All rights reserved. journal homepage website http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.htmlRandom 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 of other edges with a given fault probability? We improve previous results on this problem in two respects: First, expansion properties are preserved for much higher fault probabilities than known before. Second, our results apply to random regular graphs of any degree which is at least 4. Previous results apply only to degrees of at least 42. Moreover, the techniques used by us are more elementary than those used in previous work in this area