Related papers: Merging costs for the additive Marcus-Lushnikov pr…
We consider the random Euclidean assignment problem on the line between two sets of $N$ random points, independently generated with the same probability density function $\varrho$. The cost of the matching is supposed to be dependent on a…
We consider particles suspended in a randomly stirred or turbulent fluid. When effects of the inertia of the particles are significant, an initially uniform scatter of particles can cluster together. We analyse this 'unmixing' effect by…
We study a simple model for the evolution of the cost (or more generally the performance) of a technology or production process. The technology can be decomposed into $n$ components, each of which interacts with a cluster of $d-1$ other,…
Pairwise distance-based costs are crucial for self-supervised and contrastive feature learning. Mixture Density Networks (MDNs) are a widely used approach for generative models and density approximation, using neural networks to produce…
We consider the Random Euclidean Assignment Problem in dimension $d=1$, with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings…
In this paper, we investigate a stochastic model describing the time evolution of a polymerization process. A polymer is a macro-molecule resulting from the aggregation of several elementary sub-units called monomers. Polymers can grow by…
The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given…
We consider one-dimensional systems of self-gravitating sticky particles with random initial data and describe the process of aggregation in terms of the largest cluster size L_n at any fixed time prior to the critical time. The asymptotic…
Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…
We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual…
Scientific explanation often requires inferring maximally predictive features from a given data set. Unfortunately, the collection of minimal maximally predictive features for most stochastic processes is uncountably infinite. In such…
Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…
We introduce and analyze a novel type of coalescent processes called cross-multiplicative coalescent that models a system with two types of particles, $A$ and $B$. The bonds are formed only between the pairs of particles of opposite types…
The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…
Let $X$ be a finite set and let $G$ be a finite group acting on $X$. The group action splits $X$ into disjoint orbits. The Burnside process is a Markov chain on $X$ which has a uniform stationary distribution when the chain is lumped to…
We analyse an additive-increase and multiplicative-decrease (aka growth-collapse) process that grows linearly in time and that experiences downward jumps at Poisson epochs that are (deterministically) proportional to its present position.…
In this paper, we establish the law of the iterated logarithm for a wide class of non-stationary, continuous-time Markov processes evolving on Polish spaces. Specifically, our result applies to certain additive functionals of processes…
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we…
It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…
We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit…