Related papers: Random centers of localization for random operator…
Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is…
We consider a problem of replication of random vectors by ordinary integrals in the setting when a underlying random variable is generated by a Wiener process. The goal is to find an optimal adapted process such that its cumulative integral…
New effective operators, describing the photons with given polarization at given position with respect to a source are proposed. These operators can be used to construct the near and intermediate zones quantum optics. It is shown that the…
Random linear codes (RLCs) are well known to have nice combinatorial properties and near-optimal parameters in many different settings. However, getting explicit constructions matching the parameters of RLCs is challenging, and RLCs are…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a…
In this note we show that, a simple combination of deep results in the theory of random Schr\"odinger operators yields a quantitative estimate of the fact that the localization centers become far apart, as corresponding energies are close…
Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any…
We consider disordered Hamiltonians given by the Laplace operator subject to arbitrary random self-adjoint singular perturbations supported on random discrete subsets of the real line. Under minimal assumptions on the type of disorder, we…
Being able to accurately locate wireless devices, while guaranteeing high-level of security against spoofing attacks, benefits all participants in the localization chain (e.g., end users, network operators, and location service providers).…
Self-localization is a fundamental capability that mobile robot navigation systems integrate to move from one point to another using a map. Thus, any enhancement in localization accuracy is crucial to perform delicate dexterity tasks. This…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…
We discuss various approaches to localization results for one-dimensional random Schr\"odinger operators, both discrete and continuum. We focus in particular on the approach based on F\"urstenberg's Theorem and the Kunz-Souillard method.…
We introduce computable projection operators onto piecewise polynomial spaces, defined via sampling and discrete least-squares polynomial approximations. The resulting mappings exhibit (almost) optimal approximation properties in $L^2$ and…
We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…
We consider a random time evolution operator composed of a circuit of random unitaries coupling even and odd neighboring spins on a chain in turn. In spirit of Floquet evolution, the circuit is time-periodic; each timestep is repeated with…
The localization phenomenon for periodic unitary transition operators on a Hilbert space consisting of square summable functions on an integer lattice with values in a complex vector space, which is a generalization of the discrete-time…
We study the region of complete localization in a class of random operators which includes random Schr\"odinger operators with Anderson-type potentials and classical wave operators in random media, as well as the Anderson tight-binding…