English
Related papers

Related papers: Circular law for the sum of random permutation mat…

200 papers

Consider the product $G_{n}=g_{n} ... g_{1}$ of the random matrices $g_{1},...,g_{n}$ in $GL(d,\mathbb{R}) $ and the random process $ G_{n}v=g_{n}... g_{1}v$ in $\mathbb{R}^{d}$ starting at point $v\in \mathbb{R}^{d}\smallsetminus \{0\} .$…

Probability · Mathematics 2024-12-23 Ion Grama , Emile Le Page , Marc Peigné

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,…

Probability · Mathematics 2018-04-26 Feng Wei

Let $p\_n$ be the probability for a planar Poisson-Voronoi cell to have exactly $n$ sides. We construct the asymptotic expansion of $\log p\_n$ up to terms that vanish as $n\to\infty$. We show that {\it two independent biased random walks}…

Statistical Mechanics · Physics 2009-11-10 H. J. Hilhorst

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…

Logic · Mathematics 2009-09-25 Saharon Shelah , Joel Spencer

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being i.i.d. random variables with mean zero and unit variance. We additionally suppose that $\mathbb E |X_{11}|^{4 + \delta} =:…

Probability · Mathematics 2019-03-20 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov , Dmitry Timushev

We introduce the sequence $(i_n)_{n \geq 0}$ defined by $i_n = (-1)^{inv_2(n)}$, where $inv_2(n)$ denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this…

Combinatorics · Mathematics 2014-08-13 Philip Lafrance , Narad Rampersad , Randy Yee

We study Haar unitary random matrices with permuted entries. For a sequence of permutations $\left(\sigma_N\right)_N$, where $\sigma_N$ acts on $N\times N$ matrices we identify conditions under which the $\ast$--distribution of permuted…

Probability · Mathematics 2021-02-23 James A. Mingo , Mihai Popa , Kamil Szpojankowski

Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…

Combinatorics · Mathematics 2009-05-05 Jean Bourgain , Van Vu , Philip Matchett Wood

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Probability · Mathematics 2015-05-19 Julia Storm , Dirk Zeindler

We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms; (2) The infinity norm of most unit eigenvectors of…

Probability · Mathematics 2014-08-19 Van Vu , Ke Wang

We consider $n\times n$ non-Hermitian random matrices with independent entries and a variance profile, as well as an additive deterministic diagonal deformation. We show that their empirical eigenvalue distribution converges to a limiting…

Probability · Mathematics 2024-11-11 Johannes Alt , Torben Krüger

The circular uniform distribution on the unit circle is closed under summation, that is, the sum of independent circular uniformly distributed random variables is also circular uniformly distributed. In this study, it is shown that a family…

Methodology · Statistics 2025-01-10 Fernández-Durán , Juan José , Gregorio-Domínguez , María Mercedes

Benford's law is a famous law in statistics which states that the leading digits of random variables in diverse data sets appear not uniformly from 1 to 9; the probability that d (d=1,...,9) appears as a leading digit is given by…

Probability · Mathematics 2019-05-07 Kazufumi Ozawa

We show that the classical Pollard rho algorithm for discrete logarithms produces a collision in expected time O(sqrt(n)(log n)^3). This is the first nontrivial rigorous estimate for the collision probability for the unaltered Pollard rho…

Number Theory · Mathematics 2007-05-23 Stephen D. Miller , Ramarathnam Venkatesan

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and…

Probability · Mathematics 2024-09-17 Bhaswar B. Bhattacharya , Sayan Das , Somabha Mukherjee , Sumit Mukherjee

An equation is obtained for the Stieltjes transform of the normalized distribution of singular values of non-symmetric band random matrices in the limit when the band width and rank of the matrix simultaneously tend to infinity. Conditions…

Mathematical Physics · Physics 2015-03-17 Anna Lytova , Leonid Pastur

Let $\{X, X_{n}; n \geq 1\}$ be a sequence of i.i.d. non-degenerate real-valued random variables with $\mathbb{E}X^{2} < \infty$. Let $S_{n} = \sum_{i=1}^{n} X_{i}$, $n \geq 1$. Let $g(\cdot): ~[0, \infty) \rightarrow [0, \infty)$ be a…

Probability · Mathematics 2025-05-02 Deli Li , Yu Miao , Yongcheng Qi

Consider random k-circulants A_{k,n} with n tends to infinity, k=k(n) and whose input sequence \{a_l\}_{l \ge 0} is independent with mean zero and variance one and \sup_n n^{-1}\sum_{l=1}^n \E |a_l|^{2+\delta}< \infty for some \delta > 0.…

Probability · Mathematics 2009-12-07 Arup Bose , Joydip Mitra , Arnab Sen

Let $x_1, \dots, x_n$ be $n$ independent and identically distributed random variables with mean zero, unit variance, and finite moments of all remaining orders. We study the random polynomial $p_n$ having roots at $x_1, \dots, x_n$. We…

Probability · Mathematics 2020-05-21 Jeremy G. Hoskins , Stefan Steinerberger

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

Probability · Mathematics 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley