Search results for "complex"
showing 10 items of 5889 documents
Random Logistic Maps II. The Critical Case
2003
Let (X n )∞ 0 be a Markov chain with state space S=[0,1] generated by the iteration of i.i.d. random logistic maps, i.e., X n+1=C n+1 X n (1−X n ),n≥0, where (C n )∞ 1 are i.i.d. random variables with values in [0, 4] and independent of X 0. In the critical case, i.e., when E(log C 1)=0, Athreya and Dai(2) have shown that X n → P 0. In this paper it is shown that if P(C 1=1)<1 and E(log C 1)=0 then (i) X n does not go to zero with probability one (w.p.1) and in fact, there exists a 0<β<1 and a countable set ▵⊂(0,1) such that for all x∈A≔(0,1)∖▵, P x (X n ≥β for infinitely many n≥1)=1, where P x stands for the probability distribution of (X n )∞ 0 with X 0=x w.p.1. A is a closed set for (X n…
Entropic descriptor of a complex behaviour
2009
We propose a new type of entropic descriptor that is able to quantify the statistical complexity (a measure of complex behaviour) by taking simultaneously into account the average departures of a system's entropy S from both its maximum possible value Smax and its minimum possible value Smin. When these two departures are similar to each other, the statistical complexity is maximal. We apply the new concept to the variability, over a range of length scales, of spatial or grey-level pattern arrangements in simple models. The pertinent results confirm the fact that a highly non-trivial, length-scale dependence of the entropic descriptor makes it an adequate complexity-measure, able to disting…
Stochastic dynamics of leukemic cells under an intermittent targeted therapy
2009
The evolutionary dynamics of cancerous cell populations in a model of Chronic Myeloid Leukemia (CML) is investigated in the presence of an intermittent targeted therapy. Cancer development and progression is modeled by simulating the stochastic evolution of initially healthy cells which can experience genetic mutations and modify their reproductive behavior, becoming leukemic clones. Front line therapy for the treatment of patients affected by CML is based on the administration of tyrosine kinase inhibitors, namely imatinib (Gleevec) or, more recently, dasatinib or nilotinib. Despite the fact that they represent the first example of a successful molecular targeted therapy, the development o…
The Role of a Second Reservoir in an Open BCS Model
2005
In this paper we use the stochastic limit approach (SLA) in order to analyze some generalized versions of the open BCS model first introduced by Buffet and Martin and recently analyzed by the author using the SLA. In particular, considering different models, we discuss the role of a second reservoir interacting with the first one (but not with the system) in the computation of the critical temperature corresponding to the transition from a normal to a superconducting phase.
Estimating the decomposition of predictive information in multivariate systems
2015
In the study of complex systems from observed multivariate time series, insight into the evolution of one system may be under investigation, which can be explained by the information storage of the system and the information transfer from other interacting systems. We present a framework for the model-free estimation of information storage and information transfer computed as the terms composing the predictive information about the target of a multivariate dynamical process. The approach tackles the curse of dimensionality employing a nonuniform embedding scheme that selects progressively, among the past components of the multivariate process, only those that contribute most, in terms of co…
Algorithms and tools for protein-protein interaction networks clustering, with a special focus on population-based stochastic methods
2014
Abstract Motivation: Protein–protein interaction (PPI) networks are powerful models to represent the pairwise protein interactions of the organisms. Clustering PPI networks can be useful for isolating groups of interacting proteins that participate in the same biological processes or that perform together specific biological functions. Evolutionary orthologies can be inferred this way, as well as functions and properties of yet uncharacterized proteins. Results: We present an overview of the main state-of-the-art clustering methods that have been applied to PPI networks over the past decade. We distinguish five specific categories of approaches, describe and compare their main features and …
Community detection algorithm evaluation with ground-truth data
2018
International audience; Community structure is of paramount importance for the understanding of complex networks. Consequently, there is a tremendous effort in order to develop efficient community detection algorithms. Unfortunately, the issue of a fair assessment of these algorithms is a thriving open question. If the ground-truth community structure is available, various clustering-based metrics are used in order to compare it versus the one discovered by these algorithms. However, these metrics defined at the node level are fairly insensitive to the variation of the overall community structure. To overcome these limitations, we propose to exploit the topological features of the ‘communit…
Step-by-Step Control of the Dynamics of a Superconducting QED-like System
2007
We discuss the modus operandi of a theoretical scalable coupling scheme to control step by step the time evolution of a pair of flux qubits embedded in a lossy resonant cavity. The sequential interaction of each qubit with the quantized cavity mode is controlled by externally applied magnetic fluxes. Our analysis indicates that indirect qubit-qubit interactions, with the electromagnetic mode acting as a data bus, can be selectively performed and exploited both for the implementation of entangling gates and for the generation of states with a priori known characteristics.
Statistical inference and Monte Carlo algorithms
1996
This review article looks at a small part of the picture of the interrelationship between statistical theory and computational algorithms, especially the Gibbs sampler and the Accept-Reject algorithm. We pay particular attention to how the methodologies affect and complement each other.
Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?
2011
The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …