◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Johan S. H. van Leeuwaarden

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author2

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.PR2
  • math.OC1
ORCID 0000-0001-9752-0018

identity via Semantic Scholar / OpenAlex

most citedCounting cliques and cycles in scale-free inhomogeneous random graphs

45 citations · 45 across the 3 of their papers we have counts for

collaborators

3 papers

math.OC2020

Tight tail probability bounds for distribution-free decision making

Ernst Roos, Ruud Brekelmans, Wouter van Eekelen +2

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only…

math.PR2018

Job Allocation in Large-Scale Service Systems with Affinity Relations

Ellen Cardinaels, Sem C. Borst, Johan S. H. van Leeuwaarden

We consider load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be allocated to a fast, primary server from a part…

math.PR2018★ 45 cited

Counting cliques and cycles in scale-free inhomogeneous random graphs

A. J. E. M. Janssen, Johan S. H. van Leeuwaarden, Seva Shneer

Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models,…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.