17 search results - page 2 / 4 » Expansion properties of a random regular graph after random ... |
WAW
2007
Springer
13 years 11 months ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
FSEN
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...