Related papers: Dynamics of exponential linear map in functional s…

We study a coupled nonlinear evolution system arising from the Ginzburg-Landau theory for atomic Fermi gases near the BCS-BEC crossover. First, we prove that the initial boundary value problem generates a strongly continuous semigroup on a…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

Population structure can be modelled by evolutionary graphs, which can have a substantial, but very subtle influence on the fate of the arising mutants. Individuals are located on the nodes of these graphs, competing with each other to…

In stochastic evolutionary dynamics, the replacement of an existing genotype or cultural trait by a newly introduced mutant is typically characterized by the quantities of fixation probability and fixation time. But in a structured…

The sensitivity of trajectories over finite time intervals t to perturbations of the initial conditions can be associated with a finite-time Lyapunov exponent lambda, obtained from the elements M_{ij} of the stability matrix M. For globally…

Natural microbial populations often have complex spatial structures. This can impact their evolution, in particular the ability of mutants to take over. While mutant fixation probabilities are known to be unaffected by sufficiently…

In this paper we study dynamical systems generated by a gonosomal evolution operator of a bisexual population. We find explicitly all (uncountable set) of fixed points of the operator. It is shown that each fixed point has eigenvalues less…

We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…

We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…

We consider a stochastic process in which independent identically distributed random matrices are multiplied and where the Lyapunov exponent of the product is positive. We continue multiplying the random matrices as long as the norm,…

We employ techniques from optimal transport in order to prove decay of transfer operators associated to iterated functions systems and expanding maps, giving rise to a new proof without requiring a Doeblin-Fortet (or Lasota-Yorke)…

Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…

In this work we introduce the concept of generalized exponential $\mathfrak{D}$-pullback attractor for evolution processes, where $\mathfrak{D}$ is a universe of families in $X$, which is a compact and positively invariant family that…

We establish a large deviation principle (LDP) for probability graphons, which are symmetric functions from the unit square into the space of probability measures. This notion extends classical graphons and provides a flexible framework for…

We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…

For a quantum walk on a graph, there exist many kinds of operators for the discrete-time evolution. We give a general relation between the characteristic polynomial of the evolution matrix of a quantum walk on edges and that of a kind of…

We investigate homeomorphisms of a compact interval, applied randomly. We consider this system as a skew product with the two-sided Bernoulli shift in the base. If on the open interval there is a metric in which almost all maps are…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

The Moran process, as studied by [Lieberman, E., Hauert, C. and Nowak, M. Evolutionary dynamics on graphs. Nature 433, pp. 312-316 (2005)], is a stochastic process modeling the spread of genetic mutations in populations. In this process,…

In this paper we present, in the context of Diaconis' paradigm, a general method to detect the cutoff phenomenon. We use this method to prove cutoff in a variety of models, some already known and others not yet appeared in literature,…