1542 search results - page 124 / 309 » The metamathematics of random graphs |
122
click to vote
JITECH
2010
15 years 10 days ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
92
Voted
TIT
2010
14 years 8 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
116
click to vote
SODA
2008
ACM
15 years 3 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...
143
click to vote
SASN
2004
ACM
15 years 7 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...
140
click to vote
CCR
2004
15 years 1 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 ...