中文
相关论文

相关论文: Real symmetric random matrices and paths counting

200 篇论文

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

概率论 · 数学 2014-03-05 Roman Vershynin

We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…

群论 · 数学 2007-05-23 Jason Fulman

In this paper, we investigate the invertibility of sparse symmetric matrices. We show that for an $n\times n$ sparse symmetric random matrix $A$ with $A_{ij} = \delta_{ij} \xi_{ij}$ is invertible with high probability. Here, $\delta_{ij}$s,…

概率论 · 数学 2018-04-26 Feng Wei

In this paper we consider ensemble of random matrices $\X_n$ with independent identically distributed vectors $(X_{ij}, X_{ji})_{i \neq j}$ of entries. Under assumption of finite fourth moment of matrix entries it is proved that empirical…

概率论 · 数学 2012-08-07 Alexey Naumov

In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…

组合数学 · 数学 2020-12-09 Kyle Luh , Sean Meehan , Hoi H. Nguyen

We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…

凝聚态物理 · 物理学 2009-10-22 M. M. Fogler , B. I. Shklovskii

Model checking is the process of deciding whether a system satisfies a given specification. Often, when the setting comprises multiple processes, the specifications are over sets of input and output signals that correspond to individual…

计算机科学中的逻辑 · 计算机科学 2020-07-24 Shaull Almagor

We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.

数论 · 数学 2007-05-23 Roland Bacher , Robin Chapman

We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…

概率论 · 数学 2007-06-14 Bernard Bercu , Wlodzimierz Bryc

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

概率论 · 数学 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

We study ensembles of sparse random block matrices generated from the adjacency matrix of a Erd\"os-Renyi random graph with $N$ vertices of average degree $Z$, inserting a real symmetric $d \times d$ random block at each non-vanishing…

数学物理 · 物理学 2022-06-22 Giovanni M. Cicuta , Mario Pernici

We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.

群论 · 数学 2013-12-18 Igor Rivin

Consider the ensemble of real symmetric Toeplitz matrices, each independent entry an i.i.d. random variable chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. Previous investigations showed that…

概率论 · 数学 2010-11-16 Adam Massey , Steven J. Miller , John Sinsheimer

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

代数几何 · 数学 2021-10-13 Madeleine Weinstein

The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is…

动力系统 · 数学 2007-05-23 Vincent Blondel , Yurii Nesterov

We derive concentration inequalities for the spectral measure of large random matrices, allowing for certain forms of dependence. Our main focus is on empirical covariance (Wishart) matrices, but general symmetric random matrices are also…

统计理论 · 数学 2018-09-24 Adityanand Guntuboyina , Hannes Leeb

In this work we study symmetric random matrices with variance profile satisfying certain conditions. We establish the convergence of the operator norm of these matrices to the largest element of the support of the limiting empirical…

概率论 · 数学 2024-04-23 Dimitris Cheliotis , Michail Louvaris

We derive concentration inequalities for functions of the empirical measure of large random matrices with infinitely divisible entries and, in particular, stable ones. We also give concentration results for some other functionals of these…

概率论 · 数学 2007-06-13 Christian Houdré , Hua Xu

Consider an $n \times n$ non-Hermitian random matrix $M_n$ whose entries are independent real random variables. Under suitable conditions on the entries, we study the fluctuations of the entries of $f(M_n)$ as $n$ tends to infinity, where…

概率论 · 数学 2014-08-18 Sean O'Rourke