Related papers: Assortative Exchange Processes
We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We describe algorithms that are a viable compromise and…
We consider a spatial version of the classical Moran model with seed-banks where the constituent populations have finite sizes. Individuals live in colonies labelled by $\mathbb{Z}^d$, $d\geq 1$, playing the role of a geographic space,…
With the recent growth in data availability and complexity, and the associated outburst of elaborate modelling approaches, model selection tools have become a lifeline, providing objective criteria to deal with this increasingly challenging…
We study scaling properties of stochastic aggregation processes in one dimension. Numerical simulations for both diffusive and ballistic transport show that the mass distribution is characterized by two independent nontrivial exponents…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
Extensive numerical simulation are reported for the structure and dynamics of large clusters on metal(100) surfaces. Different types of perimeter hopping processes makes center-of-mass of the cluster to follow a a random walk trajectory.…
We propose a class of evolutionary models that involves an arbitrary exchangeable process as the breeding process and different selection schemes. In those models, a new genome is born according to the breeding process, and then a genome is…
We study a class of growth processes in which clusters evolve via exchange of particles. We show that depending on the rate of exchange there are three possibilities: I) Growth: Clusters grow indefinitely; II) Gelation: All mass is…
Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is…
Non-equilibrium cluster-cluster aggregation of particles diffusing in or at the cell membrane has been hypothesized to lead to domains of finite size in different biological contexts such as lipid rafts, cell adhesion complexes, or…
We study aggregation-fragmentation processes in which pairs of clusters can aggregate, and each cluster can break into two fragments. If the rates of aggregation and fragmentation do not depend on the masses, detailed balance does not hold,…
Stochastic block models (SBMs) are often used to find assortative community structures in networks, such that the probability of connections within communities is higher than in between communities. However, classic SBMs are not limited to…
A microscopic model of adsorption in cluster forming systems with competing interaction is considered. The adsorption process is described by the master equation and modelled by a kinetic Monte Carlo method. The evolution of the particle…
In an earlier paper, we introduced and studied a system of hierarchically interacting measure-valued random processes which describes a large population of individuals carrying types and living in colonies labelled by the hierarchical group…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
Order parameter fluctuations (the largest cluster size distribution) are studied within a three-dimensional bond percolation model on small lattices. Cumulant ratios measuring the fluctuations exhibit distinct features near the percolation…
Bounded rationality refers to the non-optimal rationality of players in non-cooperative games. In a networked game, the bounded rationality of players may be heterogeneous and spatially distributed. It has been shown that the `system…