Geometric protean graphs
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(13)- The robot crawler graph process
- Soft communities in similarity space
- Large values of the clustering coefficient
- Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model
- The domination number of on-line social networks and random geometric graphs
- The geometric protean model for on-line social networks
- Protean Graphs
- Rumors spread slowly in a small-world spatial network
- Some typical properties of the spatial preferred attachment model
- Community structures in information networks for a discrete agent population
- Model for the evolution of the degree distributions of the vertices of social network graphs
- Random Dot Product Graph Models for Social Networks
- The iterated local model for social networks
This page was built for publication: Geometric protean graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909127)