Sampling from complex networks with high community structures

DOI10.1063/1.4712602MaRDI QIDQ2787769zbMATH OpenOpenAlexWikidataFDO

Authors M. Salehi, Hamid R. Rabiee, Arezo Rajabi

Publication date 4 March 2016

Published in Chaos (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.4712602

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Social networks; opinion dynamics (91D30)

Recommendations

• Targeted sampling from massive block model graphs with personalized PageRank
• Sampling-based link prediction in complex networks
• Sampling online social networks by random walk with indirect jumps
• scientific article; zbMATH DE number 5524713
• Sampling on bipartite networks: a comparative analysis of eight crawling methods

Cites work

• Bookmark-Coloring Algorithm for Personalized PageRank Computing
• Community structure in social and biological networks
• Modeling social networks from sampled data
• On the Theory of Sampling from Finite Populations
• Using PageRank to Locally Partition a Graph

Cited in

(12)

• scientific article; zbMATH DE number 5524713 (Why is no real title available?)
• Sampling online social networks by random walk with indirect jumps
• Sampling social networks using shortest paths
• Sampling on bipartite networks: a comparative analysis of eight crawling methods
• Web accessibility sampling method based on node topology characteristics
• Unbiased sampling of network ensembles
• Targeted sampling from massive block model graphs with personalized PageRank
• Edge sampling using local network information
• Sampling-based link prediction in complex networks
• Guided sampling for large graphs
• A fair-cost analysis of the random neighbor sampling method
• Inverse network sampling to explore online brand allegiance

This page was built for publication: Sampling from complex networks with high community structures

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