Dependence of the average to-node distance on the node degree for random graphs and growing networks

K. Malarz () and K. Kułakowski

The European Physical Journal B: Condensed Matter and Complex Systems, 2004, vol. 41, issue 3, 333-336

Abstract: In a connected graph, nodes can be characterised locally (with their degree k) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on k. The numerical algorithm based on the construction of the distance matrix is applied to random graphs and the growing networks: the scale-free ones and the exponential ones. The results are relevant for search strategies in different networks. Copyright Springer-Verlag Berlin/Heidelberg 2004

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1140/epjb/e2004-00326-3 (text/html)
Access to full text is restricted to subscribers.

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:spr:eurphb:v:41:y:2004:i:3:p:333-336

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10051

DOI: 10.1140/epjb/e2004-00326-3

Access Statistics for this article

The European Physical Journal B: Condensed Matter and Complex Systems is currently edited by P. Hänggi and Angel Rubio

More articles in The European Physical Journal B: Condensed Matter and Complex Systems from Springer, EDP Sciences
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().