Related papers: Universality in the spectral and eigenfunction pro…
Finding graph indices which are unbiased to network size and density is of high importance both within a given field and across fields for enhancing comparability of modern network science studies. The degree variance is an important metric…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
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…
We study the statistical and dynamic properties of the systems characterized by an ultrametric space of states and translationary non-invariant symmetric transition matrices of the Parisi type subjected to "locally constant" randomization.…
We delve into the statistical properties of regions within complex networks that are distant from vertices with high centralities, such as hubs or highly connected clusters. These remote regions play a pivotal role in shaping the asymptotic…
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks…
Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…
We consider the universality of the nearest neighbour eigenvalue spacing distribution in invariant random matrix ensembles. Focussing on orthogonal and symplectic invariant ensembles, we show that the empirical spacing distribution…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
Given an $n \times n$ complex matrix $A$, let $$\mu_{A}(x,y):= \frac{1}{n} |\{1\le i \le n, \Re \lambda_i \le x, \Im \lambda_i \le y\}|$$ be the empirical spectral distribution (ESD) of its eigenvalues $\lambda_i \in \BBC, i=1, ... n$. We…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
The universality phenomenon asserts that the distribution of the eigenvalues of random matrix with i.i.d. zero mean, unit variance entries does not depend on the underlying structure of the random entries. For example, a plot of the…
In the current work we are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. When $\Omega=[0,1]$, such graphs include the standard Toeplitz…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
We derive an expression for the nearest-neighbor spacing distribution $P(s)$ of the energy levels of quantum systems with intermediate dynamics between regularity and chaos and missing levels due to random experimental errors. The…
We define a new measure of network symmetry that is capable of capturing approximate global symmetries of networks. We apply this measure to different networks sampled from several classic network models, as well as several real-world…
We consider a sequence of random Hamiltonians $H_n(h,\sigma)=\sum^n_{i=1}h_i(\sigma_i-m)$, and study the asymptotic ($n\to \infty$) distribution of the energy levels $(H_n(h,\sigma))_{\sigma\in \{-1,1\}^n}$, where $h_1,h_2,\cdots$ are…
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\'enyi networks, based on recursion equations for the shells around a reference node and for the paths originating from…
Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction…