Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian

DOI10.1063/5.0006891zbMath1445.05044arXiv2007.03466OpenAlexW3105196336WikidataQ98203129 ScholiaQ98203129MaRDI QIDQ5129842

Bruno Messias F. de Resende, Luciano F. da Costa

Publication date: 2 November 2020

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Geometric scattering on measure spaces ⋮ Lorentzian spectral geometry with causal sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Nodal count of graph eigenfunctions via magnetic perturbation
• Magnetic interpretation of the nodal defect on graphs
• Density matrix theory and applications.
• A history of graph entropy measures
• Fluxes, Laplacians, and Kasteleyn's theorem
• Which graphs are determined by their spectrum?
• The kernel polynomial method
• Toeplitz and Circulant Matrices: A Review
• Spectral properties of complex networks
• The Monge-Kantorovich problem: achievements, connections, and perspectives
• Can One Hear the Shape of a Drum?
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines

This page was built for publication: Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian