Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks

Min Niu and Shuaishuai Song

Physica A: Statistical Mechanics and its Applications, 2018, vol. 506, issue C, 707-717

Abstract: In this paper, we mainly study two important properties of weighted Cayley networks depending on a weight factor r. The weight factor makes it more difficult to calculate the topological characteristics such as average weighted shortest path (AWSP) and average receiving time (ART) of the networks. We first calculate some basic network measurements such as average degree and average node strength. Then we derive the expression for AWSP and show that it stays bounded with network order growing (0Keywords: Weighted Cayley network; Average weighted shortest path; Average receiving time (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437118305156
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:506:y:2018:i:c:p:707-717

DOI: 10.1016/j.physa.2018.04.087

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().