Sciweavers

865 search results - page 34 / 173
» Random graph models for the web graph
Sort
View
WAW
2007
Springer
85views Algorithms» more  WAW 2007»
14 years 2 months ago
A Spatial Web Graph Model with Local Influence Regions
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
William Aiello, Anthony Bonato, C. Cooper, Jeannet...
COCOON
1999
Springer
14 years 24 days ago
The Web as a Graph: Measurements, Models, and Methods
Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, ...
ICS
2010
Tsinghua U.
14 years 5 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
PERCOM
2005
ACM
14 years 8 months ago
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
Sven Bittner, Wolf-Ulrich Raffel, Manuel Scholz
CAAN
2004
Springer
14 years 1 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy