Layout of random circulant graphs

DOI10.1016/j.laa.2018.09.003zbMath1397.05105arXiv1707.04480OpenAlexW2963064612WikidataQ129323752 ScholiaQ129323752MaRDI QIDQ1794318

Sebastian Richter, Israel Rocha

Publication date: 15 October 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

random matricesrandom graphsgeometric graphscirculant matricesrank correlation coefficient

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Recovering the structure of random linear graphs

Cites Work

• Unnamed Item
• Embeddings of circulant networks
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• Recovering the structure of random linear graphs
• Approximating Layout Problems on Random Geometric Graphs
• A Simple SVD Algorithm for Finding Hidden Partitions
• Optimal Numberings of an $N \times N$ Array
• Numerical Methods for Computing Angles Between Linear Subspaces
• Mapping the genome
• A useful variant of the Davis–Kahan theorem for statisticians
• The Rotation of Eigenvectors by a Perturbation. III

This page was built for publication: Layout of random circulant graphs