Related papers: The exact probability distribution of saturating s…
We study random sequential adsorption (RSA) of a class of solids that can be obtained from a cube by specific cutting of its vertices, in order to find out how the transition from tetrahedral to octahedral symmetry affects the densities of…
The random sequential adsorption (RSA) model is a classical model in Statistical Physics for adsorption on two-dimensional surfaces. Objects are deposited sequentially at random and adsorb irreversibly on the landing site, provided that…
This paper develops a unified framework, based on iterated random operator theory, to analyze the convergence of constant stepsize recursive stochastic algorithms (RSAs). RSAs use randomization to efficiently compute expectations, and so…
We study two-dimensional random sequential adsorption (RSA) of flat polygons and rounded squares aligned in parallel to find a transition in the asymptotic behavior of the kinetics of packing growth. Differences in the kinetics for RSA of…
We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability $x_A$ of choosing an A…
This survey concerns probabilistic models motivated by cooperative sequential adsorption (CSA) models. CSA models are widely used in physics and chemistry for modelling adsorption processes in which adsorption rates depend on the spatial…
We study the long-time behavior of stochastic models with an absorbing state, conditioned on survival. For a large class of processes, in which saturation prevents unlimited growth, statistical properties of the surviving sample attain…
Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…
The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…
Convergence of an abstract reduction system (ARS) is the property that any derivation from an initial state will end in the same final state, a.k.a. normal form. We generalize this for probabilistic ARS as almost-sure convergence, meaning…
We develop a novel and powerful method of exactly calculating various transport characteristics of waves in one-dimensional random media with (or without) coherent absorption or amplification. Using the method, we compute the probability…
We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a…
Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the…
Random sequential addition (RSA) models are used in a large variety of contexts to model particle aggregation and jamming. A key feature of these models is the algebraic time dependence of the asymptotic jamming coverage as $t\to\infty$.…
Relaxation of the packing of elongated particles (discorectangles) aligned on a line was studied numerically. The aspect ratio (length-to-width ratio) for the discorectangles was varied within the range $\varepsilon \in [1;50]$. The initial…
We obtain the distribution of the maximal average in a sequence of independent identically distributed exponential random variables. Surprisingly enough, it turns out that the inverse distribution admits a simple closed form. An application…
We study saturated packings produced according to random sequential adsorption (RSA) protocol built of identical rectangles deposited on a flat, continuous plane. An aspect ratio of rectangles is defined as the length-to-width ratio,…
Generating random variates from high-dimensional distributions is often done approximately using Markov chain Monte Carlo. In certain cases, perfect simulation algorithms exist that allow one to draw exactly from the stationary…