Related papers: Random projections beyond zero overlap
Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…
Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two…
We show that, almost surely, the Hausdorff dimension $s_0$ of a random covering set is preserved under all orthogonal projections to linear subspaces with dimension $k>s_0$. The result holds for random covering sets with a generating…
In this paper, we show that the replica symmetry of the Gibbs measure of spherical spin systems is a property of the eigenvalue spacing at the edge of the interaction matrix. In particular, our interaction matrix has \textbf{two} large…
We discuss the application of random projections to the fundamental problem of deciding whether a given point in a Euclidean space belongs to a given set. We show that, under a number of different assumptions, the feasibility and…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
In this paper we obtain two results for the Sherrington-Kirkpatrick (SK) model, and we show that they both emerge from a single approach. First, we prove that the average of the overlap takes positive values when it is non zero. More…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…
Gibbs random fields corresponding to systems of real-valued spins (e.g. systems of interacting anharmonic oscillators) indexed by the vertices of unbounded degree graphs with a certain summability property are constructed. It is proven that…
The overlap formulation of regulated vectorial and chiral gauge theories is reviewed. Ostensibly new constructions, based on the Ginsparg-Wilson relation are essentially just overlap with new notation. At present there exists no…
The random sampling task performed by Google's Sycamore processor gave us a glimpse of the "Quantum Supremacy era". This has definitely shed some spotlight on the power of random quantum circuits in this abstract task of sampling outputs…
This paper explores a natural generalization of Euclidean projection through the lens of strongly quasiconvex functions, as developed in prior works. By establishing a connection between strongly quasiconvex functions and the theory of…
Johnson-Lindenstrauss lemma states random projections can be used as a topology preserving embedding technique for fixed vectors. In this paper, we try to understand how random projections affect probabilistic properties of random vectors.…
We investigate the low-dimensional structure of deterministic transformations between random variables, i.e., transport maps between probability measures. In the context of statistics and machine learning, these transformations can be used…
Spaces of convex and concave functions appear naturally in theory and applications. For example, convex regression and log-concave density estimation are important topics in nonparametric statistics. In stochastic portfolio theory, concave…
We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
We consider a Lattice Gas model in which the sites interact via infinite-ranged random couplings independently distributed with a Gaussian probability density. This is the Lattice Gas analogue of the well known Sherrington-Kirkpatrick Ising…
For a very general class of probability distributions in disordered Ising spin systems, in the thermodynamical limit, we prove the following property for overlaps among real replicas. Consider the overlaps among s replicas. Add one replica…