Cities and regions in Britain through hierarchical percolation

Urban systems present hierarchical structures at many different scales. These are observed as administrative regional delimitations which are the outcome of complex geographical, political and historical processes which leave almost indelible footprints on infrastructure such as the street network. In this work, we uncover a set of hierarchies in Britain at different scales using percolation theory on the street network and on its intersections which are the primary points of interaction and urban agglomeration. At the larger scales, the observed hierarchical structures can be interpreted as regional fractures of Britain, observed in various forms, from natural boundaries, such as National Parks, to regional divisions based on social class and wealth such as the well-known North-South divide. At smaller scales, cities are generated through recursive percolations on each of the emerging regional clusters. We examine the evolution of the morphology of the system as a whole, by measuring the fractal dimension of the clusters at each distance threshold in the percolation. We observe that this reaches a maximum plateau at a specific distance. The clusters defined at this distance threshold are in excellent correspondence with the boundaries of cities recovered from satellite images, and from previous methods using population density.

Multifractal to monofractal evolution of the London street network

We perform a multifractal analysis of the evolution of London's street network from 1786 to 2010. First, we show that a single fractal dimension, commonly associated with the morphological description of cities, does not suffice to capture the dynamics of the system. Instead, for a proper characterization of such a dynamics, the multifractal spectrum needs to be considered. Our analysis reveals that London evolves from an inhomogeneous fractal structure, which can be described in terms of a multifractal, to a homogeneous one, which converges to monofractality. We argue that London's multifractal to monofractal evolution might be a special outcome of the constraint imposed on its growth by a green belt. Through a series of simulations, we show that multifractal objects, constructed through diffusion limited aggregation, evolve toward monofractality if their growth is constrained by a nonpermeable boundary.

On the problem of boundaries and scaling for urban street networks

Urban morphology has presented significant intellectual challenges to mathematicians and physicists ever since the eighteenth century, when Euler first explored the famous Königsberg bridges problem. Many important regularities and scaling laws have been observed in urban studies, including Zipf's law and Gibrat's law, rendering cities attractive systems for analysis within statistical physics. Nevertheless, a broad consensus on how cities and their boundaries are defined is still lacking. Applying an elementary clustering technique to the street intersection space, we show that growth curves for the maximum cluster size of the largest cities in the UK and in California collapse to a single curve, namely the logistic. Subsequently, by introducing the concept of the condensation threshold, we show that natural boundaries of cities can be well defined in a universal way. This allows us to study and discuss systematically some of the regularities that are present in cities. We show that some scaling laws present consistent behaviour in space and time, thus suggesting the presence of common principles at the basis of the evolution of urban systems.

Exploring the evolution of London's street network in the information space: a dual approach

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

Limited urban growth: London's street network dynamics since the 18th century

We investigate the growth dynamics of Greater London defined by the administrative boundary of the Greater London Authority, based on the evolution of its street network during the last two centuries. This is done by employing a unique dataset, consisting of the planar graph representation of nine time slices of Greater London's road network spanning 224 years, from 1786 to 2010. Within this time-frame, we address the concept of the metropolitan area or city in physical terms, in that urban evolution reveals observable transitions in the distribution of relevant geometrical properties. Given that London has a hard boundary enforced by its long standing green belt, we show that its street network dynamics can be described as a fractal space-filling phenomena up to a capacitated limit, whence its growth can be predicted with a striking level of accuracy. This observation is confirmed by the analytical calculation of key topological properties of the planar graph, such as the topological growth of the network and its average connectivity. This study thus represents an example of a strong violation of Gibrat's law. In particular, we are able to show analytically how London evolves from a more loop-like structure, typical of planned cities, toward a more tree-like structure, typical of self-organized cities. These observations are relevant to the discourse on sustainable urban planning with respect to the control of urban sprawl in many large cities which have developed under the conditions of spatial constraints imposed by green belts and hard urban boundaries.

Gravity versus radiation models: on the importance of scale and heterogeneity in commuting flows

We test the recently introduced radiation model against the gravity model for the system composed of England and Wales, both for commuting patterns and for public transportation flows. The analysis is performed both at macroscopic scales, i.e., at the national scale, and at microscopic scales, i.e., at the city level. It is shown that the thermodynamic limit assumption for the original radiation model significantly underestimates the commuting flows for large cities. We then generalize the radiation model, introducing the correct normalization factor for finite systems. We show that even if the gravity model has a better overall performance the parameter-free radiation model gives competitive results, especially for large scales.

Extracting directed information flow networks: an application to genetics and semantics

We introduce a general method to infer the directional information flow between populations whose elements are described by n-dimensional vectors of symbolic attributes. The method is based on the Jensen-Shannon divergence and on the Shannon entropy and has a wide range of application. We show here the results of two applications: first we extract the network of genetic flow between meadows of the seagrass Poseidonia oceanica, where the meadow elements are specified by sets of microsatellite markers, and then we extract the semantic flow network from a set of Wikipedia pages, showing the semantic channels between different areas of knowledge.

Network properties of written human language

We investigate the nature of written human language within the framework of complex network theory. In particular, we analyze the topology of Orwell's "1984" focusing on the local properties of the network, such as the properties of the nearest neighbors and the clustering coefficient. We find a composite power law behavior for both the average nearest neighbor's degree and average clustering coefficient as a function of the vertex degree. This implies the existence of different functional classes of vertices. Furthermore, we find that the second order vertex correlations are an essential component of the network architecture. To model our empirical results we extend a previously introduced model for language due to Dorogovtsev and Mendes. We propose an accelerated growing network model that contains three growth mechanisms: linear preferential attachment, local preferential attachment, and the random growth of a predetermined small finite subset of initial vertices. We find that with these elementary stochastic rules we are able to produce a network showing syntacticlike structures.