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

K. Malarz, K. Kulakowski

In a graph, nodes can be characterized 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…