We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of “splitting” nodes of degree k into k nodes of degree 1. Four networks are considered, each evolves at each time step by either preferential attachment,...

The world-wide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scale-free characteristics. We introduce a...

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information is available display scale-free features. Here we study...