Related papers: Coupling algorithm for calculating sensitivities o…
In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivity is the derivative of the solution to the equation with respect to…
Smoluchowski's equation is a macroscopic description of a many particle system with coagulation and shattering interactions. We give a microscopic model of the system from which we derive this equation rigorously. Provided the existence of…
We show that solutions to Smoluchowski's equation with a constant coagulation kernel and an initial datum with some regularity and exponentially decaying tail converge exponentially fast to a self-similar profile. This convergence holds in…
We introduce a one-dimensional stochastic system where particles perform independent diffusions and interact through pairwise coagulation events, which occur at a nontrivial rate upon collision. Under appropriate conditions on the diffusion…
The processes of simultaneous coagulation and Ostwald ripening of particles in the concluding stage of phase transformation are considered. We solve the integro-differential system of Smoluchowski-type kinetic and mass balance equations…
In this paper we propose a new class of coupling methods for the sensitivity analysis of high dimensional stochastic systems and in particular for lattice Kinetic Monte Carlo. Sensitivity analysis for stochastic systems is typically based…
Researchers have employed variations of the Smoluchowski coagulation equation to model a wide variety of both organic and inorganic phenomena and with relatively few known analytical solutions, numerical solutions play an important role in…
We study a spatial Markovian particle system with pairwise coagulation, a spatial version of the Marcus--Lushnikov process: according to a coagulation kernel $K$, particle pairs merge into a single particle, and their masses are united. We…
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…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
In the present article we introduce a variant of Smoluchowski's coagulation equation with both position and velocity variables taking a kinetic viewpoint arising as the scaling limit of a system of second-order (microscopic) coagulating…
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak…
The multicomponent coagulation equation is a generalisation of the Smoluchowski coagulation equation in which size of a particle is described by a vector. As with the original Smoluchowski equation, the multicomponent coagulation equation…
There is a recent interest on first-order methods for linear programming (LP). In this paper,we propose a stochastic algorithm using variance reduction and restarts for solving sharp primal-dual problems such as LP. We show that the…
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 Smoluchowski equation is a system of partial differential equations modelling the diffusion and binary coagulation of a large collection of tiny particles. The mass parameter may be indexed either by positive integers, or by positive…
We consider two simple models for the formation of polymers where at the initial time, each monomer has a certain number of potential links (called arms in the text) that are consumed when aggregations occur. Loosely speaking, this imposes…
We present an efficient algorithm for one- and two-component relativistic exact-decoupling calculations. Spin-orbit coupling is thus taken into account for the evaluation of relativistically transformed (one-electron) Hamiltonian. As the…
Proximal splitting algorithms are well suited to solving large-scale nonsmooth optimization problems, in particular those arising in machine learning. We propose a new primal-dual algorithm, in which the dual update is randomized;…
We devise a simplified parameter estimator for a second order stochastic differential equation by a first order system based on the Smoluchowski-Kramers approximation. We establish the consistency of the estimator by using…