We consider reflector imaging in a weakly random waveguide. We address the situation in which the source is farther from the reflector to be imaged than the energy equipartition distance, but the receiver array is closer to the reflector to be imaged than the energy equipartition distance. As a consequence, the reflector is illuminated by a partially coherent field and the signals recorded by the receiver array are noisy. This paper shows that migration of the recorded signals cannot give a good image, but an appropriate migration of the cross correlations of the recorded signals can give a very good image. The resolution and stability analysis of this original functional shows that the reflector can be localized with an accuracy of the order of the wavelength even when the receiver array has small aperture, and that broadband sources are necessary to ensure statistical stability, whatever the aperture of the array.

Loewner’s equation provides a way to encode a simply connected domain or equivalently its uniformizing conformal map via a real-valued driving function of its boundary. The first main result of the present paper is that the Dirichlet energy of this driving function (also known as the Loewner energy) is equal to the Dirichlet energy of the log-derivative of the (appropriately defined) uniformizing conformal map. This description of the Loewner energy then enables to tie direct links with regularized determinants and Teichmüller theory: We show that for smooth simple loops, the Loewner energy can be expressed in terms of the zeta-regularized determinants of a certain Neumann jump operator. We also show that the family of finite Loewner energy loops coincides with the Weil–Petersson class of quasicircles, and that the Loewner energy equals to a multiple of the universal Liouville action introduced by Takhtajan and Teo, which is a Kähler potential for the Weil–Petersson metric on the Weil–Petersson Teichmüller space.

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.

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.

We consider an elliptic pseudo-differential equation with a highly oscillating linear potential modeled as a stationary ergodic random field. The random field is a function composed with a centered long-range correlated Gaussian process. In the limiting of vanishing correlation length, the heterogeneous solution converges to a deterministic solution obtained by averaging the random potential. We characterize the deterministic and stochastic correctors. With proper rescaling, the mean-zero stochastic corrector converges to a Gaussian random process in probability and weakly in the spatial variables. In addition, for two prototype equations involving the Laplacian and the fractional Laplacian operators, we prove that the limit holds in distribution in some Hilbert spaces. We also determine the size of the deterministic corrector when it is larger than the stochastic corrector. Depending on the correlation structure of the random field and on the singularities of the Green’s function, we show that either the deterministic or the random part of the corrector dominates.