Dependence of the average to-node distance on the node degree for random graphs and growing networks
| dc.creator | Malarz, K. | |
| dc.creator | Kulakowski, K. | |
| dc.date | 2004-02-18 | |
| dc.date | 2004-08-30 | |
| dc.date.accessioned | 2026-07-07T02:56:33Z | |
| dc.date.available | 2026-07-07T02:56:33Z | |
| dc.description | In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $ξ$ to other nodes). Here we investigate how $ξ$ depends on $k$. Our earlier algorithm of the construction of the distance matrix is applied to the random graphs. Numerical calculations are performed for the random graphs and the growing networks: the scale-free ones and the exponential ones. The results are relevant for search strategies in different networks. | |
| dc.description | 7 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0402474 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0402474 | |
| dc.identifier | Eur. Phys. J. B41 (2004) 333 | |
| dc.identifier | doi:10.1140/epjb/e2004-00326-3 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/23363 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Dependence of the average to-node distance on the node degree for random graphs and growing networks | |
| dc.type | text |