Sciweavers

43 search results - page 4 / 9
» Random graphs with forbidden vertex degrees
Sort
View
COCOA
2008
Springer
15 years 1 months ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
RSA
2011
126views more  RSA 2011»
14 years 6 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
14 years 10 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
MICS
2010
134views more  MICS 2010»
14 years 10 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CORR
2010
Springer
185views Education» more  CORR 2010»
14 years 12 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
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...
Bruno F. Ribeiro, Donald F. Towsley