Two-component genetic switch as a synthetic module with tunable stability.

Despite stochastic fluctuations, some genetic switches are able to retain their expression states through multiple cell divisions, providing epigenetic memory. We propose a novel rationale for tuning the functional stability of a simple synthetic gene switch through protein dimerization. Introducing an approximation scheme to access long-time stochastic dynamics of multiple-component gene circuits, we find that the spontaneous switching rate may exhibit greater than 8 orders of magnitude variation. The manipulation of the circuit's biochemical properties offers a practical strategy for designing robust epigenetic memory with synthetic circuits.

Dynamics of information access on the web.

While current studies on complex networks focus on systems that change relatively slowly in time, the structure of the most visited regions of the web is altered at the time scale from hours to days. Here we investigate the dynamics of visitation of a major news portal, representing the prototype for such a rapidly evolving network. The nodes of the network can be classified into stable nodes, which form the time-independent skeleton of the portal, and news documents. The visitations of the two node classes are markedly different, the skeleton acquiring visits at a constant rate, while a news document's visitation peaks after a few hours. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power-law distribution, in contrast to the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, our results document the fleeting quality of news and events: while fifteen minutes of fame is still an exaggeration in the online media, we find that access to most news items significantly decays after 36 hours of posting.

Statistics of weighted treelike networks.

We study the statistics of growing networks with a tree topology in which each link carries a weight (k(i) k(j))(theta) , where k(i) and k(j) are the node degrees at the end points of link ij . Network growth is governed by preferential attachment in which a newly added node attaches to a node of degree k with rate A(k) =k+lambda . For general values of theta and lambda , we compute the total weight of a network as a function of the number of nodes N and the distribution of link weights. Generically, the total weight grows as N for lambda>theta-1 and superlinearly otherwise. The link weight distribution is predicted to have a power-law form that is modified by a logarithmic correction for the case lambda=0 . We also determine the node strength, defined as the sum of the weights of the links that attach to the node, as function of k . Using known results for degree correlations, we deduce the scaling of the node strength on k and N .

Global organization of metabolic fluxes in the bacterium Escherichia coli.

Cellular metabolism, the integrated interconversion of thousands of metabolic substrates through enzyme-catalysed biochemical reactions, is the most investigated complex intracellular web of molecular interactions. Although the topological organization of individual reactions into metabolic networks is well understood, the principles that govern their global functional use under different growth conditions raise many unanswered questions. By implementing a flux balance analysis of the metabolism of Escherichia coli strain MG1655, here we show that network use is highly uneven. Whereas most metabolic reactions have low fluxes, the overall activity of the metabolism is dominated by several reactions with very high fluxes. E. coli responds to changes in growth conditions by reorganizing the rates of selected fluxes predominantly within this high-flux backbone. This behaviour probably represents a universal feature of metabolic activity in all cells, with potential implications for metabolic engineering.

Scaling properties of random walks on small-world networks.

Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These properties include the average number of distinct sites visited by the random walker, the mean-square displacement of the walker, and the distribution of first-return times. The scaling form has three characteristic time regimes. At short times, the walker does not see the small-world shortcuts and effectively probes an ordinary Euclidean network in d dimensions. At intermediate times, the properties of the walker shows scaling behavior characteristic of an infinite small-world network. Finally, at long times, the finite size of the network becomes important, and many of the properties of the walker saturate. We propose general analytical forms for the scaling properties in all three regimes, and show that these analytical forms are consistent with our numerical simulations.

Characterizing the structure of small-world networks.

We give exact relations for small-world networks (SWN's) which are independent of the "degree distribution," i.e., the distribution of nearest-neighbor connections. For the original SWN model, we illustrate how these exact relations can be used to obtain approximations for the corresponding basic probability distribution. In the limit of large system sizes and small disorder, we use numerical studies to obtain a functional fit for this distribution. Finally, we obtain the scaling properties for the mean-square displacement of a random walker, which are determined by the scaling behavior of the underlying SWN.

Exact results and scaling properties of small-world networks

We study the distribution function for minimal paths in small-world networks. We derive its general form, which we verify numerically, and also discuss its scaling properties. Using the general form of this distribution function, we derive exact expressions for the average minimal distance &lmacr; and its variance sigma(2). Finally, we study the limit of large system sizes and obtain some approximate results.