2003
DOI: 10.1137/s003614450342480
|View full text |Cite
|
Sign up to set email alerts
|

The Structure and Function of Complex Networks

Abstract: Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking pl… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

142
11,862
11
386

Year Published

2005
2005
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 15,605 publications
(12,687 citation statements)
references
References 381 publications
142
11,862
11
386
Order By: Relevance
“…L indicates the average number of steps required to go from a node to all others, taking the shortest route. In addition, the value of +Ý was assigned to the path length involving unconnected nodes and the harmonic mean was used to average the values obtained for path length across different nodes (Newman, 2003). For each participant, the average CC and L over all epochs and electrodes were calculated.…”
Section: Graph Theorymentioning
confidence: 99%
“…L indicates the average number of steps required to go from a node to all others, taking the shortest route. In addition, the value of +Ý was assigned to the path length involving unconnected nodes and the harmonic mean was used to average the values obtained for path length across different nodes (Newman, 2003). For each participant, the average CC and L over all epochs and electrodes were calculated.…”
Section: Graph Theorymentioning
confidence: 99%
“…The oldest and best-studied network model is the ErdosRenyi random graph [3], in which n nodes (or vertices) are connected by links (or edges) placed randomly between pairs of nodes. Less interesting is a uniform network, in which each node is linked to exactly m others.…”
Section: Kinds Of Networkmentioning
confidence: 99%
“…Two other interesting statistical properties of large networks are the network 'diameter' (d) and the 'clustering coefficient' (C) [3,[7][8][9]. The former is calculated by first finding the shortest path (smallest number of links) between each pair of nodes; d is then the maximum such shortest path (some biological authors take d to be the overall average shortest path).…”
Section: Kinds Of Networkmentioning
confidence: 99%
See 2 more Smart Citations