4,220 research outputs found

    Stability of Localized Wave Fronts in Bistable Systems

    Get PDF
    Localized wave fronts are a fundamental feature of biological systems from cell biology to ecology. Here, we study a broad class of bistable models subject to self-activation, degradation, and spatially inhomogeneous activating agents. We determine the conditions under which wave-front localization is possible and analyze the stability thereof with respect to extrinsic perturbations and internal noise. It is found that stability is enhanced upon regulating a positional signal and, surprisingly, also for a low degree of binding cooperativity. We further show a contrasting impact of self-activation to the stability of these two sources of destabilization. DOI: 10.1103/PhysRevLett.110.03810

    Extinction in Lotka-Volterra model

    Full text link
    Competitive birth-death processes often exhibit an oscillatory behavior. We investigate a particular case where the oscillation cycles are marginally stable on the mean-field level. An iconic example of such a system is the Lotka-Volterra model of predator-prey competition. Fluctuation effects due to discreteness of the populations destroy the mean-field stability and eventually drive the system toward extinction of one or both species. We show that the corresponding extinction time scales as a certain power-law of the population sizes. This behavior should be contrasted with the extinction of models stable in the mean-field approximation. In the latter case the extinction time scales exponentially with size.Comment: 11 pages, 17 figure

    Unconventional feeds for small ruminants in dry areas have a minor effect on manure nitrogen flow in the soil-plant system

    Get PDF
    In dry areas, unconventional feeds are increasingly used for mitigating feed shortages and rangeland degradation. We evaluated how feeding sheep diets containing olive leaves, saltbush leaves and olive cake affects manure quality compared to a barley straw based diet. Soil incubation and plant growth experiments were carried out to measure soil nitrogen (N) mineralization and N uptake by barley plants and to calculate N flow through the feed-animal-soil-plant system. Fresh feces, composts consisting of feces, urine and straw, and ammonium sulfate fertilizer were mixed with soil at rate of 90mgNkg−1 soil dry matter. Comparisons were made with non-amended soils (control) and soils amended with fresh olive cake applied at 90 and 22.5mgNkg−1 soil dry matter, respectively. The latter treatment enabled investigation of the effect of passage of olive cake through the digestive tract of sheep on N availability and phenol transformation. Applying fresh olive cake and feces, except the saltbush leaf derived feces, resulted in a net N immobilization. All composts resulted in net N mineralization, although not significantly different from the 0N control soil. Barley growing in soils with amendment that caused N immobilization took up less N than barley growing on the 0N treatment. Reduction in N uptake was most pronounced after amendment with fresh-olive cake. Treatments with net mineralization increased barley N uptake over the 0N treatment with 2-16% of N applied being taken up. Dietary composition had a minor effect on N fertilizer value of either feces or compost, but feces N alone was not an efficient N sourc

    Partitioning Complex Networks via Size-constrained Clustering

    Full text link
    The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting size-constrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the size-constrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm's configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis

    Effects of aging and links removal on epidemic dynamics in scale-free networks

    Full text link
    We study the combined effects of aging and links removal on epidemic dynamics in the Barab\'{a}si-Albert scale-free networks. The epidemic is described by a susceptible-infected-refractory (SIR) model. The aging effect of a node introduced at time tit_{i} is described by an aging factor of the form (tti)β(t-t_{i})^{-\beta} in the probability of being connected to newly added nodes in a growing network under the preferential attachment scheme based on popularity of the existing nodes. SIR dynamics is studied in networks with a fraction 1p1-p of the links removed. Extensive numerical simulations reveal that there exists a threshold pcp_{c} such that for ppcp \geq p_{c}, epidemic breaks out in the network. For p<pcp < p_{c}, only a local spread results. The dependence of pcp_{c} on β\beta is studied in detail. The function pc(β)p_{c}(\beta) separates the space formed by β\beta and pp into regions corresponding to local and global spreads, respectively.Comment: 8 pages, 3 figures, revtex, corrected Ref.[11
    corecore