Related papers: Disordered ensembles of random matrices
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 the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
Assessing whether a given network is typical or atypical for a random-network ensemble (i.e., network-ensemble comparison) has widespread applications ranging from null-model selection and hypothesis testing to clustering and classifying…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We introduce a new class of sparse sequences that are ergodic and pointwise universally $L^2$-good for ergodic averages. That is, sequences along which the ergodic averages converge almost surely to the projection to invariant functions.…
We investigate the properties of sparse matrix ensembles with particular regard for the spectral ergodicity hypothesis, which claims the identity of ensemble and spectral averages of spectral correlators. An apparent violation of the…
Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian, we introduce two families of discrete matrix models constructed both with the help of the Erdos-Renyi ensemble of random graphs. Corresponding matrix sums…
Exponential-family Random Graph Models (ERGMs) constitute a large statistical framework for modeling sparse and dense random graphs, short- and long-tailed degree distributions, covariates, and a wide range of complex dependencies. Special…
Let $F$ be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution $F$ are described and compared. Two methods are based on the so…
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through…
We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…
Let $\mathbb{R}^N_+= [0,\infty)^N$. We here consider a class of random fields $(X_t)_{t\in \mathbb{R}^N_+}$ which are known as Multiparameter L\'evy processes. Related multiparameter semigroups of operators and their generators are…
We consider eigenvectors of the Hamiltonian $H_0$ perturbed by a generic perturbation $V$ modelled by a random matrix from the Gaussian Unitary Ensemble (GUE). Using the supersymmetry approach we derive analytical results for the statistics…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
A statistical description of part of a many body system often requires a non-Hermitian random matrix ensemble with nature and strength of randomness sensitive to underlying system conditions. For the ensemble to be a good description of the…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
High-order structures have been recognised as suitable models for systems going beyond the binary relationships for which graph models are appropriate. Despite their importance and surge in research on these structures, their random cases…
The study of spectral behavior of networks has gained enthusiasm over the last few years. In particular, Random Matrix Theory (RMT) concepts have proven to be useful. In discussing transition from regular behavior to fully chaotic behavior…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…