2079 search results - page 60 / 416 » Universality of random graphs |
111
click to vote
IM
2007
15 years 4 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
148
click to vote
RSA
2008
15 years 3 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
130
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
145
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
158
click to vote
RSA
2008
15 years 3 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...