Related papers: Asymptotic Properties of Random Contingency Tables…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

We consider random stochastic matrices $M$ with elements given by $M_{ij}=|U_{ij}|^2$, with $U$ being uniformly distributed on one of the classical compact Lie groups or associated symmetric spaces. We observe numerically that, for large…

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

In this paper, we analyze the asymptotic behavior of the main characteristics of the mean-variance efficient frontier employing random matrix theory. Our particular interest covers the case when the dimension $p$ and the sample size $n$…

We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local change in the graph. We call a graph property $A$…

Given $n,m\in \mathbb{N}$, we study two classes of large random matrices of the form $$ \mathcal{L}_n =\sum_{\alpha=1}^m\xi_\alpha \mathbf{y}_\alpha \mathbf{y}_\alpha ^T\quad\text{and}\quad \mathcal{A}_n =\sum_{\alpha =1}^m\xi_\alpha…

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

We obtain sharp asymptotic estimates on the number of $n \times n$ contingency tables with two linear margins $Cn$ and $BCn$. The results imply a second order phase transition on the number of such contingency tables, with a critical value…

Consider an n by n matrix x_ij, and consider the quantity || x_{i,pi(i)} ||_X where X is a symmetric sequence space as a random variable where the permutation pi is chosen randomly. This was considered by Kwapien and Schutt, and we extend…

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

Let $0\leq q\leq1$ and $\mathbb{N}$ denotes the set of all positive integers. In this paper we will deal with it too the family $\mathcal{U}(x^q)$ of all regularly distributed set $X \subset \mathbb{N}$ whose ratio block sequence is…

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

This paper studies the tail probability of weighted sums of the form $\sum_{i=1}^n c_i X_i$, where random variables $X_i$'s are either independent or pairwise quasi-asymptotical independent with heavy tails. Using $h$-insensitive function,…

We derive the mean eigenvalue density for symmetric Gaussian random N x N matrices in the limit of large N, with a constraint implying that the row sum of matrix elements should vanish. The result is shown to be equivalent to a result found…

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…

Spectral properties of Hermitian Toeplitz, Hankel, and Toeplitz-plus-Hankel random matrices with independent identically distributed entries are investigated. Combining numerical and analytic arguments it is demonstrated that spectral…

The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…