We study the critical behavior of the component sizes for the configuration model when the
tail of the degree distribution of a randomly chosen vertex is a regularly-varying function with …

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-
1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et …

The largest components of the critical Erdős–Rényi graph, G (n, p) with p= 1/n, have size of
order n2/3 with high probability. We give detailed asymptotics for the probability that there is …

Random graphs have played an instrumental role in modelling real-world networks arising
from the internet topology, social networks, or even protein-interaction networks within cells …

We consider the Δ (i)/G/1 queue, in which a total of n customers join a single-server queue
for service. Customers join the queue independently after exponential times. We consider …

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-
1 type having finite variance but infinite third moment degrees was obtained (see previous …

Queueing phenomena occur whenever there is competition for a scarce resource. Often, this
resource is time and the competition is over the attention of a server. As a result, abstract …