Skip to main content
SpringerLink
Log in

Analysis of Edge Deletion Processes on Faulty Random Regular Graphs

  • Conference paper
  • First Online:
LATIN 2000: Theoretical Informatics (LATIN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollobas, B.: Random Graphs. Academic Press, London (1985)

    MATH  Google Scholar 

  2. Bollobas, B.: The isoperimetric number of random regular graphs. European Journal of Combinatorics 9, 241–244 (1988)

    Article  MathSciNet  Google Scholar 

  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 

  4. 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)

    Chapter  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Article  MathSciNet  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)

    Chapter  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, TU Chemnitz, 09111, Chemnitz, Germany

    Andreas Goerdt

  2. Department of Computer Science, University of Toronto, Toronto, Canada

    Mike Molloy

Authors
  1. Andreas Goerdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mike Molloy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation