test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works

Advanced Search
& Collections
Issue Date   
Sign on to:   
Receive email
My Account
authorized users
Edit Profile   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9481

Title: Analysis of edge deletion processes on random regular graphs.
Authors: Goerdt, A.
Molloy, M.
Keywords: analysis of edge deletion process
random regular graphs
Issue Date: 2000
Citation: Goerdt, A., Molloy, M. Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47
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.
Description: The original publication is available at http://www.springerlink.com/book-series/?sortorder=asc © Springer-Verlag
URI: http://hdl.handle.net/1807/9481
ISSN: 0302-9743
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
print version analysis of edge deletion process....pdf182.79 kBAdobe PDF
print version analysis of edge deletion process....pdf.txt24.47 kBText

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.