Related papers: Self-stabilizing processes
Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…
We derive a general formulation of the self-organized branching process by considering sandpile dynamics in an evolving population characterized by "birth" (excitation) and "death" (de-excitation) of active sites ($z=1$). New active sites…
Being the max-analogue of $\alpha$-stable stochastic processes, max-stable processes form one of the fundamental classes of stochastic processes. With the arrival of sufficient computational capabilities, they have become a benchmark in the…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits a correct behaviour. Speculation consists in guaranteeing that the system satisfies its requirements for any execution…
We prove a Poisson process approximation result for stabilizing functionals of a determinantal point process. Our results use concrete couplings of determinantal processes with different Palm measures and exploit their association…
A minority process in a weighted graph is a dynamically changing coloring. Each node repeatedly changes its color in order to minimize the sum of weighted conflicts with its neighbors. We study the number of steps until such a process…
In this note, we introduce the notion of $\alpha$-IDT processes which is obtained from a slight and fundamental modification of the IDT property. Several examples of $\alpha$-IDT processes are given and Gaussian processes which are…
We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes.…
An optimal control for a dynamical system optimizes a certain objective function. Here we consider the construction of an optimal control for a stochastic dynamical system with a random structure, Poisson perturbations and random jumps,…
In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then, the process recommences. Hitherto, the resetting mechanism…
We consider a random process as a solution of stochastic differential equations with dependence of the coefficients on small parameter $\varepsilon$ and we suppose that the drift coefficients of these equations are unbounded on the…
Let $(U_t,V_t)$ be a bivariate L\'evy process, where $V_t$ is a subordinator and $U_t$ is a L\'evy process formed by randomly weighting each jump of $V_t$ by an independent random variable $X_t$ having cdf $F$. We investigate the asymptotic…
The time-optimal technique of spatial localization of the random pulsed-point source that has the uniform distribution density on search interval and indicating itself by generation of the instant impulses (delta functions) at random time…
We consider importance sampling as well as other properly weighted samples with respect to a target distribution $\pi$ from a different point of view. By considering the associated weights as sojourn times until the next jump, we define…
We investigate joint temporal and contemporaneous aggregation of N independent copies of strictly stationary INteger-valued AutoRegressive processes of order 1 (INAR(1)) with random coefficient $\alpha\in(0,1)$ and with idiosyncratic…
Using the LePage representation, a strictly stable random element in a Banach space with $\alpha\in(0,2)$ can be represented as a sum of points of a Poisson process. This point process is union-stable, i.e. the union of its two independent…
Stable distributions are a celebrated class of probability laws used in various fields. The $\alpha$-stable process, and its exponentially tempered counterpart, the Classical Tempered Stable (CTS) process, are also prominent examples of…
Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…
We consider snap-stabilizing algorithms in anonymous networks. Self-stabilizing algorithms are well known fault tolerant algorithms : a self-stabilizing algorithm will eventually recover from arbitrary transient faults. On the other hand,…
The purpose of this paper is to investigate the long time behaviour for a self-interacting diffusion and a self-interacting velocity jump process. While the diffusion case has already been studied for some particular potential function, the…