Related papers: The Expressive Power of Uniform Population Protoco…
We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom.…
In 1975 Chaitin introduced his \Omega number as a concrete example of random real. The real \Omega is defined based on the set of all halting inputs for an optimal prefix-free machine U, which is a universal decoding algorithm used to…
What is a population? This review considers how a population may be defined in terms of understanding the structure of the underlying genetics of the individuals involved. The main approach is to consider statistically identifiable groups…
Consider the setup where $n$ parties are each given a number $x_i \in \mathbb{F}_q$ and the goal is to compute the sum $\sum_i x_i$ in a secure fashion and with as little communication as possible. We study this problem in the anonymized…
The growth function of populations is central in biomathematics. The main dogma is the existence of density dependence mechanisms, which can be modelled with distinct functional forms that depend on the size of the population. One important…
We are interested in the dynamics of a population structured by a phenotypic trait. Individuals reproduce sexually, which is represented by a non-linear integral operator. This operator is combined to a multiplicative operator representing…
This paper presents a mathematical framework for modeling the dynamics of heterogeneous populations. Models describing local and non-local growth and transport processes, dependent on dynamically changing population structures, appear in a…
We propose a computational approach to modeling the collective dynamics of populations of coupled heterogeneous biological oscillators. In contrast to Monte Carlo simulation, this approach utilizes generalized Polynomial Chaos (gPC) to…
We revisit the distributed counting problem, where a server must continuously approximate the total number of events occurring across $k$ sites while minimizing communication. The communication complexity of this problem is known to be…
Multi-objective optimization problems (MOPs) require the simultaneous optimization of conflicting objectives. Real-world MOPs often exhibit complex characteristics, including high-dimensional decision spaces, many objectives, or…
Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is particularly challenging because messages received cannot…
There exists a wide variety of works on the dynamics of large populations ranging from simple heuristic modeling to those based on advanced computer supported methods. Their interconnections, however, remain mostly vague, which…
Many models of population dynamics are formulated as deterministic iterated maps although real populations are stochastic. This is justifiable in the limit of large population sizes, as the stochastic fluctuations are negligible then.…
This paper is concerned with the evolution of haploid organisms that reproduce asexually. In a seminal piece of work, Eigen and coauthors proposed the quasispecies model in an attempt to understand such an evolutionary process. Their work…
In the distributed localization problem (DLP), $n$ anonymous robots (agents) $a_0, a_1, ..., a_{n-1}$ begin at arbitrary positions $p_0, ..., p_{n-1}$ in $S$, where $S$ is an Euclidean space. The primary goal in DLP is for agents to reach a…
We study the drivers and spatial diffusion of U.S. state population growth using a dynamic spatial model for 49 states, 1965-2017. Methodologically, we recover the spatial network structure from the data, rather than imposing it a priori…
The report considers the dynamics of the global population as the unique case of the Socio-Economic Soft Matter system. This category was introduced for complex systems dominated by mesoscale assemblies, emerging due to the inherent…
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…
The goal of this paper is to provide mathematically rigorous tools for modelling the evolution of a community of interacting individuals. We model the population by a measure space where the measure determines the abundance of individual…
Chain of thought is a natural inference-time method for increasing the computational power of transformer-based large language models (LLMs), but comes at the cost of sequential decoding. Are there more efficient alternatives to expand a…