Related papers: Continuity of a queueing integral representation i…
We show that, for many holomorphic function spaces on the unit disk, a continuous endomorphism that sends inner functions to inner functions is necessarily a weighted composition operator.
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
We study the Multiserver-Job Queuing Model (MJQM) with general independent arrivals and service times under FCFS scheduling, using stochastic recurrence equations (SREs) and ergodic theory. We prove the monotonicity and separability…
The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…
We present a general approach for computing the dynamic partition function of a continuous-time Markov process. The Ruelle topological pressure is identified with the large deviation function of a physical observable. We construct for the…
In the present paper the infinite-server MMAPkGk queueing model with random resource vector of customers, marked MAP arrival and semi-Markov (SM) arrival of catastrophes is considered. The joint generating functions (PGF) of transient and…
We develop operator renewal theory for flows and apply this to infinite ergodic theory. In particular we obtain results on mixing for a large class of infinite measure semiflows. Examples of systems covered by our results include…
We study stochastic delay differential equations (SDDE) where the coefficients depend on the moving averages of the state process. As a first contribution, we provide sufficient conditions under which a linear path functional of the…
Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…
The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also…
This paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assuming generally distributed service requirements and any…
We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…
Discrete-time queueing models find huge applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems, computer networks, etc. In this paper, we analyze an infinite-buffer queueing…
A stochastic linear transport equation with multiplicative noise is considered and the question of no-blow-up is investigated. The drift is assumed only integrable to a certain power. Opposite to the deterministic case where smooth initial…
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
In this article, we prove a new functional limit theorem for the partial sum sequence $S_{[nt]}=\sum_{i=1}^{[nt]}X_i$ corresponding to a linear sequence of the form $X_i=\sum_{j \in \bZ}c_j \xi_{i-j}$ with i.i.d. innovations $(\xi_i)_{i \in…