English
Related papers

Related papers: Integrable matrix theory: Level statistics

200 papers

We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…

Machine Learning · Statistics 2017-07-11 Marco Corneli , Pierre Latouche , Fabrice Rossi

An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…

Probability · Mathematics 2023-03-10 Xiaoyu Dong , Mark Rudelson

We consider a $p$-dimensional time series where the dimension $p$ increases with the sample size $n$. The resulting data matrix $X$ follows a stochastic volatility model: each entry consists of a positive random volatility term multiplied…

Probability · Mathematics 2020-01-15 Johannes Heiny , Thomas Mikosch

The class of complex random vectors whose covariance matrix is linearly parameterized by a basis of Hermitian Toeplitz (HT) matrices is considered, and the maximum compression ratios that preserve all second-order information are derived…

Statistics Theory · Mathematics 2016-11-15 Daniel Romero , Roberto Lopez-Valcarce , Geert Leus

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

Probability · Mathematics 2012-06-26 Raphael Lachieze-Rey , Giovanni Peccati

We discuss the Poisson structures, Lax matrices, $r$-matrices, bi-hamiltonian structures, the variables of separation and other attributes of the modern theory of dynamical systems in application to the integrable Euler top and to the…

Exactly Solvable and Integrable Systems · Physics 2011-11-17 A V Tsiganov

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

Probability · Mathematics 2013-02-21 Omer Friedland , Ohad Giladi

Many real-world data sets are sparse or almost sparse. One method to measure this for a matrix $A\in \mathbb{R}^{n\times n}$ is the \emph{numerical sparsity}, denoted $\mathsf{ns}(A)$, defined as the minimum $k\geq 1$ such that…

Data Structures and Algorithms · Computer Science 2021-07-06 Vladimir Braverman , Robert Krauthgamer , Aditya Krishnan , Shay Sapir

It is shown that any separable state on Hilbert space ${\cal H}={\cal H}_1\otimes{\cal H}_2$, can be written as a convex combination of N pure product states with $N\leq (dim{\cal H})^2$. Then a new separability criterion for mixed states…

Quantum Physics · Physics 2009-10-30 Pawel Horodecki

We study the distribution of entries of a random permutation matrix under a "randomized basis," i.e., we conjugate the random permutation matrix by an independent random orthogonal matrix drawn from Haar measure. It is shown that under…

Probability · Mathematics 2019-05-08 Benjamin Tsou

We study the limiting spectral measure of large random Helson matrices and large random matrices of certain patterned structures. Given a real random variable $X \in L^{2+ \varepsilon}(\mathbb{P}) $ for some $\varepsilon > 0$ and…

Probability · Mathematics 2026-02-26 Yanqi Qiu , Guocheng Zhen

We consider orthogonal, unitary, and symplectic ensembles of random matrices with (1/a)(ln x)^2 potentials, which obey spectral statistics different from the Wigner-Dyson and are argued to have multifractal eigenstates. If the coefficient…

Disordered Systems and Neural Networks · Physics 2009-10-31 Shinsuke M. Nishigaki

We study a hypothesis testing problem in the context of high-dimensional changepoint detection. Given a matrix $X \in \R^{p \times n}$ with independent Gaussian entries, the goal is to determine whether or not a sparse, non-null fraction of…

Statistics Theory · Mathematics 2025-03-27 Daniel Xiang , Chao Gao

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2017-12-27 Yanjun Li , Kiryung Lee , Yoram Bresler

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2018-01-03 Yanjun Li , Kiryung Lee , Yoram Bresler

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

Along the line of thoughts of Berry and Robnik\cite{[1]}, we investigated the gap distribution function of systems with infinitely many independent components, and discussed the level-spacing distribution of classically integrable quantum…

Chaotic Dynamics · Physics 2009-11-10 H. Makino , S. Tasaki

We consider the problem of parameter estimation by observations of inhomogeneous Poisson process. It is well-known that if the regularity conditions are fulfilled then the maximum likelihood and Bayesian estimators are consistent,…

Statistics Theory · Mathematics 2009-03-27 Yury A. Kutoyants

This article provides an overview on the statistical modeling of complex data as increasingly encountered in modern data analysis. It is argued that such data can often be described as elements of a metric space that satisfies certain…

Methodology · Statistics 2024-02-28 Paromita Dubey , Yaqing Chen , Hans-Georg Müller

Consider a sequence of Poisson random connection models (X_n,lambda_n,g_n) on R^d, where lambda_n / n^d \to lambda > 0 and g_n(x) = g(nx) for some non-increasing, integrable connection function g. Let I_n(g) be the number of isolated…

Probability · Mathematics 2014-04-09 Tim van de Brug , Ronald Meester
‹ Prev 1 8 9 10 Next ›