117 citations · 164 across the 10 of their papers we have counts for
12 papers
Asymptotic degree distributions in random threshold graphs
Armand M. Makowski, Siddharth Pal
We discuss several limiting degree distributions for a class of random threshold graphs in the many node regime. This analysis is carried out under a weak assumption on the distrib…
Node isolation in large homogeneous binary multiplicative attribute graph models
Sikai Qu, Armand M. Makowski
The multiplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model of certain classes of real-world networks. It is an instance o…
On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models
Sikai Qu, Armand M. Makowski
The muliplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model for networks where network structure is believed to be shaped b…
Asymptotic degree distributions in large (homogeneous) random networks: A little theory and a counterexample
Siddharth Pal, Armand M. Makowski
In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of no…
Light traffic behavior under the power-of-two load balancing strategy: The case of heterogeneous servers
Ane Izagirre, Armand M. Makowski
We consider a multi-server queueing system under the power-of-two policy with Poisson job arrivals, heterogeneous servers and a general job requirement distribution; each server op…
Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version)
Osman Yağan, Armand M. Makowski
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random…