4 research outputs found
The domination number of on-line social networks and random geometric graphs
We consider the domination number for on-line social networks, both in a
stochastic network model, and for real-world, networked data. Asymptotic
sublinear bounds are rigorously derived for the domination number of graphs
generated by the memoryless geometric protean random graph model. We establish
sublinear bounds for the domination number of graphs in the Facebook 100 data
set, and these bounds are well-correlated with those predicted by the
stochastic model. In addition, we derive the asymptotic value of the domination
number in classical random geometric graphs
Geometric protean graphs
We study the link structure of on-line social networks (OSNs), and introduce
a new model for such networks which may help infer their hidden underlying
reality. In the geo-protean (GEO-P) model for OSNs nodes are identified with
points in Euclidean space, and edges are stochastically generated by a mixture
of the relative distance of nodes and a ranking function. With high
probability, the GEO-P model generates graphs satisfying many observed
properties of OSNs, such as power law degree distributions, the small world
property, densification power law, and bad spectral expansion. We introduce the
dimension of an OSN based on our model, and examine this new parameter using
actual OSN data. We discuss how the geo-protean model may eventually be used as
a tool to group users with similar attributes using only the link structure of
the network