Related papers: Deterministic equivalence for noisy perturbations
Noise-based logic is a practically deterministic logic scheme inspired by the randomness of neural spikes and uses a system of uncorrelated stochastic processes and their superposition to represent the logic state. We briefly discuss…
Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then…
We prove localization with high probability on sets of size of order $N/\log N$ for the eigenvectors of non-Hermitian finitely banded $N\times N$ Toeplitz matrices $P_N$ subject to small random perturbations, in a very general setting. As…
We present a general theory of quantum information processing devices, that can be applied to human decision makers, to atomic multimode registers, or to molecular high-spin registers. Our quantum decision theory is a generalization of the…
Recently, it is realized that non-perturbative instanton effects can be generated to all orders by perturbation theory around a degenerate minima via Dunne-Unsal relation in several quantum mechanical systems. In this work we verify the…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…
We consider powers of the absolute value of the characteristic polynomial of Haar distributed random orthogonal or symplectic matrices, as well as powers of the exponential of its argument, as a random measure on the unit circle minus small…
It is a result of Ginibre that the normalized bulk $k$-point correlation functions of a complex $n\times n$ Gaussian matrix with independent entries of mean zero and unit variance are asymptotically given by the determinantal point process…
We prove oracle inequalities for a penalized log-likelihood criterion that hold even if the data are not independent and not stationary, based on a martingale approach. The assumptions are checked for various contexts: density estimation…
We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions $d \leq 2$. In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large…
We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…
We address the detection of a low rank $n\times n$deterministic matrix $\mathbf{X}_{0}$ from the noisy observation ${\bf X}_{0}+{\bf Z}$ when $n\to\infty$, where ${\bf Z}$ is a complex Gaussian random matrix with independent identically…
Let $\mathcal{L}$ be a language that can be decided in linear space and let $\epsilon >0$ be any constant. Let $\mathcal{A}$ be the exponential hardness assumption that for every $n$, membership in $\mathcal{L}$ for inputs of length~$n$…
We derive a general large deviation principle for a canonical sequence of probability measures, having its origins in random matrix theory, on unbounded sets $K$ of ${\bf C}$ with weakly admissible external fields $Q$ and very general…
It is well known that a random multiplicative process with weak additive noise generates a power-law probability distribution. It has recently been recognized that this process exhibits another type of power law: the moment of the…
We consider in this work quantities that can be obtained as limits of powers of parametrized matrices, for instance the inverse matrix or the logarithm of the determinant. Under the assumption of affine dependence in the parameters, we use…
We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative importance in a given time series. To this end we extend i) the use of ordinal patterns-based probability distribution…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We demonstrate, by construction, that simple renormalizable matrix potentials with S_N, as opposed to O(N), symmetry can exhibit an exponentially large number of inequivalent deep local minima.
We demonstrate that the measurement of $1/f^{\alpha}$ noise at the single molecule or nano-object limit is remarkably distinct from the macroscopic measurement over a large sample. The single particle measurements yield a conditional…