Adapting infomap to absorbing random walks using absorption-scaled graphs

DOI10.1137/21M1466803MaRDI QIDQ6629680FDOQ6629680

Authors: Esteban Vargas Bernal, Mason A. Porter, Joseph H. Tien 

Publication date: 30 October 2024

Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

Recommendations

• SIR dynamics in random networks with communities
• Flow-Based Community Detection in Hypergraphs
• Computing Communities in Large Networks Using Random Walks
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Fast unfolding of communities in large networks

zbMATH Keywords

mathematical epidemiologycommunity structureabsorbing random walksinfomap

Mathematics Subject Classification ID

Epidemiology (92D30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)

Cites Work

• A Mathematical Theory of Communication
• Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission
• Models of the small world.
• Communities in Networks
• Mathematics of epidemics on networks. From exact to approximate models
• Random walks and diffusion on networks
• Networks
• A generalized inverse for graphs with absorption
• Mathematical models in epidemiology
• Mapping higher-order network flows in memory and multilayer networks with Infomap

This page was built for publication: Adapting infomap to absorbing random walks using absorption-scaled graphs

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