Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Johan van Leeuwaarden"'
Publikováno v:
Stochastic Systems, Vol 7, Iss 1, Pp 1-31 (2017)
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate Λ from a given distribution every Δ time units, yielding an
Externí odkaz:
https://doaj.org/article/03173459078043b980008c544b5da0e0
Publikováno v:
Queueing Systems, 100(3-4), 485-487. Springer Netherlands
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::036c615059dc3cdbd7725a42d1446b80
https://research.tilburguniversity.edu/en/publications/dcc0dbbd-7760-4cfc-b30b-34bf058afbfc
https://research.tilburguniversity.edu/en/publications/dcc0dbbd-7760-4cfc-b30b-34bf058afbfc
Publikováno v:
Physical Review E, 106(6):064311. American Physical Society
Complex network theory crucially depends on the assumptions made about the degree distribution, while fitting degree distributions to network data is challenging, in particular for scale-free networks with power-law degrees. We present a robust asses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58ab05e8231b8c86039d41096e6107e4
Publikováno v:
arXiv, 2021:2104.04303. Cornell University Library
Transportation Research Part B: Methodological, 167, 79-98. Elsevier
Transportation Research Part B: Methodological, 167, 79-98. Elsevier
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an elementary queuei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b6eafba3566433aee7063257ad6197d
http://arxiv.org/abs/2104.04303
http://arxiv.org/abs/2104.04303
Publikováno v:
Physical Review E, 96(4):042309. American Physical Society
Real-world networks often have power-law degrees and scale-free properties such as ultra-small distances and ultra-fast information spreading. In this paper, we study a third universal property: three-point correlations that suppress the creation of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75e5403aef7ed4533c0dd628c1ac23ee
http://arxiv.org/abs/1706.01727
http://arxiv.org/abs/1706.01727
Publikováno v:
Physical Review E, 95(2):022307. American Physical Society
We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges and allows for negative degree correlatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c8ef82e42514f7c428cdc4983639735
http://www.scopus.com/inward/record.url?scp=85013806492&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85013806492&partnerID=8YFLogxK
Publikováno v:
SIAM Journal on Applied Mathematics, 74(3), 844-863. Society for Industrial and Applied Mathematics (SIAM)
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 multi-dimens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::660e5249991db90e2cc3f578941f3090
https://doi.org/10.1137/130943297
https://doi.org/10.1137/130943297
Publikováno v:
SIAM Journal on Discrete Mathematics, 27(3), 1295-1312. Society for Industrial and Applied Mathematics (SIAM)
We explore the minimum energy configurations of repelling particles distributed over $n$ possible locations forming a toric grid. We conjecture that the most energy-efficient way to distribute $n/2$ particles over this space is to place them in a che
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b8131172a51460ced622388f2744726
https://research.tue.nl/en/publications/535b4763-fef1-43a9-959c-a5a82c3917fc
https://research.tue.nl/en/publications/535b4763-fef1-43a9-959c-a5a82c3917fc
Publikováno v:
Journal of Statistical Physics, 164(5), 1217-1232. Springer
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the $n$ vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of the state
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8982fc6194efddc266d4e3bcd178683
http://arxiv.org/abs/1604.03918
http://arxiv.org/abs/1604.03918
Publikováno v:
Journal of Applied Probability, 45(1), 163-175. University of Sheffield
The TCP window size process can be modeled as a piecewise-deterministic Markov process that increases linearly and experiences downward jumps at Poisson times. We present a transient analysis of this window size process. Our main result is the Laplac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d59ddf7f6040a9deaf283064cf1fbf5e
https://doi.org/10.1239/jap/1208358959
https://doi.org/10.1239/jap/1208358959