Sciweavers

51 search results - page 7 / 11
» Embracing the Giant Component
Sort
View
WWW
2008
ACM
14 years 8 months ago
Statistical analysis of the social network and discussion threads in slashdot
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
Andreas Kaltenbrunner, Vicenç Gómez,...
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
14 years 1 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
14 years 26 days ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...
CP
2004
Springer
14 years 26 days ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore