2008
DOI: 10.1038/nphys1130
|View full text |Cite
|
Sign up to set email alerts
|

Navigability of complex networks

Abstract: Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However, in many real networks nodes communicate efficiently even without such global intelligence. Here we show that the peculiar structural characteristics of many complex networks support efficient communication without global knowledge. We also describ… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

7
274
0
4

Year Published

2010
2010
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 392 publications
(294 citation statements)
references
References 34 publications
7
274
0
4
Order By: Relevance
“…The model, called the matching-centrality model, is implemented in such a way that the closer the matching traits of two nodes, the greater the probability that they are linked, and the higher the centrality trait of a node, the greater the probability that this node makes links. This model belongs to the general class of 'hidden' variables models [5,[19][20][21][22][23][24], for which some variables are unknown a priori, but can be estimated from the data a posteriori. In our model, these 'hidden' variables are the latent traits of matching and centrality.…”
Section: Introductionmentioning
confidence: 99%
“…The model, called the matching-centrality model, is implemented in such a way that the closer the matching traits of two nodes, the greater the probability that they are linked, and the higher the centrality trait of a node, the greater the probability that this node makes links. This model belongs to the general class of 'hidden' variables models [5,[19][20][21][22][23][24], for which some variables are unknown a priori, but can be estimated from the data a posteriori. In our model, these 'hidden' variables are the latent traits of matching and centrality.…”
Section: Introductionmentioning
confidence: 99%
“…Yet, the engineering of artificial networks with well-controlled features seems desirable. Indeed, there has been considerable interest in the properties of spatial networks, linking real-world geometry with small-world effects [3][4][5] . In particular, networks possessing hierarchical features 4,[6][7][8][9][10] relate to actual transport systems such as for air travel, routers and social interactions.…”
mentioning
confidence: 99%
“…Indeed, there has been considerable interest in the properties of spatial networks, linking real-world geometry with small-world effects [3][4][5] . In particular, networks possessing hierarchical features 4,[6][7][8][9][10] relate to actual transport systems such as for air travel, routers and social interactions. Certain hierarchical networks, with a self-similar structure, have been shown to exhibit novel features 8,[11][12][13][14][15] .…”
mentioning
confidence: 99%
“…Epidemic spreading [1,2,3,4,5,6,7,8,9,10,11,12] and traffic dynamics [13,14,15,16,17,18,19,20] on complex networks have attracted much attention in the past decade. For a long time, the two types of dynamical processes have been studied independently.…”
mentioning
confidence: 99%