Learn More
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites that link to earlier sites with a probability A(k) which depends on the number of preexisting links k to that site. For homogeneous connection kernels, A(k) approximately k(gamma), different behaviors arise for(More)
The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A(k). When A(k) grows more slowly than linearly with k, the number of nodes with k links, N(k)(t), decays faster than a power law in k, while(More)
We investigate a very simple model describing the evolution of protein-protein interaction networks via duplication and divergence. The model exhibits a remarkably rich behavior depending on a single parameter, the probability to retain a duplicated link during divergence. When this parameter is large, the network growth is not self-averaging and an average(More)
Synthetic biomolecular spiders with "legs" made of single-stranded segments of DNA can move on a surface which is also covered by single-stranded segments of DNA complementary to the leg DNA. In experimental realizations, when a leg detaches from a segment of the surface for the first time it alters that segment, and legs subsequently bind to these altered(More)
We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad--a triangular loop with one or three unfriendly links--is reversed to make the triad balanced. With this dynamics, an infinite network undergoes(More)
We introduce a two-state opinion dynamics model where agents evolve by majority rule. In each update, a group of agents is specified whose members then all adopt the local majority state. In the mean-field limit, where a group consists of randomly selected agents, consensus is reached in a time that scales ln(N, where N is the number of agents. On(More)
We study the low-temperature coarsening of an Ising chain subject to spin-exchange dynamics and a small driving force. This dynamical system reduces to a domain diffusion process, in which entire domains undergo nearest-neighbor hopping, except for the shortest domains-dimers-which undergo long-range hopping. This system exhibits anomalous ordering dynamics(More)
We study dynamical ordering of rods. In this process, rod alignment via pairwise interactions competes with diffusive wiggling. Under strong diffusion, the system is disordered, but at weak diffusion, the system is ordered. We present an exact steady-state solution for the nonlinear and nonlocal kinetic theory of this process. We find the Fourier transform(More)
The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree). The network is built by (i) creation of new nodes which each immediately attach to a preexisting node, and (ii) creation of new links between preexisting nodes. This process(More)