Sampling social networks using shortest paths

DOI10.1016/j.physa.2015.01.030zbMath1400.91488OpenAlexW2146458746MaRDI QIDQ1618330

R. Smith

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.01.030

zbMATH Keywords

shortest pathonline social networksnetwork samplingsocial network analysis

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of statistics to social sciences (62P25) Random graphs (graph-theoretic aspects) (05C80) Internet topics (68M11)

Related Items (3)

Sampling on bipartite networks: a comparative analysis of eight crawling methods ⋮ Graph sampling for Internet topologies using normalized Laplacian spectral features ⋮ An Introduction to Learning Automata and Optimization

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Sampling from complex networks with high community structures
• A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence
• Emergence of Scaling in Random Networks
• Random sampling from a search engine's index
• Community structure in social and biological networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Sampling social networks using shortest paths