Optimal partition and effective dynamics of complex networks

DOI10.1073/PNAS.0707563105zbMATH Open1205.68031OpenAlexW2052898451WikidataQ37452847 ScholiaQ37452847MaRDI QIDQ3075554FDOQ3075554

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

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

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)

Cites Work

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

Cited In (15)

• Data-driven efficient solvers for Langevin dynamics on manifold in high dimensions
• 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
• Theoretical aspects of equitable partition of networks into sparse modules
• Remarks on network community properties
• Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains
• Finding Dominant Structures of Nonreversible Markov Processes
• 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
• The optimal partitioning of networks
• Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
• Formal lumping of polynomial differential equations through approximate equivalences
• Stability, bifurcation and phase-locking of time-delayed excitatory-inhibitory neural networks

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)