Related papers: On the Convergence of Population Protocols When Po…
We consider a solution of automata similar to Population Protocols and Network Constructors. The automata (or nodes) move passively in a well-mixed solution and can cooperate by interacting in pairs. Every such interaction may result in an…
A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…
In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allows us to design a self-stabilizing protocol for such problems. In…
People counting system in crowded places has become a very useful practical application that can be accomplished in various ways which include many traditional methods using sensors. Examining the case of real time scenarios, the algorithm…
Estimates of population size for hidden and hard-to-reach individuals are of particular interest to health officials when health problems are concentrated in such populations. Efforts to derive these estimates are often frustrated by a…
The {\em parallel time} of a population protocol is defined as the average number of required interactions that an agent in the protocol participates, i.e., the quotient between the total number of interactions required by the protocol and…
We discuss two cases that can be connected to the dynamics of interacting populations: (I.) density waves for the case or negligible random fluctuations of the populations densities, and (II.) probability distributions connected to the…
Scaling has been proposed as a powerful tool to analyze the properties of complex systems, and in particular for cities where it describes how various properties change with population. The empirical study of scaling on a wide range of…
This article studies the quasi-stationary behaviour of population processes with unbounded absorption rate, including one-dimensional birth and death processes with catastrophes and multi-dimensional birth and death processes, modeling…
We consider excursions for a class of stochastic processes describing a population of discrete individuals experiencing density-limited growth, such that the population has a finite carrying capacity and behaves qualitatively like the…
Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…
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…
Superlinear scaling in cities, which appears in sociological quantities such as economic productivity and creative output relative to urban population size, has been observed but not been given a satisfactory theoretical explanation. Here…
Motivated by the wide range of known self-replicating systems, some far from genetics, we study a system composed by individuals having an internal dynamics with many possible states that are partially stable, with varying mutation rates.…
Sensory processing is often characterized as implementing probabilistic inference: networks of neurons compute posterior beliefs over unobserved causes given the sensory inputs. How these beliefs are computed and represented by neural…
The principle of maximum entropy provides a useful method for inferring statistical mechanics models from observations in correlated systems, and is widely used in a variety of fields where accurate data are available. While the assumptions…
We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
Population-based evolutionary algorithms (EAs) have been widely applied to solve various optimization problems. The question of how the performance of a population-based EA depends on the population size arises naturally. The performance of…
The aim of this paper is to tackle part of the program set by Diekmann et al. in their seminal paper Diekmann et al. (2001). We quote "It remains to investigate whether, and in what sense, the nonlinear determin-istic model formulation is…