Expander Properties in Random Regular Graphs with Edge Faults
Lists
Only you see this
Abstract
Let H be an undirected graph. A random graph of type-H is obtained by selecting edges of H independently and with probability p. We can thus represent a communication network H in which the links fail independently and with probability f=1−p. A fundamental type of H is the clique of n nodes (leading to the well-known random graph G n,p ). Another fundamental type of H is a random member of the set G d n of all regular graphs of degree d (leading to a new type of random graphs, of the class G d n,p ). Note that G n,p =G n−1 n,p . The G d n,p model was introduced in ([11]).
BibTeX
@inproceedings{nikoletseas1995expander,
author = {Sotiris E. Nikoletseas and Paul G. Spirakis},
title = {{Expander Properties in Random Regular Graphs with Edge Faults}},
booktitle = {STACS},
year = {1995},
doi = {10.1007/3-540-59042-0\_93},
}Loading related content...