1949 search results - page 140 / 390 » Random graphs on surfaces |
138
click to vote
RSA
2010
15 years 2 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
137
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
168
click to vote
SASN
2004
ACM
15 years 10 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
164
click to vote
CCR
2004
15 years 4 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
129
click to vote
CPC
2002
15 years 4 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...