English
Related papers

Related papers: Tail asymptotics for monotone-separable networks

200 papers

We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics…

Probability · Mathematics 2012-01-17 Masahiro Kobayashi , Masakiyo Miyazawa

We analyze pattern formation on a network of cells where each cell inhibits its neighbors through cell-to-cell contact signaling. The network is modeled as an interconnection of identical dynamical subsystems each of which represents the…

Dynamical Systems · Mathematics 2014-07-25 Ana S. Rufino Ferreira , Murat Arcak

We propose a multivariate generative model to capture the complex dependence structure often encountered in business and financial data. Our model features heterogeneous and asymmetric tail dependence between all pairs of individual…

Machine Learning · Computer Science 2025-12-10 Xiangqian Sun , Xing Yan , Qi Wu

In this paper we propose a framework that enables the study of large deviations for point processes based on stationary sequences with regularly varying tails. This framework allows us to keep track not of the magnitude of the extreme…

Probability · Mathematics 2009-08-21 Henrik Hult , Gennady Samorodnitsky

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

Probability · Mathematics 2010-01-12 Sem Borst , Matthieu Jonckheere , Lasse Leskelä

We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail…

Physics and Society · Physics 2008-10-21 Daniel Fraiman

We study an open discrete-time queueing network that models the collection of data in a multi-hop sensor network. We assume data is generated at the sensor nodes as a discrete-time Bernoulli process. All nodes in the network maintain a…

Networking and Internet Architecture · Computer Science 2019-07-26 Iqra Altaf Gillani , Amitabha Bagchi , Pooja Vyavahare

We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its…

Probability · Mathematics 2007-05-23 Misja Nuyens , Bert Zwart

Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(\xi_n:n\geq 0)$ to produce the process $(S_n+\xi_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum…

Probability · Mathematics 2007-05-23 Victor F. Araman , Peter W. Glynn

The present paper is concerned with the stationary workload of queues with heavy-tailed (regularly varying) characteristics. We adopt a transform perspective to illuminate a close connection between the tail asymptotics and heavy-traffic…

Probability · Mathematics 2023-04-20 Sem Borst

The paper concerns a class of $n$-dimensional non-autonomous delay differential equations obtained by adding a non-monotone delayed perturbation to a linear homogeneous cooperative system of ordinary differential equations. This family…

Classical Analysis and ODEs · Mathematics 2018-07-10 Teresa Faria , Rafael Obaya , Ana M. Sanz

In this paper we are concerned with a sample of asymptotically independent risks. Tail asymptotic probabilities for linear combinations of randomly weighted order statistics are approximated under various assumptions, where the individual…

Probability · Mathematics 2014-06-24 Alexandru V. Asimit , Enkelejd Hashorva , Dominik Kortschak

We derive subexponential tail asymptotics for the distribution of the maximum of a compound renewal process with linear component and of a L\'evy process, both with negative drift, over random time horizon $\tau$ that does not depend on the…

Probability · Mathematics 2024-10-07 Sergey Foss , Dmitry Korshunov , Zbigniew Palmowski

We introduce the \textit{generalized join the shortest queue model with retrials} and two infinite capacity orbit queues. Three independent Poisson streams of jobs, namely a \textit{smart}, and two \textit{dedicated} streams, flow into a…

Probability · Mathematics 2021-11-29 Ioannis Dimitriou

The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…

Probability · Mathematics 2014-02-04 Anja Janßen , Johan Segers

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…

Probability · Mathematics 2014-09-11 Marko Boon , Rob van der Mei , Erik Winands

We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate and service rate. We observe that the asymptotic behavior of…

Probability · Mathematics 2011-06-21 Patrick Eschenfeldt , Ben Gross , Nicholas Pippenger

The busy period for a queue is cast as the area swept under the random walk until it first returns to zero, $B$. Encompassing non-i.i.d. increments, the large-deviations asymptotics of $B$ is addressed, under the assumption that the…

Probability · Mathematics 2015-09-16 Ken R. Duffy , Sean P. Meyn

This paper addresses heavy-tailed large deviation estimates for the distribution tail of functionals of a class of spectrally one-sided L\'evy process. Our contribution is to show that these estimates remain valid in a near-critical regime.…

Probability · Mathematics 2017-02-03 Bart Kamphorst , Bert Zwart

A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…

Probability · Mathematics 2018-05-02 Rami Atar , Asaf Cohen