Related papers: Spectral transitions in networks
We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
We study the reduced energy spectrum $\{E_{i}^{(n)}\}$, which is constructed by picking one level from every $n$ levels of the original spectrum $\{E_{i}\}$, in a Gaussian ensemble of random matrix with Dyson index $\beta\in \left( 0,\infty…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand…
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently…
We introduce an exponential random graph model for networks with a fixed degree distribution and with a tunable degree-degree correlation. We then investigate the nature of a percolation transition in the correlated network with the Poisson…
The following random graph model was introduced for the evolution of protein-protein interaction networks: Let $\mathcal G = (G_n)_{n=n_0, n_0+1,...}$ be a sequence of random graphs, where $G_n = (V_n, E_n)$ is a graph with $|V_n|=n$…
Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erd\H{o}s-R\'{e}nyi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-\lambda}$, where $k$ is…
Using the finite-size scaling, we have investigated the percolation phase transitions of evolving random networks under a generalized Achlioptas process (GAP). During this GAP, the edge with minimum product of two connecting cluster sizes…
Networks that are fragmented into small disconnected components are prevalent in a large variety of systems. These include the secure communication networks of commercial enterprises, government agencies and illicit organizations, as well…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We present a solution of the problem of level-set percolation for multivariate Gaussians defined in terms of weighted graph Laplacians on complex networks. It is achieved using a cavity or message passing approach, which allows one to…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…
We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…
The statistical distribution of levels of an integrable system is claimed to be a Poisson distribution. In this paper, we numerically generate an ensemble of N dimensional random diagonal matrices as a model for regular systems. We evaluate…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…