Sciweavers

865 search results - page 2 / 173
» Random graph models for the web graph
Sort
View
JCT
2007
108views more  JCT 2007»
13 years 4 months ago
The cover time of the preferential attachment graph
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
Colin Cooper, Alan M. Frieze
DM
2011
264views Education» more  DM 2011»
13 years 14 hour ago
Connectivity threshold and recovery time in rank-based models for complex networks
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
PODS
2006
ACM
127views Database» more  PODS 2006»
14 years 5 months ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
13 years 11 months ago
A Geometric Preferential Attachment Model of Networks II
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...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
IM
2007
13 years 5 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen