Sciweavers

598 search results - page 4 / 120
» A random graph model for massive graphs
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 5 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
FOCS
2000
IEEE
14 years 3 months ago
Random graph models for the web graph
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...
IPPS
2009
IEEE
14 years 5 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 5 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
RSA
2010
98views more  RSA 2010»
13 years 9 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier