相关论文: What is the Simplest Linear Ramp?
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
The spectral form factor is a powerful probe of quantum chaos that diagnoses the statistics of energy levels, but is blind to other features of a theory such as matrix elements of operators or OPE coefficients in conformal field theories.…
This article is concerned with the spectral behavior of $p$-dimensional linear processes in the moderately high-dimensional case when both dimensionality $p$ and sample size $n$ tend to infinity so that $p/n\to0$. It is shown that, under an…
We show that for any Riemannian foliation with a simply connected and negatively curved leaf space the normal exponential map of a leaf is a diffeomorphism. As an application, if the leaves are furthermore minimal submanifolds, we give a…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…
We introduce a random matrix model where the entries are dependent across both rows and columns. More precisely, we investigate matrices of the form $\X=(X_{(i-1)n+t})_{it}\in\R^{p\times n}$ derived from a linear process $X_t=\sum_j c_j…
Linial-Meshulam complex is a random simplicial complex on $n$ vertices with a complete $(d-1)$-dimensional skeleton and $d$-simplices occurring independently with probability p. Linial-Meshulam complex is one of the most studied…
The Random-Facet algorithm of Kalai and of Matousek, Sharir and Welzl is an elegant randomized algorithm for solving linear programs and more general LP-type problems. Its expected subexponential time of $2^{\tilde{O}(\sqrt{m})}$, where $m$…
The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
We study the spectral properties of a class of random matrices of the form $S_n^{-} = n^{-1}(X_1 X_2^* - X_2 X_1^*)$ where $X_k = \Sigma^{1/2}Z_k$, for $k=1,2$, $Z_k$'s are independent $p\times n$ complex-valued random matrices, and…
We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…
The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of…
We present a data-driven method - heteroscedastic matrix factorization, a kind of probabilistic factor analysis - for modeling or performing dimensionality reduction on observed spectra or other high-dimensional data with known but…
Spectral properties of Toeplitz operators and their finite truncations have long been central in operator theory. In the finite dimensional, non-normal setting, the spectrum is notoriously unstable under perturbations. Random perturbations…
We consider a non-relativistic quantum particle interacting with a singular potential supported by two parallel straight lines in the plane. We locate the essential spectrum under the hypothesis that the interaction asymptotically…
We consider a random Schro\"dinger operator in an external magnetic field. The random potential consists of delta functions of random strengths situated on the sites of a regular two-dimensional lattice. We characterize the spectrum in the…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…