On the public citation graph
Eigenvectors of random graphs: Nodal Domains
0 signed · 66 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-77200-2_13openalex-snapshot
Random Discrete Matrices
inferredcites →https://doi.org/10.1007/978-3-642-18245-7openalex-snapshot
A Panoramic View of Riemannian Geometry
inferredcites →https://doi.org/10.1007/bf02579329openalex-snapshot
The eigenvalues of random symmetric matrices
inferredcites →https://doi.org/10.1007/bf02785860openalex-snapshot
On the concentration of eigenvalues of random symmetric matrices
inferredcites →https://doi.org/10.1007/s00039-010-0057-8openalex-snapshot
Random Matrices: the Distribution of the Smallest Singular Values
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/j.aim.2004.08.004openalex-snapshot
Smallest singular value of random matrices and geometry of random polytopes
inferredcites →https://doi.org/10.1016/j.aim.2008.01.010openalex-snapshot
The Littlewood–Offord problem and invertibility of random matrices
inferredcites →https://doi.org/10.1016/s0024-3795(01)00313-5openalex-snapshot
Discrete nodal domain theorems
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6051-9openalex-snapshot
Eigenvalues in Riemannian Geometry
inferredcites →https://doi.org/10.1017/9781009549035openalex-snapshot
Probability Theory, An Analytic View
inferredcites →https://doi.org/10.1017/s0305004100010112openalex-snapshot
A note on analytic functions in the unit circle
inferredcites →https://doi.org/10.1023/a:1013899527204openalex-snapshot
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
inferredcites →https://doi.org/10.1073/pnas.0500334102openalex-snapshot
Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
inferredcites →https://doi.org/10.1073/pnas.0500896102openalex-snapshot
Geometric diffusions as a tool for harmonic analysis and structure definition of data: Multiscale methods
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/pspum/077/2459862openalex-snapshot
Nodal domains on graphs—how to count them and why?
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/iccv.1999.790354openalex-snapshot
Segmentation using eigenvectors: a unifying view
inferredcites →https://doi.org/10.1137/0611030openalex-snapshot
Partitioning Sparse Matrices with Eigenvectors of Graphs
inferredcites →https://doi.org/10.1215/s0012-7094-06-13527-5openalex-snapshot
Random symmetric matrices are almost surely nonsingular
inferredcites →https://doi.org/10.1515/crll.2005.2005.589.1openalex-snapshot
Euclidean embeddings in spaces of finite volume ratio via random matrices
inferredcites →https://doi.org/10.4007/annals.2008.168.575openalex-snapshot
Invertibility of random matrices: norm of the inverse
inferredcites →https://doi.org/10.4007/annals.2009.169.595openalex-snapshot
Inverse Littlewood–Offord theorems and the condition number of random discrete matrices
inferredcites →https://doi.org/10.48550/arxiv.0711.3416openalex-snapshot
Nodal domains on graphs - How to count them and why?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20561openalex-snapshot
Random weighted projections, random quadratic forms and random eigenvectors
inferred← citeshttps://doi.org/10.1002/rsa.20696openalex-snapshot
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
inferred← citeshttps://doi.org/10.1002/rsa.20917openalex-snapshot
Eigenvector delocalization for non‐Hermitian random matrices and applications
inferred← citeshttps://doi.org/10.1002/rsa.20925openalex-snapshot
Size of nodal domains of the eigenvectors of a graph
inferred← citeshttps://doi.org/10.1007/978-3-030-03574-7_2openalex-snapshot
Transformation from Graphs to Signals and Back
inferred← citeshttps://doi.org/10.1007/978-3-319-49887-4_4openalex-snapshot
Localization in Matrix Computations: Theory and Applications
inferred← citeshttps://doi.org/10.1007/s00039-016-0389-0openalex-snapshot
No-gaps delocalization for general random matrices
inferred← citeshttps://doi.org/10.1007/s00220-023-04709-6openalex-snapshot
Many Nodal Domains in Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00440-016-0693-5openalex-snapshot
Random matrices: tail bounds for gaps between eigenvalues
inferred← citeshttps://doi.org/10.1007/s00454-021-00345-wopenalex-snapshot
Geodesic Geometry on Graphs
inferred← citeshttps://doi.org/10.1016/j.acha.2015.02.005openalex-snapshot
Vertex-frequency analysis on graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.06.008openalex-snapshot
Eigenvectors of random matrices: A survey
inferred← citeshttps://doi.org/10.1016/j.jfa.2025.111266openalex-snapshot
Phase transition for the bottom singular vector of rectangular random matrices
inferred← citeshttps://doi.org/10.1016/j.matcom.2018.05.002openalex-snapshot
Maximizing the algebraic connectivity of meshed electrical pathways used as current return network
inferred← citeshttps://doi.org/10.1016/j.physa.2020.124169openalex-snapshot
Principal eigenvector localization and centrality in networks: Revisited
inferred← citeshttps://doi.org/10.1016/j.physleta.2014.12.010openalex-snapshot
On the distribution of local extrema in Quantum Chaos
inferred← citeshttps://doi.org/10.1017/atsip.2018.2openalex-snapshot
Global and local uncertainty principles for signals on graphs
inferred← citeshttps://doi.org/10.1088/1751-8121/aaebb2openalex-snapshot
Moments of the inverse participation ratio for the Laplacian on finite regular graphs
inferred← citeshttps://doi.org/10.1090/pcms/026/07openalex-snapshot
Delocalization of eigenvectors of random matrices
inferred← citeshttps://doi.org/10.1090/proc/14284openalex-snapshot
Eigenvectors of random matrices of symmetric entry distributions
inferred← citeshttps://doi.org/10.1093/imrn/rnae012openalex-snapshot
Nodal Decompositions of a Symmetric Matrix
inferred← citeshttps://doi.org/10.1093/imrn/rnz008openalex-snapshot
On Non-localization of Eigenvectors of High Girth Graphs
inferred← citeshttps://doi.org/10.1103/physreva.102.022423openalex-snapshot
Analog quantum algorithms for the mixing of Markov chains
inferred← citeshttps://doi.org/10.1103/physrevlett.124.050501openalex-snapshot
How Fast Do Quantum Walks Mix?
inferred← citeshttps://doi.org/10.1109/sampta59647.2023.10301383openalex-snapshot
Quantization of Bandlimited Graph Signals
inferred← citeshttps://doi.org/10.1214/11-aop673openalex-snapshot
Sparse regular random graphs: Spectral density and eigenvectors
inferred← citeshttps://doi.org/10.1214/11-aop734openalex-snapshot
Spectral statistics of Erdős–Rényi graphs I: Local semicircle law
inferred← citeshttps://doi.org/10.1214/18-ecp198openalex-snapshot
Delocalization and limiting spectral distribution of Erdős-Rényi graphs with constant expected degree
inferred← citeshttps://doi.org/10.1214/20-ps346openalex-snapshot
Recent progress in combinatorial random matrix theory
inferred← citeshttps://doi.org/10.1214/21-ejp588openalex-snapshot
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
inferred← citeshttps://doi.org/10.1214/21-ejp669openalex-snapshot
Tail bounds for gaps between eigenvalues of sparse random matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1406.4673openalex-snapshot
Local Extrema in Quantum Chaos
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01824openalex-snapshot
Noise Sensitivity and Noise Stability for Markov Chains: Existence Results
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04697openalex-snapshot
From graphs to signals and back: Identification of network structures using spectral analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1506.04012openalex-snapshot
No-gaps delocalization for general random matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1707.08461openalex-snapshot
Delocalization of eigenvectors of random matrices. Lecture notes
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00202openalex-snapshot
Network construction: A learning framework through localizing principal eigenvector
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00447openalex-snapshot
Size of nodal domains of the eigenvectors of a G(n,p) graph
inferred← citeshttps://doi.org/10.7282/t3gb22n0openalex-snapshot
Optimal upper bound for the infinity norm of eigenvectors of random matrices
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.