Results 1  10
of
302
SmallWorld Grid
, 2005
"... As the Grid matures the problem of resource discovery across communities, where resources now include computational services, is becoming more critical. The number of resources available on a worldwide grid is set to grow exponentially in much the same way as the number of static web pages on the ..."
Abstract
 Add to MetaCart
will not necessarily have the storage capacity to store the addresses of any significant percentage of the available resources. We discuss ways of modelling this problem in the regime of a slowly changing service base including phenomena such as percolating networks and smallworld network e↵ects.
Tight Lower Bounds for Greedy Routing in HigherDimensional SmallWorld Grids
, 2013
"... We consider Kleinberg’s celebrated small world graph model [12,13], in which a Ddimensional grid {0,..., n − 1}D is augmented with a constant number of additional unidirectional edges leaving each node. These long range edges are determined at random according to a probability distribution (the aug ..."
Abstract
 Add to MetaCart
We consider Kleinberg’s celebrated small world graph model [12,13], in which a Ddimensional grid {0,..., n − 1}D is augmented with a constant number of additional unidirectional edges leaving each node. These long range edges are determined at random according to a probability distribution (the
SmallWorld FileSharing Communities
, 2003
"... Web caches, content distribution networks, peertopeer file sharing networks, distributed file systems, and data grids all have in common that they involve a community of users who generate requests for shared data. In each case, overall system performance can be improved significantly if we can fi ..."
Abstract

Cited by 91 (10 self)
 Add to MetaCart
that captures common user interests in datathe datasharing graph and justify its utility with studies on three datadistribution systems: a highenergy physics collaboration, the Web, and the Kazaa peertopeer network. We find smallworld patterns in the datasharing graphs of all three communities. We
The Evolution of SmallWorld Networks
, 2007
"... Smallworld networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for smallworld 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
Smallworld networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for smallworld 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 SmallWorld Networks
, 2008
"... Smallworld networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for smallworld 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 8 (3 self)
 Add to MetaCart
Smallworld networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for smallworld networks, with one of the most fruitful, introduced by Jon Kleinberg [10], showing in which type of graphs it is possible to route
Analysis and Models for SmallWorld Graphs ∗
"... We study variants of Kleinberg’s smallworld model where we start with a kdimensional grid and add a random directed edge from each node. The probability u ′ s random edge is to v is proportional to d(u, v) −r where d(u, v) is the lattice distance and r is a parameter of the model. For a kdimensio ..."
Abstract
 Add to MetaCart
We study variants of Kleinberg’s smallworld model where we start with a kdimensional grid and add a random directed edge from each node. The probability u ′ s random edge is to v is proportional to d(u, v) −r where d(u, v) is the lattice distance and r is a parameter of the model. For a k
Deterministic smallworld communication networks ✩
, 2000
"... Many real life networks, including the World Wide Web, electric power grids, and social networks, are smallworld networks. The two distinguishing characteristics of smallworld networks are strong local clustering (nodes have many mutual neighbors), and small average distance between two nodes. Sma ..."
Abstract
 Add to MetaCart
Many real life networks, including the World Wide Web, electric power grids, and social networks, are smallworld networks. The two distinguishing characteristics of smallworld networks are strong local clustering (nodes have many mutual neighbors), and small average distance between two nodes
Analyzing Kleinberg’s (and other) smallworld models
 in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC
, 2004
"... We analyze the properties of SmallWorld networks, where links are much more likely to connect “neighbor nodes ” than distant nodes. In particular, our analysis provides new results for Kleinberg’s SmallWorld model and its extensions. Kleinberg adds a number of directed longrange random links to a ..."
Abstract

Cited by 70 (8 self)
 Add to MetaCart
We analyze the properties of SmallWorld networks, where links are much more likely to connect “neighbor nodes ” than distant nodes. In particular, our analysis provides new results for Kleinberg’s SmallWorld model and its extensions. Kleinberg adds a number of directed longrange random links
The Small World Inside Large Metabolic Networks
, 2000
"... We analyze the structuture of a large metabolic network, that of the energy and biosynthesis metabolism of Escherichia coli. This network is a paradigmatic case for the large genetic and metabolic networks that functional genomics efforts are beginning to elucidate. To analyze the structure of net ..."
Abstract

Cited by 218 (7 self)
 Add to MetaCart
. We find that this network is a small world graph, a type of graph observed in a variety of seemingly unrelated areas, such as friendship networks in sociology, the structure of electrical power grids, and the nervous system of C. elegans. Moreover, its connectivity follows a power law, another
Dynamics of geographical routing in smallworld networks
, 2007
"... Cover: Illustration of a continuous graph generated based on real world data from Statistics Sweden (SCB), 512 nodes. Purple edges showing base Delaunay graph, orange edges showing shortcuts selected through destination sampling. Göteborg, Sweden September 2007 2 A graph exhibits the smallworld phe ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Cover: Illustration of a continuous graph generated based on real world data from Statistics Sweden (SCB), 512 nodes. Purple edges showing base Delaunay graph, orange edges showing shortcuts selected through destination sampling. Göteborg, Sweden September 2007 2 A graph exhibits the smallworld
Results 1  10
of
302