2015
DOI: 10.1371/journal.pone.0121946
|View full text |Cite
|
Sign up to set email alerts
|

Non-Homogeneous Fractal Hierarchical Weighted Networks

Abstract: A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r 1, r 2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…Owing to the important roles of Sierpinski fractals in several applications like weighted networks, trapping problems, antenna engineering, city planning, and urban growth [135,136,137,138,139], we expect that the results will be helpful in further fields of applications. One of the relevant applications involves optimization theory.…”
Section: Discussionmentioning
confidence: 99%
“…Owing to the important roles of Sierpinski fractals in several applications like weighted networks, trapping problems, antenna engineering, city planning, and urban growth [135,136,137,138,139], we expect that the results will be helpful in further fields of applications. One of the relevant applications involves optimization theory.…”
Section: Discussionmentioning
confidence: 99%
“…Each node of B (1) 1 , B (2) 1 , B (3) 1 links the attaching node A 1 , i.e. A 0 in G 0 , with unitary weight.…”
Section: The Weighted Cayley Networkmentioning
confidence: 99%
“…For convenience, the central node A n−1 in G n−1 is labeled A n in G n . The three nodes B (1) n−1 , B (2) n−1 , B (3) n−1 in G n−1 are labeled as B (1) n , B (2) n , B (3) n in G n , sequentially. The weighted Cayley networks are set up.…”
Section: The Weighted Cayley Networkmentioning
confidence: 99%
See 2 more Smart Citations