107 research outputs found

    Self-organization of heterogeneous topology and symmetry breaking in networks with adaptive thresholds and rewiring

    Full text link
    We study an evolutionary algorithm that locally adapts thresholds and wiring in Random Threshold Networks, based on measurements of a dynamical order parameter. A control parameter pp determines the probability of threshold adaptations vs. link rewiring. For any p<1p < 1, we find spontaneous symmetry breaking into a new class of self-organized networks, characterized by a much higher average connectivity Kˉevo\bar{K}_{evo} than networks without threshold adaptation (p=1p =1). While Kˉevo\bar{K}_{evo} and evolved out-degree distributions are independent from pp for p<1p <1, in-degree distributions become broader when p→1p \to 1, approaching a power-law. In this limit, time scale separation between threshold adaptions and rewiring also leads to strong correlations between thresholds and in-degree. Finally, evidence is presented that networks converge to self-organized criticality for large NN.Comment: 4 pages revtex, 6 figure

    Scale-free networks are not robust under neutral evolution

    Full text link
    Recently it has been shown that a large variety of different networks have power-law (scale-free) distributions of connectivities. We investigate the robustness of such a distribution in discrete threshold networks under neutral evolution. The guiding principle for this is robustness in the resulting phenotype. The numerical results show that a power-law distribution is not stable under such an evolution, and the network approaches a homogeneous form where the overall distribution of connectivities is given by a Poisson distribution.Comment: Submitted for publicatio

    Self-organized critical neural networks

    Full text link
    A mechanism for self-organization of the degree of connectivity in model neural networks is studied. Network connectivity is regulated locally on the basis of an order parameter of the global dynamics which is estimated from an observable at the single synapse level. This principle is studied in a two-dimensional neural network with randomly wired asymmetric weights. In this class of networks, network connectivity is closely related to a phase transition between ordered and disordered dynamics. A slow topology change is imposed on the network through a local rewiring rule motivated by activity-dependent synaptic development: Neighbor neurons whose activity is correlated, on average develop a new connection while uncorrelated neighbors tend to disconnect. As a result, robust self-organization of the network towards the order disorder transition occurs. Convergence is independent of initial conditions, robust against thermal noise, and does not require fine tuning of parameters.Comment: 5 pages RevTeX, 7 figures PostScrip

    Fractal structures in systems made of small magnetic particles

    Get PDF
    This article was published in the journal, Physical Review B [© American Physical Society]. It is also available at: http://link.aps.org/abstract/PRB/v72/e014433.We have found that in a system consisting of small magnetic particles a phenomenon related to the formation of fractal structures may arise. The fractal features may arise not only in the distribution of magnetic moments but also in their energy spectrum. The magnetization and the susceptibility of the system also display fractal characteristics. The multiple structures are associated with exponentially many locally stable minima in a highly complex energy landscape. The signature of these fractal structures can be experimentally detected by various methods

    Topological Evolution of Dynamical Networks: Global Criticality from Local Dynamics

    Full text link
    We evolve network topology of an asymmetrically connected threshold network by a simple local rewiring rule: quiet nodes grow links, active nodes lose links. This leads to convergence of the average connectivity of the network towards the critical value Kc=2K_c =2 in the limit of large system size NN. How this principle could generate self-organization in natural complex systems is discussed for two examples: neural networks and regulatory networks in the genome.Comment: 4 pages RevTeX, 4 figures PostScript, revised versio

    Secondary organic aerosol formation from photooxidation of naphthalene and alkylnaphthalenes: implications for oxidation of intermediate volatility organic compounds (IVOCs)

    Get PDF
    Current atmospheric models do not include secondary organic aerosol (SOA) production from gas-phase reactions of polycyclic aromatic hydrocarbons (PAHs). Recent studies have shown that primary emissions undergo oxidation in the gas phase, leading to SOA formation. This opens the possibility that low-volatility gas-phase precursors are a potentially large source of SOA. In this work, SOA formation from gas-phase photooxidation of naphthalene, 1-methylnaphthalene (1-MN), 2-methylnaphthalene (2- MN), and 1,2-dimethylnaphthalene (1,2-DMN) is studied in the Caltech dual 28-m^3 chambers. Under high-NO_x conditions and aerosol mass loadings between 10 and 40μgm^(−3), the SOA yields (mass of SOA per mass of hydrocarbon reacted) ranged from 0.19 to 0.30 for naphthalene, 0.19 to 0.39 for 1-MN, 0.26 to 0.45 for 2-MN, and constant at 0.31 for 1,2-DMN. Under low-NO_x conditions, the SOA yields were measured to be 0.73, 0.68, and 0.58, for naphthalene, 1- MN, and 2-MN, respectively. The SOA was observed to be semivolatile under high-NO_x conditions and essentially nonvolatile under low-NO_x conditions, owing to the higher fraction of ring-retaining products formed under low-NO_x conditions. When applying these measured yields to estimate SOA formation from primary emissions of diesel engines and wood burning, PAHs are estimated to yield 3–5 times more SOA than light aromatic compounds over photooxidation timescales of less than 12 h. PAHs can also account for up to 54% of the total SOA from oxidation of diesel emissions, representing a potentially large source of urban SOA

    Surface spin-flop transition in a uniaxial antiferromagnetic Fe/Cr superlattice induced by a magnetic field of arbitrary direction

    Full text link
    We studied the transition between the antiferromagnetic and the surface spin-flop phases of a uniaxial antiferromagnetic [Fe(14 \AA)/Cr(11 \AA]x20_{\rm x20} superlattice. For external fields applied parallel to the in-plane easy axis, the layer-by-layer configuration, calculated in the framework of a mean-field one-dimensional model, was benchmarked against published polarized neutron reflectivity data. For an in-plane field HH applied at an angle ψ≠0\psi \ne 0 with the easy axis, magnetometry shows that the magnetization MM vanishes at H=0, then increases slowly with increasing HH. At a critical value of HH, a finite jump in M(H)M(H) is observed for ψ<5o\psi<5^{\rm o}, while a smooth increase of MM vsvs HH is found for ψ>5o\psi>5^{\rm o}. A dramatic increase in the full width at half maximum of the magnetic susceptibility is observed for ψ≥5o\psi \ge 5^{\rm o}. The phase diagram obtained from micromagnetic calculations displays a first-order transition to a surface spin-flop phase for low ψ\psi values, while the transition becomes continuous for ψ\psi greater than a critical angle, ψmax≈4.75o\psi_{\rm max} \approx 4.75^{\rm o}. This is in fair agreement with the experimentally observed results.Comment: 24 pages, 7 figure

    Boolean Dynamics with Random Couplings

    Full text link
    This paper reviews a class of generic dissipative dynamical systems called N-K models. In these models, the dynamics of N elements, defined as Boolean variables, develop step by step, clocked by a discrete time variable. Each of the N Boolean elements at a given time is given a value which depends upon K elements in the previous time step. We review the work of many authors on the behavior of the models, looking particularly at the structure and lengths of their cycles, the sizes of their basins of attraction, and the flow of information through the systems. In the limit of infinite N, there is a phase transition between a chaotic and an ordered phase, with a critical phase in between. We argue that the behavior of this system depends significantly on the topology of the network connections. If the elements are placed upon a lattice with dimension d, the system shows correlations related to the standard percolation or directed percolation phase transition on such a lattice. On the other hand, a very different behavior is seen in the Kauffman net in which all spins are equally likely to be coupled to a given spin. In this situation, coupling loops are mostly suppressed, and the behavior of the system is much more like that of a mean field theory. We also describe possible applications of the models to, for example, genetic networks, cell differentiation, evolution, democracy in social systems and neural networks.Comment: 69 pages, 16 figures, Submitted to Springer Applied Mathematical Sciences Serie

    Most Networks in Wagner's Model Are Cycling

    Get PDF
    In this paper we study a model of gene networks introduced by Andreas Wagner in the 1990s that has been used extensively to study the evolution of mutational robustness. We investigate a range of model features and parameters and evaluate the extent to which they influence the probability that a random gene network will produce a fixed point steady state expression pattern. There are many different types of models used in the literature, (discrete/continuous, sparse/dense, small/large network) and we attempt to put some order into this diversity, motivated by the fact that many properties are qualitatively the same in all the models. Our main result is that random networks in all models give rise to cyclic behavior more often than fixed points. And although periodic orbits seem to dominate network dynamics, they are usually considered unstable and not allowed to survive in previous evolutionary studies. Defining stability as the probability of fixed points, we show that the stability distribution of these networks is highly robust to changes in its parameters. We also find sparser networks to be more stable, which may help to explain why they seem to be favored by evolution. We have unified several disconnected previous studies of this class of models under the framework of stability, in a way that had not been systematically explored before
    • …
    corecore