arXiv subjects

Pierre Collet

Publications and source records attributed to Pierre Collet.

At least 37 records · Page 2Linked to original sources

arXiv2012

Chains of infinite order, chains with memory of variable length, and maps of the interval

We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order. In particular we caracterize the maps corresponding to stochastic chains with memory of variable length. The problem treated here is the converse of the classical construction of the Gibbs formalism for Markov expanding maps of the interval.

math.PR↗

arXiv2012

Stochastic models for a chemostat and long time behavior

We introduce two stochastic chemostat models consisting in a coupled population-nutrient process reflecting the interaction between the nutrient and the bacterias in the chemostat with finite volume. The nutrient concentration evolves continuously but depending on the population size, while the population size is a birth and death process with coefficients depending on time through the nutrient concentration. The nutrient is shared by the bacteria and creates a regulation of the bacterial population size. The latter and the fluctuations due to the random births and deaths of individuals make the population go almost surely to extinction. Therefore, we are interested in the long time behavior of the bacterial population conditioned to the non-extinction. We prove the global existence of the process and its almost sure extinction. The existence of quasi-stationary distributions is obtained based on a general fixed point argument. Moreover, we prove the absolute continuity of the nutrient distribution when conditioned to a fixed number of individuals and the smoothness of the corresponding densities.

math.PR↗

arXiv2012

Trees of nuclei and bounds on the number of triangulations of the 3-ball

Based on the work of Durhuus-J{ó}nsson and Benedetti-Ziegler, we revisit the question of the number of triangulations of the 3-ball. We introduce a notion of nucleus (a triangulation of the 3-ball without internal nodes, and with each internal face having at most 1 external edge). We show that every triangulation can be built from trees of nuclei. This leads to a new reformulation of Gromov's question: We show that if the number of rooted nuclei with $t$ tetrahedra has a bound of the form $C^t$, then the number of rooted triangulations with $t$ tetrahedra is bounded by $C_*^t$.

math-ph↗

arXiv2011

A rigorous model study of the adaptative dynamics of Mendelian diploids

Adaptive dynamics so far has been put on a rigorous footing only for clonal inheritance. We extend this to sexually reproducing diploids, although admittedly still under the restriction of an unstructured population with Lotka-Volterra-like dynamics and single locus genetics (as in Kimura's 1965 infinite allele model). We prove under the usual smoothness assumptions, starting from a stochastic birth and death process model, that, when advantageous mutations are rare and mutational steps are not too large, the population behaves on the mutational time scale (the 'long' time scale of the literature on the genetical foundations of ESS theory) as a jump process moving between homozygous states (the trait substitution sequence of the adaptive dynamics literature). Essential technical ingredients are a rigorous estimate for the probability of invasion in a dynamic diploid population, a rigorous, geometric singular perturbation theory based, invasion implies substitution theorem, and the use of the Skorohod $M_1$ topology to arrive at a functional convergence result. In the small mutational steps limit this process in turn gives rise to a differential equation in allele or in phenotype space of a type referred to in the adaptive dynamics literature as 'canonical equation'.

math.PR↗

arXiv2011

Linear Amplifier Breakdown and Concentration Properties of a Gaussian Field Given that its $\bm{L^2}$-Norm is Large

In the context of linear amplification for systems driven by the square of a Gaussian noise, we investigate the realizations of a Gaussian field in the limit where its $L^2$-norm is large. Concentration onto the eigenspace associated with the largest eigenvalue of the covariance of the field is proved. When the covariance is trace class, the concentration is in probability for the $L^2$-norm. A stronger concentration, in mean for the sup-norm, is proved for a smaller class of Gaussian fields, and an example of a field belonging to that class is given. A possible connection with Bose-Einstein condensation is briefly discussed.

math-ph↗

arXiv2010

Wave localization does not affect the breakdown of a Schrödinger-type amplifier driven by the square of a Gaussian field

We study the divergence of the solution to a Schrödinger-type amplifier driven by the square of a Gaussian noise in presence of a random potential. We follow the same approach as Mounaix, Collet, and Lebowitz (MCL) in terms of a distributional formulation of the amplified field and the use of the Paley-Wiener theorem [Commun. Math. Phys. {\bf 264}, 741-758 (2006) and {\bf 280}, 281-283 (2008)]. Our results show that the divergence is not affected by the random potential, in the sense that it occurs at exactly the same coupling constant as what was found by MCL without a potential. It follows {\it a fortiori} that the breakdown of the amplifier is not affected by the possible existence of a localized regime in the amplification free limit.

math-ph↗

arXiv2010

Nonequilibrium stationary state of a truncated stochastic NLSE: I. Formulation and mean field approximation

We investigate the stationary state of a model system evolving according to a modified focusing truncated nonlinear Schrödinger equation (NLSE) used to describe the envelope of Langmuir waves in a plasma. We restrict the system to have a finite number of normal modes each of which is in contact with a Langevin heat bath at temperature $T$. Arbitrarily large realizations of the field are prevented by restricting each mode to a maximum amplitude. We consider a simple modeling of wave-breaking in which each mode is set equal to zero when it reaches its maximum amplitude. Without wave-breaking the stationary state is given by a Gibbs measure. With wave-breaking the system attains a nonequilibrium stationary state which is the unique invariant measure of the time evolution. A mean field analysis shows that the system exhibits a transition from a regime of low field values at small $|λ|$, to a regime of higher field values at large $|λ|$, where $λ<0$ specifies the strength of the nonlinearity in the focusing case. Field values at large $|λ|$ are significantly smaller with wave-breaking than without wave-breaking.

math-ph↗

arXiv2009

Quasi-stationary distributions for structured birth and death processes with mutations

We study the probabilistic evolution of a birth and death continuous time measure-valued process with mutations and ecological interactions. The individuals are characterized by (phenotypic) traits that take values in a compact metric space. Each individual can die or generate a new individual. The birth and death rates may depend on the environment through the action of the whole population. The offspring can have the same trait or can mutate to a randomly distributed trait. We assume that the population will be extinct almost surely. Our goal is the study, in this infinite dimensional framework, of quasi-stationary distributions when the process is conditioned on non-extinction. We firstly show in this general setting, the existence of quasi-stationary distributions. This result is based on an abstract theorem proving the existence of finite eigenmeasures for some positive operators. We then consider a population with constant birth and death rates per individual and prove that there exists a unique quasi-stationary distribution with maximal exponential decay rate. The proof of uniqueness is based on an absolute continuity property with respect to a reference measure.

math.PR↗

arXiv2009

Note on the Transition to Intermittency for the exponential of the Square of a Steinhaus Series

Intermittency of $\mathcal{E}_N(x,g)=\exp\lbrack g| S_N(x)|^2\rbrack$ as $N\to +\infty$ is investigated on a $d$-dimensional torus $Λ$, when $S_N(x)$ is a finite Steinhaus series of $(2N+1)^d$ terms normalized to $<| S_N(x)|^2> =1$. Assuming ergodicity of $\mathcal{E}_N(x,g)$ as $N\to +\infty$ in the domain $g<1$, where $\lim_{N\to +\infty}<\mathcal{E}_N(g)>$ exists, transition to intermittency is proved as $g$ increases past the threshold $g_{th}=1$. This transition goes together with a transition from (assumed) ergodicity at $g \rbrack^{-1}\int_Λ\mathcal{E}_N(x,g) d^dx=0$ at $g>g_{th}$. In this asymptotic sense one can say that ergodicity is lost as $g$ increases past the value $g=1$.

math-ph↗

arXiv2009

Quasi-stationary distributions and diffusion models in population dynamics

In this paper, we study quasi-stationarity for a large class of Kolmogorov diffusions. The main novelty here is that we allow the drift to go to $- \infty$ at the origin, and the diffusion to have an entrance boundary at $+\infty$. These diffusions arise as images, by a deterministic map, of generalized Feller diffusions, which themselves are obtained as limits of rescaled birth--death processes. Generalized Feller diffusions take nonnegative values and are absorbed at zero in finite time with probability 1. An important example is the logistic Feller diffusion. We give sufficient conditions on the drift near 0 and near $+ \infty$ for the existence of quasi-stationary distributions, as well as rate of convergence in the Yaglom limit and existence of the $Q$-process. We also show that under these conditions, there is exactly one quasi-stationary distribution, and that this distribution attracts all initial distributions under the conditional evolution, if and only if $+\infty$ is an entrance boundary. In particular this gives a sufficient condition for the uniqueness of quasi-stationary distributions. In the proofs spectral theory plays an important role on $L^2$ of the reference measure for the killed process.

math.PR↗

arXiv2008

Superdiffusive Heat Transport in a class of Deterministic One-Dimensional Many-Particle Lorentz gases

We study heat transport in a one-dimensional chain of a finite number $N$ of identical cells, coupled at its boundaries to stochastic particle reservoirs. At the center of each cell, tracer particles collide with fixed scatterers, exchanging momentum. In a recent paper, \cite{CE08}, a spatially continuous version of this model was derived in a scaling regime where the scattering probability of the tracers is $γ\sim1/N$, corresponding to the Grad limit. A Boltzmann type equation describing the transport of heat was obtained. In this paper, we show numerically that the Boltzmann description obtained in \cite{CE08} is indeed a bona fide limit of the particle model. Furthermore, we also study the heat transport of the model when the scattering probability is one, corresponding to deterministic dynamics. At a coarse grained level the model behaves as a persistent random walker with a broad waiting time distribution and strong correlations associated to the deterministic scattering. We show, that, in spite of the absence of global conserved quantities, the model leads to a superdiffusive heat transport.

cond-mat.stat-mech↗

arXiv2008

A Model of Heat Conduction

We define a deterministic ``scattering'' model for heat conduction which is continuous in space, and which has a Boltzmann type flavor, obtained by a closure based on memory loss between collisions. We prove that this model has, for stochastic driving forces at the boundary, close to Maxwellians, a unique non-equilibrium steady state.

math-ph↗

arXiv2007

GUIDE: Unifying Evolutionary Engines through a Graphical User Interface

Many kinds of Evolutionary Algorithms (EAs) have been described in the literature since the last 30 years. However, though most of them share a common structure, no existing software package allows the user to actually shift from one model to another by simply changing a few parameters, e.g. in a single window of a Graphical User Interface. This paper presents GUIDE, a Graphical User Interface for DREAM Experiments that, among other user-friendly features, unifies all kinds of EAs into a single panel, as far as evolution parameters are concerned. Such a window can be used either to ask for one of the well known ready-to-use algorithms, or to very easily explore new combinations that have not yet been studied. Another advantage of grouping all necessary elements to describe virtually all kinds of EAs is that it creates a fantastic pedagogic tool to teach EAs to students and newcomers to the field.

cs.NE↗

arXiv2007

Evolving localizations in reaction-diffusion cellular automata

We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules is required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.

cs.AI↗

arXiv2007

Erratum: Propagation Effects on the Breakdown of a Linear Amplifier Model: Complex-Mass Schrodinger Equation Driven by the Square of a Gaussian Field

The proof of the inequality $λ_{q}(x,t)\le (qμ_{x,t} -0^+)^{-1}$ [p 750, below Eq. (29)] is based on the statement that ${\cal E}(x,t;s)$ is an entire function of $s\in {\mathbb C}^M$ [see below Eq. (30)]. But according to Equation (9) and Lemma 1, all we know is that ${\cal E}(x,t;s)$ is an entire function of $k(s)\in {\mathbb R}^N$. Nevertheless, the above inequality holds, hence the proposition 1.

math-ph↗

arXiv2007

Random perturbations of stochastic chains with unbounded variable length memory

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough.

math.PR↗

arXiv2007

Stochastic Optimization Algorithms

When looking for a solution, deterministic methods have the enormous advantage that they do find global optima. Unfortunately, they are very CPU-intensive, and are useless on untractable NP-hard problems that would require thousands of years for cutting-edge computers to explore. In order to get a result, one needs to revert to stochastic algorithms, that sample the search space without exploring it thoroughly. Such algorithms can find very good results, without any guarantee that the global optimum has been reached; but there is often no other choice than using them. This chapter is a short introduction to the main methods used in stochastic optimization.

cs.NE↗

arXiv2006

Complexity for extended dynamical systems

We consider dynamical systems for which the spatial extension plays an important role. For these systems, the notions of attractor, epsilon-entropy and topological entropy per unit time and volume have been introduced previously. In this paper we use the notion of Kolmogorov complexity to introduce, for extended dynamical systems, a notion of complexity per unit time and volume which plays the same role as the metric entropy for classical dynamical systems. We introduce this notion as an almost sure limit on orbits of the system. Moreover we prove a kind of variational principle for this complexity.

math.DS↗