English
Related papers

Related papers: On recurrence and availability factor for single--…

200 papers

This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in…

Probability · Mathematics 2020-01-01 Michel Mandjes , Nicos Starreveld , René Bekker

Microreversibility rules the fluctuations of the currents flowing across open systems in nonequilibrium (or equilibrium) steady states. As a consequence, the statistical cumulants of the currents and their response coefficients at arbitrary…

Statistical Mechanics · Physics 2018-08-15 Maximilien Barbier , Pierre Gaspard

A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs…

Probability · Mathematics 2020-12-21 Seva Shneer , Alexander Stolyar

There has been much recent interest in two-sided markets and dynamics thereof. In a rather a general discrete-time feedback model, which we show conditions that assure that for each agent, there exists the limit of a long-run average…

Optimization and Control · Mathematics 2025-04-21 Wynita M. Griggs , Ramen Ghosh , Jakub Marecek , Robert N. Shorten

The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences…

Optimization and Control · Mathematics 2012-12-24 N. K. Krivulin , V. B. Nevzorov

We obtain a description of the Poincar\'e recurrences of chaotic systems in terms of the ergodic theory of transient chaos. It is based on the equivalence between the recurrence time distribution and an escape time distribution obtained by…

Chaotic Dynamics · Physics 2008-04-29 Eduardo G. Altmann , Tamas Tel

Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner. The delivery of information in such multi-agent systems is typically implemented through routing…

Computer Science and Game Theory · Computer Science 2016-06-27 Omer Lev , Moshe Tennenholtz , Aviv Zohar

Redundancy scheduling has emerged as a powerful strategy for improving response times in parallel-server systems. The key feature in redundancy scheduling is replication of a job upon arrival by dispatching replicas to different servers.…

Probability · Mathematics 2019-10-24 Youri Raaijmakers , Sem Borst , Onno Boxma

We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $\lambda_0f(r)$ depends on the remaining service time $r$…

Probability · Mathematics 2017-10-05 Benjamin Legros , Ali Devin Sezer

Collective adaptive systems are an emerging class of networked computational systems, particularly suited in application domains such as smart cities, complex sensor networks, and the Internet of Things. These systems tend to feature large…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-11-23 Mirko Viroli , Giorgio Audrito , Jacob Beal , Ferruccio Damiani , Danilo Pianini

An account is given of the features, of the kind pertaining to q-statistics, of the dynamics at the one-dimensional critical attractors associated to the three familiar routes to chaos, intermittency, period doubling and quasiperiodicity.…

Statistical Mechanics · Physics 2013-08-29 A. Robledo

We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects.…

Probability · Mathematics 2016-09-09 Lam Nguyen , Alexander Stolyar

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

Analysis of PDEs · Mathematics 2020-01-22 Davit Martirosyan , Vahagn Nersesyan

We consider a single server system with infinite waiting room in a random environment. The service system and the environment interact in both directions. Whenever the environment enters a prespecified subset of its state space the service…

Probability · Mathematics 2013-12-03 Ruslan Krenzler , Hans Daduna

The goal of this work is to study the space of continuous functions whose ergodic averages converge everywhere towards a continuous function. We will connect, as in the case of a metric study, the convergence of the ergodic averages and the…

Dynamical Systems · Mathematics 2013-03-18 Jean-François Bertazzon

We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…

Probability · Mathematics 2019-05-13 Burak Büke , Wenyi Qin

We study the periodic properties of sequences of quantum channels sampled from an ergodic stochastic process satisfying a natural irreducibility condition. We relate these periodic properties to certain global spectral data defined by the…

Mathematical Physics · Physics 2026-04-13 Owen Ekblad , Jeffrey Schenker

This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…

Probability · Mathematics 2018-07-19 Zeyu Zheng , Harsha Honnappa , Peter W. Glynn

Emergence is a pregnant property in various fields. It is the fact for a phenomenon to appear surprisingly and to be such that it seems at first sight that it is not possible to predict its apparition. That is the reason why it has often…

Computational Complexity · Computer Science 2023-08-23 Hervé Zwirn

The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…

Probability · Mathematics 2021-09-23 Manuel Alberto M. Ferreira