4.6 Article

Many Nodal Domains in Random Regular Graphs

Related references

Note: Only part of the references are listed.
Article Computer Science, Software Engineering

Size of nodal domains of the eigenvectors of a G(n, p) graph

Han Huang et al.

RANDOM STRUCTURES & ALGORITHMS (2020)

Article Physics, Mathematical

Local Kesten-McKay Law for Random Regular Graphs

Roland Bauerschmidt et al.

COMMUNICATIONS IN MATHEMATICAL PHYSICS (2019)

Article Statistics & Probability

ON THE ALMOST EIGENVECTORS OF RANDOM REGULAR GRAPHS

Agnes Backhausz et al.

ANNALS OF PROBABILITY (2019)

Article Mathematics

No-gaps delocalization for general random matrices

Mark Rudelson et al.

GEOMETRIC AND FUNCTIONAL ANALYSIS (2016)

Article Mathematics

DELOCALIZATION OF EIGENVECTORS OF RANDOM MATRICES WITH INDEPENDENT ENTRIES

Mark Rudelson et al.

DUKE MATHEMATICAL JOURNAL (2015)

Article Computer Science, Software Engineering

Eigenvectors of Random Graphs: Nodal Domains

Yael Dekel et al.

RANDOM STRUCTURES & ALGORITHMS (2011)

Article Physics, Multidisciplinary

Eigenvectors of the discrete Laplacian on regular graphs-a statistical approach

Yehonatan Elon

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2008)

Article Physics, Mathematical

A lower bound for nodal count on discrete and metric graphs

Gregory Berkolaiko

COMMUNICATIONS IN MATHEMATICAL PHYSICS (2008)

Article Physics, Multidisciplinary

Nodal domains statistics: A criterion for quantum chaos

G Blum et al.

PHYSICAL REVIEW LETTERS (2002)