Exponential generalised network descriptors

DOI10.3934/AMC.2019026MaRDI QIDQ2311607zbMATH OpenOpenAlexFDO

Authors Suzana Antunović, Tonči Kokan, Tanja Vojković, Damir Vukičević

Publication date 4 July 2019

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.01245

zbMATH Keywords

centralitynetwork surplusnetworknesstransmission

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18)

Abstract: In communication networks theory the concepts of networkness and network surplus have recently been defined. Together with transmission and betweenness centrality, they were based on the assumption of equal communication between vertices. Generalised versions of these four descriptors were presented, taking into account that communication between vertices $u$ and $v$ is decreasing as the distance between them is increasing. Therefore, we weight the quantity of communication by $lambd{a}^{d(u,v)}$ where $lambdainleftlangle0,1ightangle$. Extremal values of these descriptors are analysed.

Recommendations

• Generalised network descriptors
• One-alpha weighted network descriptors
• Network descriptors based on betweenness centrality and transmission and their extremal values
• Communication in complex networks
• Measuring centrality by a generalization of degree

Cited in

(3)

• Generalised network descriptors
• One-alpha weighted network descriptors
• Tucker network: expressive power and comparison

This page was built for publication: Exponential generalised network descriptors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311607)