Magnetic Eigenmaps for the Visualization of Directed Networks
arXiv:1606.08266 · doi:10.1016/j.acha.2017.01.004
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.
References in corpus (4)
- Finding community structure in networks using the eigenvectors of matrices
- Community structure in directed networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
Cited by in corpus (8)
- Complex Networks from Classical to Quantum
- Complex Quantum Networks: a Topical Review
- Complex networks with complex weights
- Higher-order Connection Laplacians for Directed Simplicial Complexes
- Zoo Guide to Network Embedding
- Geometric Scattering on Measure Spaces
- A metric on directed graphs and Markov chains based on hitting probabilities
- Directed Network Laplacians and Random Graph Models