Sciweavers

WAW
2009
Springer
77views Algorithms» more  WAW 2009»
14 years 4 months ago
Choose the Damping, Choose the Ranking?
Marco Bressan 0002, Enoch Peserico
WAW
2009
Springer
115views Algorithms» more  WAW 2009»
14 years 4 months ago
Web Page Rank Prediction with PCA and EM Clustering
Polyxeni Zacharouli, Michalis Titsias, Michalis Va...
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 6 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
WAW
2009
Springer
129views Algorithms» more  WAW 2009»
14 years 6 months ago
Approximating the Number of Network Motifs
Mira Gonen, Yuval Shavitt
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 6 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
WAW
2009
Springer
187views Algorithms» more  WAW 2009»
14 years 6 months ago
Cluster Based Personalized Search
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [19], we develop and imple...
Hyun Chul Lee, Allan Borodin
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
14 years 6 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 6 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang