Sciweavers

865 search results - page 6 / 173
» Random graph models for the web graph
Sort
View
CIKM
2008
Springer
14 years 11 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
14 years 9 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
78
Voted
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
80
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
APVIS
2006
14 years 11 months ago
Method for drawing intersecting clustered graphs and its application to web ontology language
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Hiroki Omote, Kozo Sugiyama