1591 search results - page 44 / 319 » Random lifts of graphs |
154
click to vote
ALGORITHMICA
2007
15 years 5 months ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
147
click to vote
RSA
2010
15 years 3 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...
150
click to vote
FOCS
2008
IEEE
15 years 12 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...
160
click to vote
AAAI
2008
15 years 7 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...
145
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n