Related papers: Aggregation with constant kernel under stochastic …
The discrete collisional breakage equation, which captures the dynamics of cluster growth when clusters encounter binary collisions with possible matter transfer, is discussed in this article. The existence of global mass-conserving…
We solve the standard Lifshitz-Slyozov (LS) model with conservation of total particles in the limit of small super-saturation. The new element is an effective initial condition that follows from the initial exhaustion of nucleation as…
We use statistical mechanics to study model-based Bayesian data clustering. In this approach, each partition of the data into clusters is regarded as a microscopic system state, the negative data log-likelihood gives the energy of each…
Reservoir Computing is a class of Recurrent Neural Networks with internal weights fixed at random. Stability relates to the sensitivity of the network state to perturbations. It is an important property in Reservoir Computing as it directly…
Resetting is a renewal mechanism in which a process is intermittently repeated after a random or fixed time. This simple act of stop and repeat profoundly influences the behaviour of a system as exemplified by the emergence of…
We develop kernel criteria for the likelihood-ratio, hazard-rate, usual stochastic, and relative log-concavity orders in parametric families of univariate probability laws with densities. The score is the derivative of the log density with…
We propose an efficient and fast numerical algorithm of finding a \emph{stationary} solution of large systems of aggregation-fragmentation equations of Smoluchowski type for concentrations of reacting particles. This method is applicable…
The paper considers nonparametric kernel density/regression estimation from a stochastic optimization point of view. The estimation problem is represented through a family of stochastic optimization problems. Recursive constrained…
We propose a model of mass-conserving heterogeneous nucleation to describe the dynamics of ligand-receptor binding in closed cellular compartments. When the ligand dissociation rate is small, competition among receptors for free ligands…
An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…
This study proposes a data condensation method for multivariate kernel density estimation by genetic algorithm. First, our proposed algorithm generates multiple subsamples of a given size with replacement from the original sample. The…
In the past few years, stochastic resetting has become a subject of immense interest. Most of the theoretical studies so far focused on instantaneous resetting which is, however, a major impediment to practical realization or experimental…
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,…
Consider a stationary renewal point process on the real line and divide each of the segments it defines in a proportion given by \iid realisations of a fixed distribution $G$ supported by [0,1]. We ask ourselves for which interpoint…
We consider the Larkin model of a directed polymer with Gaussian-distributed random forces, with the addition of a resetting process whereby the transverse position of the end-point of the polymer is reset to zero with constant rate $r$. We…
Binary Neural Network (BNN) represents convolution weights with 1-bit values, which enhances the efficiency of storage and computation. This paper is motivated by a previously revealed phenomenon that the binary kernels in successful BNNs…
We investigate two-dimensional crystal assemblies formed by a binary mixture of colloidal particles with a size ratio of 0.88 and driven by short-ranged depletion interactions. Our experiments show that the orientational order of the…
Binary aggregation is known to lead, under certain kinetic rules, to the coexistence of two populations, one consisting of finite-size clusters (sol), and one that contains a single cluster that carries a finite fraction of the total mass…
This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients…
A wide range of phenomena in the natural and social sciences involve large systems of interacting particles, including plasmas, collections of galaxies, coupled oscillators, cell aggregations, and economic ``agents'. Kinetic methods for…