中文
相关论文

相关论文: Eigenvalues and spectral gap in sparse random simp…

200 篇论文

In this paper we consider symmetric, positive semidefinite (SPSD) matrix $A$ and present two algorithms for computing the $p$-Schatten norm $\|A\|_p$. The first algorithm works for any SPSD matrix $A$. The second algorithm works for…

数据结构与算法 · 计算机科学 2018-08-08 Vladimir Braverman

We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…

概率论 · 数学 2021-10-22 Elliot Paquette , Andrew Vander Werf

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

概率论 · 数学 2014-03-05 Roman Vershynin

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

组合数学 · 数学 2022-10-21 Florian Frick , Andrew Newman

We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…

数学物理 · 物理学 2013-12-03 Valentin Vengerovsky

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…

代数拓扑 · 数学 2025-07-15 Julián David Candela

High-dimensional settings, where the data dimension ($d$) far exceeds the number of observations ($n$), are common in many statistical and machine learning applications. Methods based on $\ell_1$-relaxation, such as Lasso, are very popular…

机器学习 · 统计学 2018-02-20 Shiva Prasad Kasiviswanathan , Mark Rudelson

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

概率论 · 数学 2020-05-15 Amir Dembo , Eyal Lubetzky , Yumeng Zhang

We compute the spectral density for ensembles of of sparse symmetric random matrices using replica, managing to circumvent difficulties that have been encountered in earlier approaches along the lines first suggested in a seminal paper by…

无序系统与神经网络 · 物理学 2009-11-13 Reimer Kuehn

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…

组合数学 · 数学 2015-12-29 Alexander Lubotzky , Zur Luria , Ron Rosenthal

We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…

无序系统与神经网络 · 物理学 2024-11-14 Leticia F. Cugliandolo , Grégory Schehr , Marco Tarzia , Davide Venturelli

We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…

概率论 · 数学 2025-03-18 Nicholas Christoffersen , Kyle Luh , Hoi H. Nguyen , Jingheng Wang

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

概率论 · 数学 2020-05-19 Jess Banks , Jorge Garza Vargas , Archit Kulkarni , Nikhil Srivastava

The probabilities for gaps in the eigenvalue spectrum of the finite dimension $ N \times N $ random matrix Hermite and Jacobi unitary ensembles on some single and disconnected double intervals are found. These are cases where a reflection…

数学物理 · 物理学 2009-10-31 N. S. Witte , P. J. Forrester , Christopher M. Cosgrove

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…

无序系统与神经网络 · 物理学 2012-08-03 Yoshiyuki Kabashima , Hisanao Takahashi

We show almost sure simplicity of eigenvalues for several models of Anderson-type random Schr\"odinger operators, extending methods introduced by Simon for the discrete Anderson model. These methods work throughout the spectrum and are not…

数学物理 · 物理学 2018-01-03 Sergey Naboko , Roger Nichols , Günter Stolz

A sparse random block matrix model suggested by the Hessian matrix used in the study of elastic vibrational modes of amorphous solids is presented and analyzed. By evaluating some moments, benchmarked against numerics, differences in the…

无序系统与神经网络 · 物理学 2018-03-21 Giovanni M. Cicuta , Johannes Krausser , Rico Milkus , Alessio Zaccone

We consider a general multidimensional affine recursion with corresponding Markov operator $P$ and a unique $P$-stationary measure. We show spectral gap properties on H\"older spaces for the corresponding Fourier operators and we deduce…

概率论 · 数学 2013-05-13 Zhiqiang Gao , Yves Guivarc'h , Emile Le Page

Let $(E,\mathcal F,\mu)$ be a probability space, and let $P$ be a Markov operator on $L^2(\mu)$ with $1$ a simple eigenvalue such that $\mu P=\mu$ (i.e. $\mu$ is an invariant probability measure of $P$). Then $\hat P:=\ff 1 2 (P+P^*)$ has a…

泛函分析 · 数学 2013-11-19 Feng-Yu wang

Based on the recent work \cite{KKK} for compact potentials, we develop the spectral theory for the one-dimensional discrete Schr\"odinger operator $$ H \phi = (-\De + V)\phi=-(\phi_{n+1} + \phi_{n-1} - 2 \phi_n) + V_n \phi_n. $$ We show…

数学物理 · 物理学 2009-11-13 D. E. Pelinovsky , A. Stefanov