1949 search results - page 55 / 390 » Random graphs on surfaces |
RSA
2010
14 years 10 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
AAAI
2008
15 years 2 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
15 years 1 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
14 years 9 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R