Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
| Autor: | Min Niu, Shuaishuai Song |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Statistics and Probability
Discrete mathematics Degree (graph theory) Node (networking) Condensed Matter Physics Random walk 01 natural sciences 010305 fluids & plasmas Bounded function 0103 physical sciences Shortest path problem Order (group theory) Limit (mathematics) 010306 general physics Scaling Mathematics |
| Zdroj: | Physica A: Statistical Mechanics and its Applications. 506:707-717 |
| ISSN: | 0378-4371 |
| DOI: | 10.1016/j.physa.2018.04.087 |
| Popis: | 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 ( 0 r 1 ) in the limit of large network order. At last, we focus on random walks and trapping issue on the networks. That is, we calculate the ART. In more detail: for 0 r 1 2 , the ART grows with increasing size N t as ln N t ; for r = 1 2 , the ART grows with increasing size N t as ln 2 N t ; for 1 2 r 1 , the ART grows sublinearly with the network size N t ; for r = 1 , the ART grows linearly with the network size N t . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect