The ``cameo principle and the origin of scale-free graphs in social networks
From MaRDI portal
(Redirected from Publication:702932)
The ``cameo principle'' and the origin of scale-free graphs in social networks
The ``cameo principle'' and the origin of scale-free graphs in social networks
Abstract: We formulate a simple edge generation rule based on an inverse like mass action principle for random graphs over a structured vertex set. We show that under very weak assumptions on the structure generating distribution we obtain a scale free distribution for the degree. We furthermore introduce and study a "my friends are your friends" local search principle which makes the clustering coefficient large.
Recommendations
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Emergence of Scaling in Random Networks
- Scale-free degree distributions, homophily and the glass ceiling effect in directed networks
- Scale-free networks: a decade and beyond
- Scale-free networks: basic theory and applied research
- On the origins of hierarchy in complex networks
- scientific article; zbMATH DE number 53804
- Asymptotic distributions in random graphs with applications to social networks
Cited in
(5)- RECIPROCITY AND THE EMERGENCE OF POWER LAWS IN SOCIAL NETWORKS
- Model for the evolution of the degree distributions of the vertices of social network graphs
- Nonlinear diffusion through large complex networks containing regular subgraphs
- Principles of network computing
- Rulers and slaves in a random social group
This page was built for publication: The ``cameo principle and the origin of scale-free graphs in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702932)
