Related papers: Fixation probability in Moran-like Processes on gr…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
Moran Birth-death process is a standard stochastic process that is used to model natural selection in spatially structured populations. A newly occurring mutation that invades a population of residents can either fixate on the whole…
We consider the problem of solving TAP mean field equations by iteration for Ising model with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical…
Agent-based stochastic models for finite populations have recently received much attention in the game theory of evolutionary dynamics. Both the ultimate fixation and the pre-fixation transient behavior are important to a full understanding…
We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…
Evolution occurs in populations of reproducing individuals. In stochastic descriptions of evolutionary dynamics, such as the Moran process, individuals are chosen randomly for birth and for death. If the same type is chosen for both steps,…
A new statistical approach is presented to study the thermal instability process of optically thin unmagnetized plasma. In this approach the time evolution of mass distribution function over temperature is calculated. This function…
Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate $r$ which invades a population of residents. We say that the fixation…
We provide a new derivation of the conditions of dynamical and thermodynamical stability of homogeneous and inhomogeneous isothermal distributions in the Hamiltonian Mean Field (HMF) model. This proof completes the original thermodynamical…
We study two of the simple rules on finite graphs under the death-birth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502-505]. Each rule specifies a payoff-ratio cutoff point for…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We extend the general stochastic matching model on graphs introduced in (Mairesse and Moyal, 2016), to matching models on multigraphs, that is, graphs with self-loops. The evolution of the model can be described by a discrete time Markov…
We introduce a general Bayesian framework for graph matching grounded in a new theory of exchangeable random permutations. Leveraging the cycle representation of permutations and the literature on exchangeable random partitions, we define,…
A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field. Belief propagation, an iterative message-passing algorithm, computes exactly such…
Motivated by the question of the impact of selective advantage in populations with skewed reproduction mechanims, we study a Moran model with selection. We assume that there are two types of individuals, where the reproductive success of…
We propose a model for evolutionary game dynamics with three strategies $A$, $B$ and $C$ in the framework of Moran process in finite populations. The model can be described as a stochastic process which can be numerically computed from a…
In this paper, we aim at characterizing generalized functionals of discrete-time normal martingales. Let $M=(M_n)_{n\in \mathbb{N}}$ be a discrete-time normal martingale that has the chaotic representation property. We first construct…
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…
In the past years, a remarkable mapping has been found between the dynamics of a population of M individuals undergoing random mutations and selection, and that of a single system in contact with a thermal bath with temperature 1/M. This…
The earlier times of evolution of a magnetic system contain more information than we can imagine. Capturing correlation matrices G of different time evolutions of a simple testbed spin system, as the Ising model, we analyzed the density of…