Related papers: Self-stabilizing processes
A self-stabilizing processes $\{Z(t), t\in [t_0,t_1)\}$ is a random process which when localized, that is scaled to a fine limit near a given $t\in [t_0,t_1)$, has the distribution of an $\alpha(Z(t))$-stable process, where $\alpha:…
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…
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,…
We use characteristic functions to construct alpha(x)-multistable measures and integrals, where the measures behave locally like alpha-stable measures, but with the stability index alpha(x) varying with time x. This enables us to construct…
We present a general method for constructing stochastic processes with prescribed local form. Such processes include variable amplitude multifractional Brownian motion, multifractional $\alpha$-stable processes, and multistable processes,…
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…
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…
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$…
As a supplement of our previous work, we consider the localized region of the random Schroedinger operators on $l^2({\bf Z}^d)$ and study the point process composed of their eigenvalues and corresponding localization centers. For the…
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…
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…
For each $\lambda>0$ and every square-integrable infinitely-divisible (ID) distribution there exists at least one stationary stochastic process $t\mapsto X_t$ with the specified distribution for $X_1$ and with first-order autoregressive…
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any kind and any finite number of transient faults. This…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time.…
We describe a construction of random meromorphic functions with prescribed simple poles with unit residues at a given stationary point process. We characterize those stationary processes with finite second moment for which, after…
Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic…
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 consider the stochastic ranking process with space-time dependent jump rates for the particles. The process is a simplified model of the time evolution of the rankings such as sales ranks at online bookstores. We prove that the joint…
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…