Related papers: Circular law for sparse random regular digraphs

We apply the operation of random independent thinning on the eigenvalues of $n\times n$ Haar distributed unitary random matrices. We study gap probabilities for the thinned eigenvalues, and we study the statistics of the eigenvalues of…

Broadcasting and convergecasting are pivotal services in distributed systems, in particular, in wireless ad-hoc and sensor networks, which are characterized by time- varying communication graphs. We study the question of whether it is…

An application of Levy's continuity theorem and Hankel transform allow us to establish a law limit theorem for the sequence $V_n=f(U)\sin(n U)$, where $U$ is uniformly distributed in $(0,1)$ and $f$ a given function. Further, we investigate…

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…

Diffusion models, which convert noise into new data instances by learning to reverse a diffusion process, have become a cornerstone in contemporary generative modeling. In this work, we develop non-asymptotic convergence theory for a…

We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdos-Renyi graph model $G(N,p)$. We prove a local law for the eigenvalue density…

We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…

Let $n$ points be placed independently in $d-$dimensional space according to the standard $d-$dimensional normal distribution. Let $d_n$ be the longest edge length for the nearest neighbor graph on these points. We show that \[\lim_{n \rar…

In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…

We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random nxn matrix L defined by L(j,k)=X(j,k) if k<>j and…

There has been much interest in the distribution of the circumference, the length of the longest cycle, of a random graph $G(n,p)$ in the sparse regime, when $p = \Theta\left(\frac{1}{n}\right)$. Recently, the first author and Frieze…

In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential…

One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…

The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…

For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…

We establish the limiting spectral distribution of Kendall's correlation matrices in the moderate high-dimensional regime where the dimension grows slower than the sample size. Our framework allows observations to be independent but not…

We study the distribution of singular numbers of products of certain classes of $p$-adic random matrices, as both the matrix size and number of products go to $\infty$ simultaneously. In this limit, we prove convergence of the local…

We show that given $n$ normalized intervals on the unit circle, the numbers of visits of $d$ random rotations to these intervals have a joint limiting distribution as lengths of trajectories tend to infinity. If $d$ then tends to infinity,…

We consider the spectral radius of a large random matrix $X$ with independent, identically distributed entries. We show that its typical size is given by a precise three-term asymptotics with an optimal error term beyond the radius of the…

For positive integers $d<k$ and $n$ divisible by $k$, let $m_{d}(k,n)$ be the minimum $d$-degree ensuring the existence of a perfect matching in a $k$-uniform hypergraph. In the graph case (where $k=2$), a classical theorem of Dirac says…