Related papers: Deformed Gaussian Orthogonal Ensemble description …
In modern statistics, interests shift from pursuing the uniformly minimum variance unbiased estimator to reducing mean squared error (MSE) or residual squared error. Shrinkage based estimation and regression methods offer better prediction…
Introducing sets of constraints, we define new classes of random-matrix ensembles, the constrained Gaussian unitary (CGUE) and the deformed Gaussian unitary (DGUE) ensembles. The latter interpolate between the GUE and the CGUE. We derive a…
Diffusion-based generative models use stochastic differential equations (SDEs) and their equivalent ordinary differential equations (ODEs) to establish a smooth connection between a complex data distribution and a tractable prior…
We study the distribution of the largest eigenvalue in the "Pfaffian" classical ensembles of random matrix theory, namely in the Gaussian orthogonal (GOE) and Gaussian symplectic (GSE) ensembles, using semi-classical skew-orthogonal…
We study the fluctuations of eigenvalues from a class of Wigner random matrices that generalize the Gaussian orthogonal ensemble. We begin by considering an $n \times n$ matrix from the Gaussian orthogonal ensemble (GOE) or Gaussian…
We investigate spectral fluctuations in multilayer networks within the random matrix theory (RMT) framework to characterize universal and non-universal features. The adjacency matrix of a multilayer network exhibits a block structure, with…
Random ordinary differential equations (RODEs), i.e. ODEs with random parameters, are often used to model complex dynamics. Most existing methods to identify unknown governing RODEs from observed data often rely on strong prior knowledge.…
It is shown that the families of generalized matrix ensembles recently considered which give rise to an orthogonal invariant stable L\'{e}vy ensemble can be generated by the simple procedure of dividing Gaussian matrices by a random…
We investigate equilibrium properties of small world networks, in which both connectivity and spin variables are dynamic, using replicated transfer matrices within the replica symmetric approximation. Population dynamics techniques allow us…
Attention has been brought to the possibility that statistical fluctuation properties of several complex spectra, or, well-known number sequences may display strong signatures that the Hamiltonian yielding them as eigenvalues is…
Stochastic networks based on random point sets as nodes have attracted considerable interest in many applications, particularly in communication networks, including wireless sensor networks, peer-to-peer networks and so on. The study of…
Understanding equilibration times in closed quantum systems is essential for characterising their approach to equilibrium. Chaotic many-body systems are paradigmatic in this context: they are expected to thermalise according to the…
Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic…
Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without…
We focus on the problem of estimating the change in the dependency structures of two $p$-dimensional Gaussian Graphical models (GGMs). Previous studies for sparse change estimation in GGMs involve expensive and difficult non-smooth…
In the context of wireless networking, it was recently shown that multiple DNNs can be jointly trained to offer a desired collaborative behaviour capable of coping with a broad range of sensing uncertainties. In particular, it was…
Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $…
Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…
We study the decrease of fluctuations of diagonal matrix elements of observables and of Husimi densities of quantum mechanical wave functions around their mean value upon approaching the semi-classical regime ($\hbar \rightarrow 0$). The…
Gaussian smoothing (GS) is a derivative-free optimization (DFO) algorithm that estimates the gradient of an objective using perturbations of the current parameters sampled from a standard normal distribution. We generalize it to sampling…