Detection of core–periphery structure in networks using spectral methods and geodesic paths

DOI10.1017/S095679251600022XzbMath1380.68311arXiv1410.6572OpenAlexW1962338095WikidataQ61945071 ScholiaQ61945071MaRDI QIDQ4594616

Puck Rombach, Mihai Cucuringu, Sang Hoon Lee, Mason A. Porter

Publication date: 24 November 2017

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.6572

zbMATH Keywords

networksgraph Laplaciansshortest-path algorithmscore-periphery structurelow-rank matrix approximations

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items (12)

Core-Periphery Detection in Hypergraphs ⋮ Epidemic behaviors in weighted networks with core-periphery structure ⋮ Core-Periphery Structure in Networks (Revisited) ⋮ Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics ⋮ Network Effects in Default Clustering for Large Systems ⋮ Clustering heterogeneous financial networks ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Core–periphery structure in directed networks ⋮ Short Communication: Dynamic Default Contagion in Heterogeneous Interbank Systems ⋮ Sparse networks with core-periphery structure ⋮ Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization ⋮ Finding core-periphery structures in large networks

Uses Software

• GenLouvain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
• Angular synchronization by eigenvectors and semidefinite programming
• Spectral partitioning works: planar graphs and finite element meshes
• Introductory lectures on convex optimization. A basic course.
• The largest eigenvalue of rank one deformation of large Wigner matrices
• Diffusion maps
• The number of trees in a graph. I. II
• A faster algorithm for betweenness centrality*
• Graph Implementations for Nonsmooth Convex Programs
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Centrality metrics and localization in core-periphery networks
• BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
• Communities in Networks
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Community structure in social and biological networks
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Computing Communities in Large Networks Using Random Walks
• Core-Periphery Structure in Networks
• Random Graphs
• Networks
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

This page was built for publication: Detection of core–periphery structure in networks using spectral methods and geodesic paths