We provide a probabilistic analysis of the banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas the spatial parameter just acts on long runs. Our model appears as a new (small) step towards more general time and space dependent protocols. Our analysis relies on well-known results in stochastic homogenization theory and investigates the asymptotic behaviour of the rescaled algorithm as the total amount of resource available for allocation tends to the infinity. In the two dimensional setting, we manage to exhibit three different possible regimes for the deadlock time of the limit system.
We discuss the ergodic properties of quasi-Markovian stochastic differential equations, providing general conditions that ensure existence and uniqueness of a smooth invariant distribution and exponential convergence of the evolution operator in suitably weighted $L^{\infty}$ spaces, which implies the validity of central limit theorem for the respective solution processes. The main new result is an ergodicity condition for the generalized Langevin equation with configuration-dependent noise and (non-)conservative force.
In this paper, we study the ergodicity of invariant sublinear expectation of sublinear Markovian semigroup. For this, we first develop an ergodic theory of an expectation-preserving map on a sublinear expectation space. Ergodicity is defined as any invariant set either has $0$ capacity itself or its complement has $0$ capacity. We prove, under a general sublinear expectation space setting, the equivalent relation between ergodicity and the corresponding transformation operator having simple eigenvalue $1$, and also with Birkhoff type strong law of large numbers if the sublinear expectation is …
We consider noise perturbations of delay differential equations (DDE) experiencing Hopf bifurcation. The noise is assumed to be exponentially ergodic, i.e. transition density converges to stationary density exponentially fast uniformly in the initial condition. We show that, under an appropriate change of time scale, as the strength of the perturbations decreases to zero, the law of the critical eigenmodes converges to the law of a diffusion process (without delay). We prove the result only for scalar DDE. For vector-valued DDE without proofs see Phys.Rev.E v93, 062104.
We provide a large deviations analysis of deadlock phenomena occurring in distributed systems sharing common resources. In our model transition probabilities of resource allocation and deallocation are time and space dependent. The process is driven by an ergodic Markov chain and is reflected on the boundary of the d-dimensional cube. In the large resource limit, we prove Freidlin-Wentzell estimates, we study the asymptotic of the deadlock time and we show that the quasi-potential is a viscosity solution of a Hamilton-Jacobi equation with a Neumann boundary condition. We give a complete analys…
In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and the special queue skipping policy. Customers arrive in batches, but are served one by one according to any conservative discipline. The size of the arriving batch becomes known upon its arrival and at any time instant the total number of customers in the system is also known. According to the adopted queue skipping policy if a batch, which size is greater than the current system size, arrives to the system, all current customers in the system are removed from it and the new batch is placed …
Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove, approximates that of the Markov chain with notable precision. Strong approximations provide such "limitless" approximations for process dynamics. Our focus here is on steady-state distributions, and the diffusion model that we propose is tractable relative to strong approximations. Within an asymptotic framework, in which a scale parameter $n$ is taken large,…
We establish the existence (and in an appropriate sense uniqueness) of Markovian solutions for ergodic BSDEs under a novel monotonicity condition. Our monotonicity condition allows us to prove existence even when the driver f has arbitrary (in particular super-quadratic) growth in z, which reveals an interesting trade-off between monotonicity and growth for ergodic BSDEs. The technique of proof is to establish a probabilistic representation of the derivative of the Markovian solution, and then use this representation to obtain a-priori estimates. Our study is motivated by applications to ergod…
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper, we investigate threshold-type strategies in the context of ergodic control. We make the first steps towards their optimization by proving the ergodic properties of related functionals. Assuming Markovian price increments satisfying a minorization condition and (one-sided) boundedness we show, in particular, that for given thresholds, the distribution of the gains converges in the long run. We al…
We study a fairly general class of time-homogeneous stochastic evolutions driven by noises that are not white in time. As a consequence, the resulting processes do not have the Markov property. In this setting, we obtain constructive criteria for the uniqueness of stationary solutions that are very close in spirit to the existing criteria for Markov processes. In the case of discrete time, where the driving noise consists of a stationary sequence of Gaussian random variables, we give optimal conditions on the spectral measure for our criteria to be applicable. In particular, we show that under…
We consider a multi-channel communication system under ALOHA and CSMA protocols, resepctively, in continuous time. We derive probabilistic formulas for the most important quantities: the numbers of sending attempts and the number of successfully delivered messages in a given time interval. We derive (1) explicit formulas for the large-time limiting throughput, (2) introduce an explicit and ergodic Markov chain for a deeper probabilistic analysis, and use this to (3) derive exponential asymptotics for rare events for these quantities in the limit of large time, via large-deviation principles.
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen from the position of the walker, i.e the environment process. We also obtain ergodicity of the uniquely ergodic measure of the environment process as well as continuity as a function of the jump rates of the walker. As a consequence we obtain several limit theorems, such as law of large numbers, Einstein relation, central limit theorem and concentration propert…
One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience or recurrence, positivity or non-positivity of the speed, and the limiting distribution of the position of the walker are all characterized by a single parameter $δ$, the total expected drift per site. In the more general case of stationary ergodic environments, things are not so well understood. If all cookies are positive then the same threshold for transience vs. recurrence holds, even if the cookie stacks are unbo…
Periodic measures are the time-periodic counterpart to invariant measures for dynamical systems and can be used to characterise the long-term periodic behaviour of stochastic systems. This paper gives sufficient conditions for the existence, uniqueness and geometric convergence of a periodic measure for time-periodic Markovian processes on a locally compact metric space in great generality. In particular, we apply these results in the context of time-periodic weakly dissipative stochastic differential equations, gradient stochastic differential equations as well as Langevin equations. We will …
Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $λ_n$ along which we will be able to estimate the conditional probability $P(X_{λ_n+1}=x|X_0,...,X_{λ_n})$ from data segment $(X_0,...,X_{λ_n})$ in a pointwise consistent way for a restricted class of stationary and ergodic finite or countably infinite alphabet time series which includes among others all stationary and ergodic finitarily Markovian processes. If the statio…
In this paper we look at ergodic BSDEs in the case where the forward dynamics are given by the solution to a non-autonomous (time-periodic coefficients) Ornstein-Uhlenbeck SDE with Lévy noise, taking values in a separable Hilbert space. We establish the existence of a unique bounded solution to an infinite horizon discounted BSDE. We then use the vanishing discount approach, together with coupling techniques, to obtain a Markovian solution to the EBSDE. We also prove uniqueness under certain growth conditions. Applications are then given, in particular to risk-averse ergodic optimal control an…
In this paper we investigate an M/M/$\infty$ queue whose parameters depend on an external random environment that we assume to be a semi-Markovian process with finite state space. For this model we show a recursive formula that allows to compute all the factorial moments for the number of customers in the system in steady state. The used technique is based on the calculation of the raw moments of the measure of a bidimensional random set. Finally the case when the random environment has only two states is deeper analyzed. We obtain an explicit formula to compute the above mentioned factorial m…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time markovian walk governed by his specific transition matrix. With this assumption, we first derive an upper bound for the reproduction numbers. Then we assume that a walker is in one of the states: susceptible, infectious, or recovered. An infectious walker remains infectious during a certain characteristic time. If an infectious walker meets a susceptible one on th…
The purpose of this paper is to analyze the so-called back-off technique of the IEEE 802.11 protocol in broadcast mode with waiting queues. In contrast to existing models, packets arriving when a station (or node) is in back-off state are not discarded, but are stored in a buffer of infinite capacity. As in previous studies, the key point of our analysis hinges on the assumption that the time on the channel is viewed as a random succession of transmission slots (whose duration corresponds to the length of a packet) and mini-slots during which the back-o? of the station is decremented. These ev…
Interweaving relations are introduced and studied here in a general Markovian setting as a strengthening of usual intertwining relations between semigroups, obtained by adding a randomized delay feature. They provide a new classification scheme of the set of Markovian semigroups which enables to transfer from a reference semigroup and up to an independent warm-up time, some ergodic, analytical and mixing properties including the $φ$-entropy convergence to equilibrium, the hyperboundedness and when the warm-up time is deterministic the cut-off phenomena. We also present several useful transform…
