Random walks in directed modular networks

DOI10.1088/1742-5468/2014/12/P12003MaRDI QIDQ3301827zbMATH OpenOpenAlexFDO

Authors

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.4047

Mathematics Subject Classification ID

Random walks on graphs (05C81) Diffusion processes (60J60) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: Because diffusion typically involves symmetric interactions, scant attention has been focused on studying asymmetric cases. However, important networked systems underlain by diffusion (e.g. cortical networks and WWW) are inherently directed. In the case of undirected diffusion, it can be shown that the steady-state probability of the random walk dynamics is fully correlated with the degree, which no longer holds for directed networks. We investigate the relationship between such probability and the inward node degree, which we call efficiency, in modular networks. Our findings show that the efficiency of a given community depends mostly on the balance between its ingoing and outgoing connections. In addition, we derive analytical expressions to show that the internal degree of the nodes do not play a crucial role in their efficiency, when considering the ErdH{o}s-R'enyi and Barab'asi-Albert models. The results are illustrated with respect to the macaque cortical network, providing subsidies for improving transportation and communication systems.

Recommendations

• Random walks on complex modular networks
• Random walks and diffusion on networks
• Efficiency dynamics on scale-free networks with communities
• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
• Influence of weight heterogeneity on random walks in scale-free networks

Cites work

• Complex networks: structure and dynamics
• Dynamical Processes on Complex Networks
• Emergence of Scaling in Random Networks
• Networks. An introduction.
• On Local Estimations of PageRank: A Mean Field Approach

Cited in

(7)

• MFPT calculation for random walks in inhomogeneous networks
• Biased random walks on Kleinberg's spatial networks
• Modeling random walkers on growing random networks
• Random walks on generalized Loch networks
• Random walks on complex modular networks
• scientific article; zbMATH DE number 5722222 (Why is no real title available?)
• Analysis of node2vec random walks on networks

This page was built for publication: Random walks in directed modular networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301827)