117 citations · 164 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
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…