We have measured the distribution of distances between parked cars in a number of roads in central London. We compare the results with models of random sequential adsorption, or random car parking models, as they are often called. Our empirical results do not agree with these models, and hence...

We discuss various existing models which mimic the herding effect in financial markets and introduce a new model of herding which incorporates both growth and coagulation. In this model, at each time step either (i) with probability p the system grows through the introduction of a new agent or...

Previous studies have suggested that the world-trade network belongs to the class of static hidden variable models. In this article we investigate the microscopic structure of the world trade network, that is the hidden variable correlation matrix of the network. The hidden variable is defined...

We introduce a growing network model which generates both modular and hierarchical structure in a self-organized way. To this end, we modify the Barabási–Albert model into the one evolving under the principles of division and independence as well as growth and preferential attachment (PA). A...

Three models of growing random networks with fitness-dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes of connectivity k and random additive fitness η, with...

We introduce three models of fragmentation in which the largest fragment in the system can be broken at each time step with a fixed probability, p. We solve these models exactly in the long time limit to reveal stable time-invariant (scaling) solutions which depend on p and the precise details...

We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by representing integers as vertices and by drawing cliques between M vertices every time that M distinct integers...