Stochastic modelling of the loss of telomeric sequences in cells with multiple chromosomes.
We study the impact of small additive space-time white noise on nonlinear stochastic partial differential equations (SPDEs) on unbounded domains close to a bifurcation, where an infinite band of eigenvalues changes stability due to the unboundedness of the underlying domain. Thus we expect not only a slow motion in time, but also a slow spatial modulation of the dominant modes, and we rely on the approximation via modulation or amplitude equations, which acts as a replacement for the lack of random...
Let be a sequence of independent and identically distributed random variables with continuous distribution function F(x). Denote by X(1,k),X(2,k),... the kth record values corresponding to We obtain some stochastic comparison results involving the random kth record values X(N,k), where N is a positive integer-valued random variable which is independent of the .
We produce a stochastic regularization of the Poisson-Sigma model of Cattaneo-Felder, which is an analogue regularization of Klauder’s stochastic regularization of the hamiltonian path integral [23] in field theory. We perform also semi-classical limits.
If the separability of the separable process definition is replaced by a set of optional (predictable) times, a new property is obtained, optional (predictable) separability. A well measurable (accessible) process is necessarily optionally (predictably) separable. Proofs of limit properties of a separable process become proofs of the same limit properties of a well measurable (predictable) process.
As an application of a theorem concerning a general stochastic process in a finitely additive probability space, the existence of non-atomic countably additive restrictions with large range is obtained for group-valued finitely additive measures.
In this paper, we consider a stochastic queue core () problem on a tree network, aiming to identify a path , called the core, in an environment system. Let be a tree network, the problem on involves finding a core , with an optimal length, that minimizes the total weighted travel time from all vertices to the core as well as the average response time to the customer demands. We assume that a mobile server traverses the core to provide services to customers, while customers move to their...