170 search results - page 6 / 34 » k-Wise Independent Random Graphs |
RSA
2011
13 years 2 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
CPC
2006
13 years 7 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
COMBINATORICS
2006
13 years 7 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...