Sciweavers

10 search results - page 2 / 2
» waw 2009
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 2 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
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 2 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
150views Algorithms» more  WAW 2009»
14 years 2 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
147views Algorithms» more  WAW 2009»
14 years 2 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...
CGO
2009
IEEE
13 years 11 months ago
Alchemist: A Transparent Dependence Distance Profiling Infrastructure
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan