A note on Markov normalized magnetic eigenmaps
From MaRDI portal
Publication:2399653
DOI10.1016/J.ACHA.2016.11.002zbMATH Open1369.05090arXiv1608.04418OpenAlexW2963223632MaRDI QIDQ2399653FDOQ2399653
Authors: Alexander Cloninger 
Publication date: 24 August 2017
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Abstract: We note that building a magnetic Laplacian from the Markov transition matrix, rather than the graph adjacency matrix, yields several benefits for the magnetic eigenmaps algorithm. The two largest benefits are that the embedding becomes more stable as a function of the rotation parameter g, and the principal eigenvector of the magnetic Laplacian now converges to the page rank of the network as a function of diffusion time. We show empirically that this normalization improves the phase and real/imaginary embeddings of the low-frequency eigenvectors of the magnetic Laplacian.
Full work available at URL: https://arxiv.org/abs/1608.04418
Recommendations
- A Markov chain representation of the normalized Perron-Frobenius eigenvector
- A note on Laplacian eigenmaps
- Markov Maps and the Spectral Radius of 0-1 Matrices
- scientific article; zbMATH DE number 2193369
- Notes on Markov embedding
- Some remarks on normal maps with applications to eigenvalues and singular values of matrices
- On Dirichlet eigenvectors for neutral two-dimensional Markov chains
- Geometric bounds for eigenvalues of Markov chains
- Eigenmeasures and stochastic diagonalization of bilinear maps
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
Cited In (3)
This page was built for publication: A note on Markov normalized magnetic eigenmaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399653)
