Optimal partition and effective dynamics of complex networks

DOI10.1073/PNAS.0707563105MaRDI QIDQ3075554zbMATH OpenOpenAlexWikidataFDO

Authors Eric Vanden-Eijnden, Weinan E, Tiejun 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

lumpabilitypartitioningk meansmncut

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stochastic network models in operations research (90B15) Network design and communication in computer systems (68M10) Applications of dynamical systems (37N99)

Recommendations

• Detecting the fuzzy clusters of complex networks
• The optimal partitioning of networks
• Partitions of networks that are robust to vertex permutation dynamics
• Optimal Fuzzy Aggregation of Networks
• A linear community detection algorithm based on dynamical system in networks

Cites work

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

Cited in

(16)

• Detecting the fuzzy clusters of complex networks
• Data-driven efficient solvers for Langevin dynamics on manifold in high dimensions
• Detecting community structure: from parsimony to weighted parsimony
• Theoretical aspects of equitable partition of networks into sparse modules
• Optimal Kullback-Leibler approximation of Markov chains via nuclear norm regularisation
• Remarks on network community properties
• Modularity revisited: a novel dynamics-based concept for decomposing complex networks
• Minimal partition coverings and generalized dimensions of a complex network
• Potential induced random teleportation on finite graphs
• Adaptive low-nonnegative-rank approximation for state aggregation of Markov chains
• The optimal partitioning of networks
• Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
• Formal lumping of polynomial differential equations through approximate equivalences
• Finding dominant structures of nonreversible Markov processes
• Stability, bifurcation and phase-locking of time-delayed excitatory-inhibitory neural networks
• On the mathematics of RNA velocity. I: Theoretical analysis

This page was built for publication: Optimal partition and effective dynamics of complex networks

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