Related papers: From Scale-free to Erdos-Renyi Networks

Scale-free networks are a recently developed approach to model the interactions found in complex natural and man-made systems. Such networks exhibit a power-law distribution of node link (degree) frequencies n(k) in which a small number of…

We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…

Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…

We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…

We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks…

The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…

Two stochastic models are proposed to generate a system composed of two interdependent scale-free (SF) or Erd\H{o}s-R\'{e}nyi (ER) networks where interdependent nodes are connected with exponential or power-law relation, as well as…

We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a…

We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…

This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…

We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert--Barabasi) and classical random ones (Erdos--Renyi) are evaluated. The graph spectra for dense graph…

Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…

It has been recently shown that the percolation transition is discontinuous in Erd\H{o}s-R\'enyi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous…

We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…

We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…

We analyze random networks that change over time. First we analyze a dynamic Erdos-Renyi model, whose edges change over time. We describe its stationary distribution, its convergence thereto, and the SI contact process on the network, which…

Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…

Drawing inspiration from real world interacting systems we study a system consisting of two networks that exhibit antagonistic and dependent interactions. By antagonistic and dependent interactions, we mean, that a proportion of functional…