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...

We have studied the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from one ward to another. Remarkably the in-strength and in-degree distribution tail is a power law with exponent...

In this work, we consider the topological analysis of symbolic formal systems in the framework of network theory. In particular, we analyse the network extracted by Principia Mathematica of B. Russell and A.N. Whitehead, where the vertices are the statements and two statements are connected 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 show that a cut-and-paste model to mimic a trial-and-error process of adaptation displays two pairs of percolation and depinning transitions, one for persistence and the other for efficiency. The percolation transition signals the onset of a property and the depinning transition, the growth...

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...

Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the probability distributions evolve to a stationary power law...

We study self-organized models for information transmission and herd behavior in financial markets. Existing models are generalized to take into account the effect of size-dependent fragmentation and coagulation probabilities of groups of agents and to include a demand process. Non-universal...

Two models for random graph formation are introduced that use a set of vertices with an associated set of vectors. A random process determines whether edges will be formed or clusters of connected vertices destroyed: edge-formation between vertices with similar vectors is preferred, and cluster...