RESUMEN
We investigate the basin of attraction properties and its boundaries for chimera states in a circulant network of Hénon maps. It is known that coexisting basins of attraction lead to a hysteretic behaviour in the diagrams of the density of states as a function of a varying parameter. Chimera states, for which coherent and incoherent domains occur simultaneously, emerge as a consequence of the coexistence of basin of attractions for each state. Consequently, the distribution of chimera states can remain invariant by a parameter change, and it can also suffer subtle changes when one of the basins ceases to exist. A similar phenomenon is observed when perturbations are applied in the initial conditions. By means of the uncertainty exponent, we characterise the basin boundaries between the coherent and chimera states, and between the incoherent and chimera states. This way, we show that the density of chimera states can be not only moderately sensitive but also highly sensitive to initial conditions. This chimera's dilemma is a consequence of the fractal and riddled nature of the basin boundaries.
RESUMEN
Robust adaptation is a critical ability of gene regulatory network (GRN) to survive in a fluctuating environment, which represents the system responding to an input stimulus rapidly and then returning to its pre-stimulus steady state timely. In this paper, the GRN is modeled using the Michaelis-Menten rate equations, which are highly nonlinear differential equations containing 12 undetermined parameters. The robust adaption is quantitatively described by two conflicting indices. To identify the parameter sets in order to confer the GRNs with robust adaptation is a multi-variable, multi-objective, and multi-peak optimization problem, which is difficult to acquire satisfactory solutions especially high-quality solutions. A new best-neighbor particle swarm optimization algorithm is proposed to implement this task. The proposed algorithm employs a Latin hypercube sampling method to generate the initial population. The particle crossover operation and elitist preservation strategy are also used in the proposed algorithm. The simulation results revealed that the proposed algorithm could identify multiple solutions in one time running. Moreover, it demonstrated a superior performance as compared to the previous methods in the sense of detecting more high-quality solutions within an acceptable time. The proposed methodology, owing to its universality and simplicity, is useful for providing the guidance to design GRN with superior robust adaptation.
Asunto(s)
Redes Reguladoras de Genes , Modelos Genéticos , Algoritmos , Simulación por Computador , Interpretación Estadística de Datos , CinéticaRESUMEN
In this work we investigate a mathematical model describing tumour growth under a treatment by chemotherapy that incorporates time-delay related to the conversion from resting to hunting cells. We study the model using values for the parameters according to experimental results and vary some parameters relevant to the treatment of cancer. We find that our model exhibits a dynamical behaviour associated with the suppression of cancer cells, when either continuous or pulsed chemotherapy is applied according to clinical protocols, for a large range of relevant parameters. When the chemotherapy is successful, the predation coefficient of the chemotherapic agent acting on cancer cells varies with the infusion rate of chemotherapy according to an inverse relation. Finally, our model was able to reproduce the experimental results obtained by Michor and collaborators [Nature 435 (2005) 1267] about the exponential decline of cancer cells when patients are treated with the drug glivec.