Related papers: Self-stabilizing processes based on random signs
We construct `self-stabilizing' processes {Z(t), t $\in [t_0,t_1)$}. These are random processes which when `localized', that is scaled around t to a fine limit, have the distribution of an $\alpha$(Z(t))-stable process, where $\alpha$ is…
In the context of large-scale networks, the consideration of faults is an evident necessity. This document is focussing on the self-stabilizing approach which aims at conceiving algorithms "repairing themselves" in case of transient faults,…
Self-normalized processes are basic to many probabilistic and statistical studies. They arise naturally in the the study of stochastic integrals, martingale inequalities and limit theorems, likelihood-based methods in hypothesis testing and…
Topological self-stabilization describes the ability of a distributed system to let the nodes themselves establish a meaningful overlay network. Independent from the initial network topology, the system converges to the desired topology via…
Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…
Discrete stability extends the classical notion of stability to random elements in discrete spaces by defining a scaling operation in a randomised way: an integer is transformed into the corresponding binomial distribution. Similarly…
The notion of stability can be generalised to point processes by defining the scaling operation in a randomised way: scaling a configuration by $t$ corresponds to letting such a configuration evolve according to a Markov branching particle…
In this paper we show that the continuous version of the self normalised process $Y_{n,p}(t)= S_n(t)/V_{n,p}+(nt-[nt])X_{[nt]+1}/V_{n,p}$ where $S_n(t)=\sum_{i=1}^{[nt]} X_i$ and $V_{(n,p)}= \sum_{i=1}^{n}|X_i|^p)^{\frac{1}{p}}$ and $X_i$…
We call a point process $Z$ on $\mathbb R$ \emph{exp-1-stable} if for every $\alpha,\beta\in\mathbb R$ with $e^\alpha+e^\beta=1$, $Z$ is equal in law to $T_\alpha Z+T_\beta Z'$, where $Z'$ is an independent copy of $Z$ and $T_x$ is the…
We construct a non-decreasing pure jump Markov process, whose jump measure heavily depends on the values taken by the process. We determine the singularity spectrum of this process, which turns out to be random and to depend locally on the…
In many contexts such as queuing theory, spatial statistics, geostatistics and meteorology, data are observed at irregular spatial positions. One model of this situation involves considering the observation points as generated by a Poisson…
We describe a new class of self-similar symmetric $\alpha$-stable processes with stationary increments arising as a large time scale limit in a situation where many users are earning random rewards or incurring random costs. The resulting…
Current reconfiguration techniques are based on starting the system in a consistent configuration, in which all participating entities are in their initial state. Starting from that state, the system must preserve consistency as long as a…
For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…
We consider the Gaussian approximation for functionals of a Poisson process that are expressible as sums of region-stabilizing (determined by the points of the process within some specified regions) score functions and provide a bound on…
We study the following synchronous process that we call "repeated balls-into-bins". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen…
Let $r: S\times S\to \bb R_+$ be the jump rates of an irreducible random walk on a finite set $S$, reversible with respect to some probability measure $m$. For $\alpha >1$, let $g: \bb N\to \bb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k) =…
We propose a definition o meta-stability and obtain sufficient conditions for a sequence of Markov processes on finite state spaces to be meta-stable. In the reversible case, these conditions reduce to estimates of the capacity and the…
This article is concerned with stability analysis and stabilization of randomly switched systems under a class of switching signals. The switching signal is modeled as a jump stochastic (not necessarily Markovian) process independent of the…
We consider stochastic processes $Y(t)$ which can be represented as $Y(t)=(X(t))^s, s \in \mathbb{N},$ where $X(t)$ is a stationary strictly sub-Gaussian process and build a wavelet-based model that simulates $Y(t)$ with given accuracy and…