Related papers: Self-stabilizing processes based on random signs
We study a simple random process that computes a maximal independent set (MIS) on a general $n$-vertex graph. Each vertex has a binary state, black or white, where black indicates inclusion into the MIS. The vertex states are arbitrary…
Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing, fake messages may be placed in communication links…
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…
Self-organization creates new order and shifts sub-boundaries while reorganizing energy and entropy within a control volume. This article examines pathway selection and tests whether maximizing the entropy generation rate can forecast…
Let $X_1, X_2,\ldots$ be random elements of the Skorokhod space $D(\mathbb{R})$ and $\xi_1, \xi_2, \ldots$ positive random variables such that the pairs $(X_1,\xi_1), (X_2,\xi_2),\ldots$ are independent and identically distributed. The…
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists, for which the process is stationary and ergodic, and for…
Consider the max-stable process $\eta(t) = \max_{i\in\mathbb N} U_i \rm{e}^{\langle X_i, t\rangle - \kappa(t)}$, $t\in\mathbb{R}^d$, where $\{U_i, i\in\mathbb{N}\}$ are points of the Poisson process with intensity $u^{-2}\rm{d} u$ on…
The aim of this paper is to present a result of discrete approximation of some class of stable self-similar stationary increments processes. The properties of such processes were intensively investigated, but little is known on the context…
This paper derives a somewhat surprising but interesting enough result on the stabilizability of discrete-time parameterized uncertain systems. Contrary to an intuition, it shows that the growth rate of a discrete-time stabilizable system…
A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow…
We consider the behavior of extremal particles in $K$-symmetric exclusion on $\mathbb{Z}$ when the process starts from certain infinite-particle step configurations where there are no particles to the right of a maximal one. In such a…
Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded region is stable if it contains finitely many points of the point process with probability one. In this paper we provide algorithms that…
We study the largest gaps between successive zeros of a smooth stationary Gaussian process. Our main result is that, if correlations decay at least polynomially, then after suitable rescaling of the locations and sizes of the largest gaps…
We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…
We propose a finite-size scaling analysis of binary stochastic processes $X(t)\in \{0,1\}$ based on the second moment correlation length $\xi$ for the autocorrelation function $C(t)$. The purpose is to clarify the critical properties and…
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we…
The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…
This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network…
We introduce a family of local inhomogeneous mark-weighted summary statistics, of order two and higher, for general marked point processes. Depending on how the involved weight function is specified, these summary statistics capture…
Self-exciting point processes describe the manner in which every event facilitates the occurrence of succeeding events. By increasing excitability, the event occurrences start to exhibit bursts even in the absence of external stimuli. We…