Related papers: A population evolution model and its applications …
Computer modelling for evolutionary systems consists in: 1) to store in the memory the individual features of each member of a large population; and 2) to update the whole system repeatedly, as time goes by, according to some prescribed…
The collection of data on populations of networks is becoming increasingly common, where each data point can be seen as a realisation of a network-valued random variable. A canonical example is that of brain networks: a typical neuroimaging…
We show that the resolution of social dilemmas on random graphs and scale-free networks is facilitated by imitating not the strategy of better performing players but rather their emotions. We assume sympathy and envy as the two emotions…
We consider a random graph model evolving in discrete time-steps that is based on 3-interactions among vertices. Triangles, edges and vertices have different weights; objects with larger weight are more likely to participate in future…
We are interested in the study of models describing the evolution of a polymorphic population with mutation and selection in the specific scales of the biological framework of adaptive dynamics. The population size is assumed to be large…
This paper presents an evolution model of weighted networks in which the structural growth and weight dynamics are driven by human behavior, i.e. passenger route choice behavior. Transportation networks grow due to people's increasing…
Evolutionary games are a developing sub-field of game theory. This branch of game theory is used in the study of the adaptation of large, but finite, populations of agents to changes in the environment. It assumes that each agent has no…
Frequency dependent selection and demographic fluctuations play important roles in evolutionary and ecological processes. Under frequency dependent selection, the average fitness of the population may increase or decrease based on…
A general multi-type population model is considered, where individuals live and reproduce according to their age and type, but also under the influence of the size and composition of the entire population. We describe the dynamics of the…
We study the evolution of preferences in multi-population settings that allow matches across distinct populations. Each individual has subjective preferences over potential outcomes, and chooses a best response based on his preferences and…
We present the distance matrix evolution for different types of networks: exponential, scale-free and classical random ones. Statistical properties of these matrices are discussed as well as topological features of the networks. Numerical…
We extend our study of a simple model of biological coevolution to its statistical properties. Staring with a complete description in terms of a master equation, we provide its relation to the deterministic evolution equations used in…
Population stratification is a problem encountered in several areas of biology and public health. We tackle this problem by mapping a population and its elements attributes into a hypergraph, a natural extension of the concept of graph or…
We study a mathematical model to describe the evolution of a city, which is determined by the interaction of two large populations of agents, workers and firms. The map of the city is described by a network with the edges representing at…
This paper presents a statistically sound method for using likelihood to assess potential models of network evolution. The method is tested on data from five real networks. Data from the internet autonomous system network, from two photo…
We model the evolution of the Internet at the Autonomous System level as a process of competition for users and adaptation of bandwidth capability. We find the exponent of the degree distribution as a simple function of the growth rates of…
We study a class of evolution models, where the breeding process involves an arbitrary exchangeable process, allowing for mutations to appear. The population size $n$ is fixed, hence after breeding, selection is applied. Individuals are…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
This manuscript introduces a new analytical approach for studying the time evolution of disease spread on a finite size network. Our methodology can accommodate any disease with a general infectivity profile. This new approach is able to…
We study the statistical properties of the generation of random graphs according the configuration model, where one assigns randomly degrees to nodes. This model is often used, e.g., for the scale-free degree distribution ~d^gamma. For the…