Sciweavers

92 search results - page 11 / 19
» Drawing Power Law Graphs
Sort
View
SAC
2006
ACM
14 years 1 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 1 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
PODS
2006
ACM
127views Database» more  PODS 2006»
14 years 7 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
157views Algorithms» more  WAW 2007»
14 years 1 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002