Related papers: The exact probability distribution of saturating s…
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the $n$ vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of…
An advanced full-wave time-domain numerical model for reverse saturable absorption (RSA) is presented and verified against established methods. Rate equations, describing atomic relaxations and excitation dynamics, are coupled to Maxwell…
Stochastic rounding (SR) is a probabilistic method used to round numbers to floating-point and fixed-point representations. In length $n$ summation, the worst-case error of SR grows as $\sqrt{n}$ with high probability, unlike for standard…
We consider a problem wherein jobs arrive at random times and assume random values. Upon each job arrival, the decision-maker must decide immediately whether or not to accept the job and gain the value on offer as a reward, with the…
A relevant question when analyzing spatial point patterns is that of spatial randomness. More specifically, before any model can be fit to a point pattern a first step is to test the data for departures from complete spatial randomness…
In this paper we study the randomized non-autonomous complete linear differential equation. The diffusion coefficient and the source term in the differential equation are assumed to be stochastic processes and the initial condition is…
Consider a system performing a continuous-time random walk on the integers, subject to catastrophes occurring at constant rate, and followed by exponentially-distributed repair times. After any repair the system starts anew from state zero.…
The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…
Stochastic processes that are randomly reset to an initial condition serve as a showcase to investigate non-equilibrium steady states. However, all existing results have been restricted to the special case of memoryless resetting protocols.…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
The wrapped normal distribution arises when a the density of a one-dimensional normal distribution is wrapped around the circle infinitely many times. At first look, evaluation of its probability density function appears tedious as an…
We developed a corporative stochastic approximation (CSA) type algorithm for semi-infinite programming (SIP), where the cut generation problem is solved inexactly. First, we provide general error bounds for inexact CSA. Then, we propose two…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
The Symmetric Exclusion Process (SEP), in which particles hop symmetrically on a discrete line with hard-core constraints, is a paradigmatic model of subdiffusion in confined systems. This anomalous behavior is a direct consequence of…
We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
New computing paradigms are required to solve the most challenging computational problems where no exact polynomial time solution exists.Probabilistic Ising Accelerators has gained promise on these problems with the ability to model complex…
In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…
Sequential sampling occurs when the entire population is not known in advance and data are obtained one at a time or in groups of units. This manuscript proposes a new algorithm to sequentially select a balanced sample. The algorithm…
Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…