The {\it{eigenvector empirical spectral distribution}} (VESD) is a useful tool in studying the limiting behavior of eigenvalues and eigenvectors of covariance matrices. In this paper, we study the convergence rate of the VESD of sample covariance matrices to the deformed Mar{\v c}enko-Pastur (MP) distribution. Consider sample covariance matrices of the form $\Sigma^{1/2} X X^* \Sigma^{1/2}$, where $X=(x_{ij})$ is an $M\times N$ random matrix whose entries are independent random variables with mean zero and variance $N^{-1}$, and $\Sigma$ is a deterministic positive-definite matrix. We prove that the Kolmogorov distance between the {\it{expected VESD}} and the deformed MP distribution is bounded by $N^{-1+\epsilon}$ for any fixed $\epsilon>0$, provided that the entries $\sqrt{N}x_{ij}$ have uniformly bounded 6th moments and $|N/M-1|\ge \tau$ for some constant $\tau>0$. This result improves the previous one obtained in [44], which gave the convergence rate $O(N^{-1/2})$ assuming $i.i.d.$ $X$ entries, bounded 10th moment, $\Sigma=I$ and $M<N$. Moreover, we also prove that under the finite $8$th moment assumption, the convergence rate of the VESD is $O(N^{-1/2+\epsilon})$ almost surely for any fixed $\epsilon>0$, which improves the previous bound $N^{-1/4+\epsilon}$ in [44].

Consider an age-dependent, single-species branching process defined by a progeny number distribution, and a lifetime distribution associated with each independent particle. In this paper, we focus on the associated inverse problem where one wishes to formally solve for the progeny number distribution or the lifetime distribution that defines the Bellman-Harris branching process. We derive results for the existence and uniqueness (the identifiability) of these two distributions given one of two types of information: the extinction time probability of the entire process (extinction time distribution), or the distribution of the total number of particles at one fixed time. We demonstrate that perfect knowledge of the distribution of extinction times allows us to formally determine either the progeny number distribution or the lifetime distribution. Furthermore, we show that these constructions are unique. We then consider “data” consisting of a perfectly known total number distribution given at one specific time. For a process with known progeny number distribution and exponentially distributed lifetimes, we show that the rate parameter is identifiable. For general lifetime distributions, we also show that the progeny distribution is globally unique. Our results are presented through four theorems, each describing the constructions in the four distinct cases.

We prove that uniform random quadrangulations of the sphere with$n$faces, endowed with the usual graph distance and renormalized by$n$^{−1/4}, converge as$n$→$∞$in distribution for the Gromov–Hausdorff topology to a limiting metric space. We validate a conjecture by Le Gall, by showing that the limit is (up to a scale constant) the so-called$Brownian map$, which was introduced by Marckert–Mokkadem and Le Gall as the most natural candidate for the scaling limit of many models of random plane maps. The proof relies strongly on the concept of$geodesic stars$in the map, which are configurations made of several geodesics that only share a common endpoint and do not meet elsewhere.

We develop a generic game platform that can be used to model various real-world systems with multiple intelligent cloud-computing pools and parallel-queues for resources-competing users. Inside the platform, the software structure is modelled as Blockchain. All the users are associated with Big Data arrival streams whose random dynamics is modelled by triply stochastic renewal reward processes (TSRRPs). Each user may be served simultaneously by multiple pools while each pool with parallel- servers may also serve multi-users at the same time via smart policies in the Blockchain, e.g. a Nash equilibrium point myopically at each fixed time to a game-theoretic scheduling problem. To illustrate the effectiveness of our game platform, we model the performance measures of its internal data flow dynamics (queue length and workload processes) as reflecting diffusion with regime-switchings (RDRSs) under our scheduling policies. By RDRS models, we can prove our myopic game-theoretic policy to be an asymptotic Pareto minimal-dual-cost Nash equilibrium one globally over the whole time horizon to a randomly evolving dynamic game problem. Iterative schemes for simulating our multi-dimensional RDRS models are also developed with the support of numerical comparisons.

In this paper we prove the universality of covariance matrices of the form $H_{Ntimes N}={X}^{dagger}X$ where $X$ is an ${Mtimes N}$ rectangular matrix with independent real valued entries $x_{ij}$ satisfying $mathbb{E}x_{ij}=0$ and $mathbb{E}x^2_{ij}={frac{1}{M}}$, $N$, $Mto infty$. Furthermore it is assumed that these entries have sub-exponential tails or sufficiently high number of moments. We will study the asymptotics in the regime $N/M=d_Nin(0,infty),lim_{Ntoinfty}d_Nneq0,infty$. Our main result is the edge universality of the sample covariance matrix at both edges of the spectrum. In the case $lim_{Ntoinfty}d_N=1$, we only focus on the largest eigenvalue. Our proof is based on a novel version of the Green function comparison theorem for data matrices with dependent entries. En route to proving edge universality, we establish that the Stieltjes transform of the empirical eigenvalue distribution of $H$ is given by the Marcenko-Pastur law uniformly up to the edges of the spectrum with an error of order $(Neta)^{-1}$ where $eta$ is the imaginary part of the spectral parameter in the Stieltjes transform. Combining these results with existing techniques we also show bulk universality of covariance matrices. All our results hold for both real and complex valued entries.