Skip to content
Review

Local network growth: How simple rules drive network complexity

Aug 2026 · 0 citations
Physics Computer Science

TL;DR

This book shows how citation graphs, the web, social ties, protein interactions, and project schedules all grow themselves from the same handful of local rules -- one local decision at a time.

Abstract

The Internet, a living cell, a circle of friends, a billion-dollar construction project: these systems share almost nothing -- yet, drawn as networks, they look astonishingly alike. Each has a few giant hubs among a multitude of sparsely connected nodes, short paths between any two parts, dense local clustering, communities, and many redundant routes. For two decades such patterns have been credited to"preferential attachment,"the rich getting richer -- a rule that, taken literally, asks every newcomer to survey the whole network before it links. This book makes a simpler case, and defends it one mechanism at a time: the global regularities of real networks are not imposed from above but emerge from purely local rules, in which each new node acts only on a node it has reached and that node's immediate neighbours. A surfer following links, a friend introducing a friend, a gene copied with its connections -- none consults the network as a whole, yet each builds, in the aggregate, the full and unmistakable signature of a real complex system. Written for the curious reader as much as the specialist, with the ideas told in plain language and the mathematics set aside in boxes that can be skipped, it shows how citation graphs, the web, social ties, protein interactions, and project schedules all grow themselves from the same handful of local rules -- one local decision at a time.

View source

Similar papers

Preprint Sep 2026

Measuring the impact of hits

Many real systems can be represented as growing networks where new nodes and links gradually emerge. The Barab\'asi-Albert model for growing networks, and many models inspired by it, are based on the idea that nodes compete for links. However, the strength and the very presence of this competition have not been tested....

M. Medo, L. Rozanova · 0 citations
Preprint Sep 2026

Edge-based Katz centralities for spatio-temporal multiplex networks

Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastica...

Kai Bergermann, Francesco Gravili, V. Simoncini et al. · 0 citations
Preprint Sep 2026

Navigating Small-World Networks with Distance Predictions

Results show that a modest amount of predicted information is enough to accelerate decentralized routing well below Kleinberg's classical bound, and that even when nodes reveal no coordinates at all, reliable delivery remains achievable.

Ladan Kian, M. Tan, Dariusz R. Kowalski · 0 citations
Preprint Aug 2026

Criticality and universality in network dismantling

The proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions, indicating that the physics of network dismantling is insensitive...

L. Cirigliano, Claudio Castellano, Minsuk Kim et al. · 0 citations
Open access Aug 2026

Counting subgraphs in multiplex networks

The MPCount implementation builds on the FaSE algorithm, extending it to accommodate multiplex networks by adapting its efficient enumeration and isomorphism identification process to address the introduced layers, making it an available practical tool for counting subgraphs in multiplex networks.

A. Meira, P. Ribeiro · 0 citations
Preprint Sep 2026

Emergence in Network Systems is Bounded by Boundary-Crossing Paths

Emergence, features of a whole that no part shows alone, is central to complex systems but rarely measured so as to locate its source. Viewing a system structurally, as a network of interacting parts, we evaluate emergence as what observing the coupled whole reveals beyond, or erases from, the combined observations of...

Johnny Jingze Li, Gabriel A. Silva · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.