Optimal partition and effective dynamics of complex networks

DOI10.1073/pnas.0707563105zbMath1205.68031WikidataQ37452847 ScholiaQ37452847MaRDI QIDQ3075554

Eric Vanden-Eijnden, E. Weinan, Tie-Jun Li

Publication date: 15 February 2011

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.0707563105

zbMATH Keywords

partitioning; lumpability; k means; mncut

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

90B15: Stochastic network models in operations research

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

37N99: Applications of dynamical systems

Related Items

Finding Dominant Structures of Nonreversible Markov Processes, Modularity revisited: a novel dynamics-based concept for decomposing complex networks, Potential induced random teleportation on finite graphs, Remarks on network community properties, Detecting the fuzzy clusters of complex networks, Detecting community structure: from parsimony to weighted parsimony, Optimal Kullback–Leibler approximation of Markov chains via nuclear norm regularisation

Cites Work

• Unnamed Item
• Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
• Statistical mechanics of complex networks
• On the Approximation of Complicated Dynamical Behavior
• Optimal prediction and the Mori–Zwanzig representation of irreversible processes
• Community structure in social and biological networks
• Conditional Expectations and Renormalization
• On Stochastic Processes Defined by Differential Equations with a Small Parameter