4 citations · 9 across the 7 of their papers we have counts for
4 papers · 1 filter
Queues on a dynamically evolving graph
Michel Mandjes, Nicos Starreveld, René Bekker
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, ent…
Dynamic Erdős-Rényi graphs
M. Mandjes, N. J. Starreveld, R. Bekker +1
We propose two classes of dynamic versions of the classical Erdős-Rényi graph: one in which the transition rates are governed by an external regime process, and one in which the tr…
Ensemble equivalence for dense graphs
F. den Hollander, M. Mandjes, A. Roccaverde +1
In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dens…
Occupation times for the finite buffer fluid queue with phase-type ON-times
N. J. Starreveld, R. Bekker, M. Mandjes
In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fr…