Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,713,060
The Evolution of Small-World Networks
, 2007
"... Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [12], showing in which type of graphs it is possible to route, or ..."
Abstract
- Add to MetaCart
Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [12], showing in which type of graphs it is possible to route
The Evolution of Navigable Small-World Networks
, 2008
"... Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [10], showing in which type of graphs it is possible to route, or ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [10], showing in which type of graphs it is possible to route
Distributed Routing in Small-World Networks
, 2007
"... So called small-world networks – clustered networks with small diameters – are thought to be prevalent in nature, especially appearing in people’s social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between nodes ..."
Abstract
-
Cited by 27 (3 self)
- Add to MetaCart
So called small-world networks – clustered networks with small diameters – are thought to be prevalent in nature, especially appearing in people’s social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between
Determining the diameter of small world networks
- in Proc. of the 20th ACM International Conference on Information and Knowledge Management (CIKM
"... In this paper we present a novel approach to determine the exact diameter (longest shortest path length) of large graphs, in particular of the nowadays frequently studied small world networks. Typical examples include social networks, gene networks, web graphs and internet topology networks. Due to ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
In this paper we present a novel approach to determine the exact diameter (longest shortest path length) of large graphs, in particular of the nowadays frequently studied small world networks. Typical examples include social networks, gene networks, web graphs and internet topology networks. Due
Multiple Scales in Small-World Networks
- Brain and Cognitive Science Department, MIT
, 1999
"... Small-world architectures may be implicated in a range of phenomena from networks of neurons in the cerebral cortex to social networks and propogation of viruses [1]-[2]. Small-world networks are interpolations of regular and random networks that retain the advantages of both regular and random ..."
Abstract
- Add to MetaCart
Small-world architectures may be implicated in a range of phenomena from networks of neurons in the cerebral cortex to social networks and propogation of viruses [1]-[2]. Small-world networks are interpolations of regular and random networks that retain the advantages of both regular and random
Results 1 - 10
of
2,713,060
