Sampling social networks using shortest paths

DOI10.1016/J.PHYSA.2015.01.030MaRDI QIDQ1618330zbMATH OpenOpenAlexFDO

Authors 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

social network analysisonline social networksshortest pathnetwork sampling

Mathematics Subject Classification ID

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

Recommendations

• Sampling online social networks by random walk with indirect jumps
• Sampling from complex networks with high community structures
• Estimating sizes of social networks via biased sampling
• Graph sampling
• Sampling on bipartite networks: a comparative analysis of eight crawling methods

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• A note on two problems in connexion with graphs
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Emergence of Scaling in Random Networks
• Random sampling from a search engine's index
• Sampling from complex networks with high community structures

Cited in

(5)

• Shortest path tree sampling for landmark selection in large networks
• Graph sampling for Internet topologies using normalized Laplacian spectral features
• Sampling on bipartite networks: a comparative analysis of eight crawling methods
• An introduction to learning automata and optimization
• Estimating sizes of social networks via biased sampling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1618330)