We introduce a minimal generative model for densifying networks in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability p. The networks that emerge from this copying mechanism are sparse for p<1/2 and dense (average degree increasing with number of nodes N) for p≥1/2. The behavior in the dense regime is especially rich; for example, individual network realizations that are built by copying are disparate and not self-averaging. Further, there is an infinite sequence of structural anomalies at p=2/3, 3/4, 4/5, etc., where the N dependences of the number of triangles (3-cliques), 4-cliques, undergo phase transitions. When linking to second neighbors of the target can occur, the prob...
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-f...
We introduce a collection of complex networks generated by a combination of preferential attachment ...
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real...
We introduce a growing network model, the copying model, in which a new node attaches to a randomly ...
Node copying is an important mechanism for network formation, yet most models assume uniform copying...
Preferential attachment is a popular model of growing networks. We consider a generalized ...
Two preferential attachment-type graph models which allow for dynamic addition/deletion of edges/ver...
Abstract. We present a new model for self-organizing networks such as the web graph, and analyze its...
An important problem in modeling networks is how to generate a randomly sampled graph with given deg...
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, a...
AbstractThis paper focuses on the degree sequence of a random graph process with copying and vertex ...
Analysis of degree-degree dependencies in complex networks, and their impact on processes on network...
In this paper a discrete-time dynamic random graph process is studied that interleaves the birth of ...
The configuration model generates random graphs with any given degree distribution, and thus serves ...
In order to explore further the underlying mechanism of scale-free networks, we study stochastic sec...
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-f...
We introduce a collection of complex networks generated by a combination of preferential attachment ...
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real...
We introduce a growing network model, the copying model, in which a new node attaches to a randomly ...
Node copying is an important mechanism for network formation, yet most models assume uniform copying...
Preferential attachment is a popular model of growing networks. We consider a generalized ...
Two preferential attachment-type graph models which allow for dynamic addition/deletion of edges/ver...
Abstract. We present a new model for self-organizing networks such as the web graph, and analyze its...
An important problem in modeling networks is how to generate a randomly sampled graph with given deg...
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, a...
AbstractThis paper focuses on the degree sequence of a random graph process with copying and vertex ...
Analysis of degree-degree dependencies in complex networks, and their impact on processes on network...
In this paper a discrete-time dynamic random graph process is studied that interleaves the birth of ...
The configuration model generates random graphs with any given degree distribution, and thus serves ...
In order to explore further the underlying mechanism of scale-free networks, we study stochastic sec...
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-f...
We introduce a collection of complex networks generated by a combination of preferential attachment ...
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real...