2007
DOI: 10.1016/j.physa.2006.12.022
|View full text |Cite
|
Sign up to set email alerts
|

Weighted assortative and disassortative networks model

Abstract: Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by topological growth as well as by weight change. In addition, we introduce the weighted assortativity coefficient, which generalizes the assortativity coefficient of a topological network, to measure the tendency of having a high-weighted link between two vertices of similar d… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
79
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 107 publications
(79 citation statements)
references
References 29 publications
0
79
0
Order By: Relevance
“…For topological analysis of the UW ud London metro network, we examine whether the network exhibits a small-world effect. Watts and Strogatz introduced the concept of small-world effect in networks, characterized by a small characteristic path length (CPL)-the average shortest path length for the network, and a high clustering coefficient (CC) [50]-a measure of clustering in the network [51]. For this reason, nodes in a small-world network are not connected directly to each other but most nodes can be reached indirectly from all other nodes by a small number of steps [52].…”
Section: Topological Analyses Of the London Metro Networkmentioning
confidence: 99%
“…For topological analysis of the UW ud London metro network, we examine whether the network exhibits a small-world effect. Watts and Strogatz introduced the concept of small-world effect in networks, characterized by a small characteristic path length (CPL)-the average shortest path length for the network, and a high clustering coefficient (CC) [50]-a measure of clustering in the network [51]. For this reason, nodes in a small-world network are not connected directly to each other but most nodes can be reached indirectly from all other nodes by a small number of steps [52].…”
Section: Topological Analyses Of the London Metro Networkmentioning
confidence: 99%
“…Weighted Assortativity Coefficient: The weighted assortativity coefficient R W suggested by Leung et al [25] is given by :…”
Section: Network Measuresmentioning
confidence: 99%
“…The assortativity property of networks measures the preference of network nodes to attach to other nodes that are similar in terms of degree or strength where the latter is applicable for weighted networks Newman (2002), Leung and Chau (2007), Xie et al (2007). As the models proposed in this work generate weighted networks, we use the average nearest neighbor strength measure for this purpose.…”
Section: Network Assortativitymentioning
confidence: 99%