English
Related papers

Related papers: Local stability in a transient Markov chain

200 papers

In this paper, we consider the stability analysis of large-scale distributed networked control systems with random communication delays between linearly interconnected subsystems. The stability analysis is performed in the Markov jump…

Systems and Control · Computer Science 2015-11-13 Kooktae Lee , Raktim Bhattacharya

The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…

Probability · Mathematics 2015-10-20 Y. Belopolskaya , Y. Suhov

We study a model of a polling system, that is, a collection of $d$ queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is…

Probability · Mathematics 2007-11-06 Iain MacPhee , Mikhail Menshikov , Dimitri Petritis , Serguei Popov

By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…

Probability · Mathematics 2021-11-22 Elizabeth L. Wilmer

This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…

Dynamical Systems · Mathematics 2022-06-10 Giovanni Russo , Fabian Wirth

We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the…

Information Theory · Computer Science 2019-06-03 Seva Shneer , Alexander Stolyar

We introduce and study a new model that we call the {\em matching model}. Items arrive one by one in a buffer and depart from it as soon as possible but by pairs. The items of a departing pair are said to be {\em matched}. There is a finite…

Probability · Mathematics 2016-06-03 Jean Mairesse , Pascal Moyal

This paper addresses the stability conditions of the sampled-data teleoperation systems consisting continuous time master, slave, operator, and environment with discrete time controllers over general communication networks. The output…

Systems and Control · Electrical Eng. & Systems 2020-08-18 Amir A Ghavifekr , Amir R Ghiasi , Mohammad A Badamchizadeh , Farzad Hashemzadeh , Paolo Fiorini

This paper deals a continuous-time state-dependent jump linear system, a particular kind of stochastic switching system. In particular, we consider a situation when the transition rate of the random jump process depends on the state…

Systems and Control · Computer Science 2016-11-26 Shaikshavali Chitraganti , Samir Aberkane , Christophe Aubrun

It is shown that irreducible two-state continuous-time Markov chains interacting on a network in a bilinear fashion have a unique stable steady state. The proof is elementary and uses the relative entropy function.

Dynamical Systems · Mathematics 2015-06-09 Maung Min-Oo

Order-preserving couplings are elegant tools for obtaining robust estimates of the time-dependent and stationary distributions of Markov processes that are too complex to be analyzed exactly. The starting point of this paper is to study…

Probability · Mathematics 2009-06-02 Lasse Leskelä

Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…

Discrete Mathematics · Computer Science 2016-02-15 Volker Betz , Stephane Le Roux

We present sufficient conditions for the transience and the existence of local times of a Feller process, and the ultracontractivity of the associated Feller semigroup; these conditions are sharp for L\'{e}vy processes. The proof uses a…

Probability · Mathematics 2011-08-17 René L. Schilling , Jian Wang

In this brief note, we investigate some constructions of Lyapunov functions for stochastic discrete-time stabilizable dynamical systems, in other words, controlled Markov chains. The main question here is whether a Lyapunov function in some…

Dynamical Systems · Mathematics 2026-01-01 Pavel Osinenko , Grigory Yaremenko

In this paper, we equip the conventional discrete-time queueing network with a Markovian input process, that, in addition to the usual short-term stochastics, governs the mid- to long-term behavior of the links between the network nodes.…

Systems and Control · Electrical Eng. & Systems 2020-04-07 Richard Schoeffauer , Gerhard Wunder

The topic of this manuscript is the stability analysis of continuous-time switched nonlinear systems with constraints on the admissible switching signals. Our particular focus lies in considering signals characterized by upper and lower…

Optimization and Control · Mathematics 2024-01-17 Matteo Della Rossa

The paper analyzes the performance of tandem network of polling queue with setups. For a system with two-products and two-stations, we propose a new approach based on a partially-collapsible state-space characterization to reduce…

Performance · Computer Science 2022-02-22 Ravi Suman , Ananth Krishnamurthy

This paper considers the phenomenon of distinct regional frequencies recently observed in some power systems. First, a reduced-order mathematical model describing this behaviour is developed. Then, techniques to solve the model are…

Optimization and Control · Mathematics 2021-04-15 Luis Badesa , Fei Teng , Goran Strbac

In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…

Performance · Computer Science 2024-10-02 Isaac Grosof , Yige Hong , Mor Harchol-Balter

Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Much is known in the dropping setting, where jobs are immediately discarded if they require more servers than are currently available.…

Performance · Computer Science 2020-10-05 Isaac Grosof , Mor Harchol-Balter , Alan Scheller-Wolf
‹ Prev 1 4 5 6 7 8 10 Next ›