2017
DOI: 10.1007/978-3-319-56829-4_7
|View full text |Cite
|
Sign up to set email alerts
|

Power in Network Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Also, Newman (2003) provides the profound overview of centrality measures in network graphs. The advanced versions of basic centrality measures for networks are proposed in Aleskerov et al (2017Aleskerov et al ( , 2018, Aleskerov and Shvydun (2018) and Meshcheryakova and Shvydun (2017). The above mentioned basic centrality measures in application for NodeXl software are well described in Hansen et al (2009).…”
Section: Methodological Issuesmentioning
confidence: 99%
“…Also, Newman (2003) provides the profound overview of centrality measures in network graphs. The advanced versions of basic centrality measures for networks are proposed in Aleskerov et al (2017Aleskerov et al ( , 2018, Aleskerov and Shvydun (2018) and Meshcheryakova and Shvydun (2017). The above mentioned basic centrality measures in application for NodeXl software are well described in Hansen et al (2009).…”
Section: Methodological Issuesmentioning
confidence: 99%
“… where and are the matrices of indirect influence of nodes from networks and . These matrices can be obtain using SRIC or LRIC modes which are discussed in Aleskerov, Meshcheryakova & Shvydun (2017) and Aleskerov, Shvydun & Meshcheryakova (2021) . A distinctive feature of these models is that they identify significant edges while insignificant edges are not taken into account.…”
Section: Graph Distance Measuresmentioning
confidence: 99%