Related papers: The Limiting Eigenvalue Distribution of Iterated k…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
In this manuscript, we study the limiting distribution for the joint law of the largest and the smallest singular values for random circulant matrices with generating sequence given by independent and identically distributed random elements…
This paper proposes a unified approach that enables the Wishart distribution to be studied simultaneously in the real, complex, quaternion and octonion cases. In particular, the noncentral generalised Wishart distribution, the joint density…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
In Hazra, den Hollander and Parvaneh (2025) we analysed the friendship paradox for sparse random graphs. For four classes of random graphs we characterised the empirical distribution of the friendship biases between vertices and their…
The Gaussian and Laguerre orthogonal ensembles are fundamental to random matrix theory, and the marginal eigenvalue distributions are basic observable quantities. Notwithstanding a long history, a formulation providing high precision…
We derive conditions on the products of stochastic matrices guaranteeing the existence of a unique limit invariant distribution. Belying our approach is the hereby defined notion of restricted triangulated Laman graphs. The main idea is the…
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…
We consider a square random matrix of size N of the form A + Y where A is deterministic and Y has iid entries with variance 1/N. Under mild assumptions, as N grows, the empirical distribution of the eigenvalues of A+Y converges weakly to a…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…
The ability to estimate joint, conditional and marginal probability distributions over some set of variables is of great utility for many common machine learning tasks. However, estimating these distributions can be challenging,…
In this paper, we find and prove that, under some conditions, the embedding distributions of $H$-linear graph families with spiders are asymptotic normal distributions. It can been seen a version of central limit theorem in topological…
We introduce a new class of identifiable DAG models where the conditional distribution of each node given its parents belongs to a family of generalized hypergeometric distributions (GHD). A family of generalized hypergeometric…
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
Inhomogeneous Erd\H{o}s-R\'enyi random graphs $\mathbb G_N$ on $N$ vertices in the non-dense regime are considered in this paper. The edge between the pair of vertices $\{i,j\}$ is retained with probability…
A probabilistic generative network model with $n$ nodes and $m$ overlapping layers is obtained as a superposition of $m$ mutually independent Bernoulli random graphs of varying size and strength. When $n$ and $m$ are large and of the same…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…