1542 search results - page 69 / 309 » The metamathematics of random graphs |
ALGORITHMICA
2007
14 years 10 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 ...
FOCS
2008
IEEE
15 years 4 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 5 days 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
14 years 11 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
RSA
2006
14 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...