Related papers: Transient analysis of one-sided L\'evy-driven queu…
In this paper, we introduce branching processes in a L\'evy random environment. In order to define this class of processes, we study a particular class of non-negative stochastic differential equations driven by Brownian motions and Poisson…
Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive L\'evy process with non-zero L\'evy measure. In this paper we study the asymptotic behavior of the local time process,…
We consider a stationary Markov process that models certain queues with a bulk service of a fixed number $m$ of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal…
A stochastic process with movement, return, and rest phases is considered in this paper. For the movement phase, the particles move following the dynamics of Gaussian process or ballistic type of L\'evy walk, and the time of each movement…
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit…
The standard Levy walk is performed by a particle that moves ballistically between randomly occurring collisions, when the intercollision time is a random variable governed by a power-law distribution. During instantaneous collision events…
First-passage times in random walks have a vast number of diverse applications in physics, chemistry, biology, and finance. In general, environmental conditions for a stochastic process are not constant on the time scale of the average…
For spectrally negative L\'evy processes, we prove several fluctuation results involving a general draw-down time, which is a downward exit time from a dynamic level that depends on the running maximum of the process. In particular, we find…
We consider a L\'evy process $Y(t)$ that is not permanently observed, but rather inspected at Poisson($\omega$) moments only, over an exponentially distributed time $T_\beta$ with parameter $\beta$. The focus lies on the analysis of the…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
Waiting time is an important transport quantity that is complementary to average current and its fluctuation. So far all the studies of waiting time distribution (WTD) are limited to steady state transport (either dc or ac). In this work,…
Extract-Transform-Load (ETL) processes are core components of modern data processing infrastructures. The throughput of processed data records can be adjusted by changing the amount of allocated resources, i.e.~the number of parallel…
In this paper, we give a sufficient condition for transience for a class of one-dimensional symmetric L\'evy processes. More precisely, we prove that a one-dimensional symmetric L\'evy process with the L\'evy measure $\nu(dy)=f(y)dy$ or…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
This paper is concerned with the behaviour of a L\'{e}vy process when it crosses over a positive level, $u$, starting from 0, both as $u$ becomes large and as $u$ becomes small. Our main focus is on the time, $\tau_u$, it takes the process…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…
Virtually all practical settings where preemptive scheduling is employed are susceptible to preemption overhead, and accounting for these overheads is necessary to make informed scheduling design decisions. However, preemption overhead is…
Let $\{D(s), s \geq 0\}$ be a non-decreasing L\'evy process. The first-hitting time process $\{E(t) t \geq 0\}$ (which is sometimes referred to as an inverse subordinator) defined by $E(t) = \inf \{s: D(s) > t \}$ is a process which has…
In this paper, we study queueing systems with delayed information that use a generalization of the multinomial logit choice model as its arrival process. Previous literature assumes that the functional form of the multinomial logit model is…