Partitions of networks that are robust to vertex permutation dynamics

DOI10.1515/spma-2015-0003zbMath1311.05096OpenAlexW872941030MaRDI QIDQ2344230

Eric Kwok, Gary Froyland

Publication date: 13 May 2015

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/spma-2015-0003

zbMATH Keywords

graph bisectionspectral methodLaplacian matrixpermutation dynamics

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (2)

DYNAMIC ISOPERIMETRY ON GRAPHS AND WEIGHTED RIEMANNIAN MANIFOLDS ⋮ Detecting the birth and death of finite‐time coherent sets

Uses Software

• GenLouvain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues and expanders
• Spectral partitioning with multiple eigenvectors
• Graph partitioning models for parallel computing
• Diffusion maps for changing data
• Moment-closure approximations for discrete adaptive networks
• Isoperimetric numbers of graphs
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Eigenvalues of the Laplacian of a graph^∗
• Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles
• Transport in time-dependent dynamical systems: Finite-time coherent sets
• A Cheeger Inequality for the Graph Connection Laplacian
• Generation of clusters in complex dynamical networks via pinning control
• An r-Dimensional Quadratic Placement Algorithm
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: Partitions of networks that are robust to vertex permutation dynamics