52 citations · 120 across the 20 of their papers we have counts for
23 papers
Robust subgraph counting with distribution-free random graph analysis
Johan S. H. van Leeuwaarden, Clara Stegehuis
Subgraphs such as cliques, loops and stars form crucial connections in the topologies of real-world networks. Random graph models provide estimates for how often certain subgraphs…
Optimal Hyper-Scalable Load Balancing with a Strict Queue Limit
Mark van der Boor, Sem Borst, Johan van Leeuwaarden
Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of lo…
MAD dispersion measure makes extremal queue analysis simple
Wouter van Eekelen, Dick den Hertog, Johan S. H. van Leeuwaarden
A notorious problem in queueing theory is to compute the worst possible performance of the GI/G/1 queue under mean-dispersion constraints for the interarrival and service time dist…
Variational principle for scale-free network motifs
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
For scale-free networks with degrees following a power law with an exponent , the structures of motifs (small subgraphs) are not yet well understood. We introduce a meth…
Parameter estimators of random intersection graphs with thinned communities
Joona Karjalainen, Johan S. H. van Leeuwaarden, Lasse Leskelä
This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with pro…
Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods
Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden +1
We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead.…