Magnetic eigenmaps for the visualization of directed networks

DOI10.1016/J.ACHA.2017.01.004zbMATH Open1371.05278arXiv1606.08266OpenAlexW3122996080MaRDI QIDQ2409042FDOQ2409042

Authors: Michaël Fanuel, Carlos M. Alaíz, Ángela Fernández, Johan A. K. Suykens 

Publication date: 10 October 2017

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: We propose a framework for the visualization of directed networks relying on the eigenfunctions of the magnetic Laplacian, called here Magnetic Eigenmaps. The magnetic Laplacian is a complex deformation of the well-known combinatorial Laplacian. Features such as density of links and directionality patterns are revealed by plotting the phases of the first magnetic eigenvectors. An interpretation of the magnetic eigenvectors is given in connection with the angular synchronization problem. Illustrations of our method are given for both artificial and real networks.

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

Recommendations

• A note on Markov normalized magnetic eigenmaps
• Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian
• Drawing directed graphs clockwise
• Mapping directed networks
• On spectral graph drawing

zbMATH Keywords

data visualizationdirected graphmagnetic Laplacianmagnetic eigenmaps

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Mixture models and exploratory analysis in networks
• Magnetic interpretation of the nodal defect on graphs
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Vector diffusion maps and the connection Laplacian
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
• Laplacians and the Cheeger inequality for directed graphs
• A Cheeger Inequality for the Graph Connection Laplacian
• Angular synchronization by eigenvectors and semidefinite programming
• Spanning forests and the vector bundle Laplacian
• Nodal count of graph eigenfunctions via magnetic perturbation
• Determinants of Laplacians on graphs
• Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
• Discrete magnetic Laplacian
• A Local Clustering Algorithm for Connection Graphs
• Representation of functions on big data associated with directed graphs
• Magnetic eigenmaps for the visualization of directed networks

Cited In (9)

• Complex quantum networks: a topical review
• A metric on directed graphs and Markov chains based on hitting probabilities
• Random walks, conductance, and resistance for the connection graph Laplacian
• Mapping directed networks
• Recovering hidden components in multimodal data with composite diffusion operators
• A note on Markov normalized magnetic eigenmaps
• Spectral analysis of non-Hermitian matrices and directed graphs
• Geometric scattering on measure spaces
• Magnetic eigenmaps for the visualization of directed networks

This page was built for publication: Magnetic eigenmaps for the visualization of directed networks

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