Sciweavers

50 search results - page 1 / 10
» The Diameter of a Scale-Free Random Graph
Sort
View
26
Voted
COMBINATORICA
2004
88views more  COMBINATORICA 2004»
13 years 11 months ago
The Diameter of a Scale-Free Random Graph
Béla Bollobás, Oliver Riordan
MICS
2010
134views more  MICS 2010»
13 years 9 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
SIAMDM
2010
111views more  SIAMDM 2010»
13 years 5 months ago
Random Walks with Look-Ahead in Scale-Free Random Graphs
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
Colin Cooper, Alan M. Frieze
CPC
2007
125views more  CPC 2007»
13 years 11 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
OPODIS
2004
14 years 11 days ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...