output
19942026
Showing 2018 · math.PRShow all

12 papers · 2 filters

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,…

math.PR2018★ 21 cited

Redundancy scheduling with scaled Bernoulli service requirements

Youri Raaijmakers, Sem Borst, Onno Boxma

Redundancy scheduling has emerged as a powerful strategy for improving response times in parallel-server systems. The key feature in redundancy scheduling is replication of a job u…

math.PR2018★ 13 cited

Random intersection graphs with communities

Remco van der Hofstad, Julia Komjathy, Viktoria Vadon

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships…

math.PR2018★ 6 cited

Transition time asymptotics of queue-based activation protocols in random-access networks

Sem Borst, Frank den Hollander, Francesca R. Nardi +1

We consider networks where each node represents a server with a queue. An active node deactivates at unit rate. An inactive node activates at a rate that depends on its queue lengt…

math.PR2018★ 11 cited

Subgraphs in preferential attachment models

Alessandro Garavaglia, Clara Stegehuis

We consider subgraph counts in general preferential attachment models with power-law degree exponent . For all subgraphs , we find the scaling of the expected number of sub…

math.PR2018★ 72 cited

Scalable load balancing in networked systems: A survey of recent advances

Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden +1

The basic load balancing scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one of single-server queues. We discuss recent advances…

math.PR2018★ 11 cited

Cliques in rank-1 random graphs: the role of inhomogeneity

Kay Bogerd, Rui M. Castro, Remco van der Hofstad

We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of th…

math.PR2018★ 11 cited

Absence of Dobrushin states for long-range Ising models

Loren Coquille, Aernout C. D. van Enter, Arnaud Le Ny +1

We consider the two-dimensional Ising model with long-range pair interactions of the form with , mostly when . We show that Dobrushin sta…

math.PR2018

Large deviations analysis for the queue in the Halfin-Whitt regime

David A. Goldberg, Debankur Mukherjee, Yuan Li

We consider the FCFS queue in the Halfin-Whitt heavy traffic regime. It is known that the normalized sequence of steady-state queue length distributions is tight and…

math.PR2018★ 40 cited

Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs

Júlia Komjáthy, Bas Lodewijks

In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolat…

math.PR2018★ 1 cited

Generalized gap acceptance models for unsignalized intersections

Abhishek, Marko Boon, Michel Mandjes

This paper contributes to the modeling and analysis of unsignalized intersections. In classical gap acceptance models vehicles on the minor road accept any gap greater than the CRI…

math.PR2018★ 1 cited

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…