5606 search results - page 71 / 1122 » Randomization Techniques for Graphs. |
AAAI
2008
13 years 11 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
CPC
2010
13 years 6 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
RSA
2006
13 years 9 months ago
2006
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...