Sampling on bipartite networks: a comparative analysis of eight crawling methods
From MaRDI portal
Recommendations
- Sampling online social networks by random walk with indirect jumps
- Uniform sampling of bipartite graphs with degrees in prescribed intervals
- Sampling from complex networks with high community structures
- scientific article; zbMATH DE number 1743766
- A critical threshold for design effects in network sampling
Cites work
- Community structure in social and biological networks
- Evolution of the social network of scientific collaborations
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Improving the recommender algorithms with the detected communities in bipartite networks
- Interfirm collaboration networks: the impact of large-scale network structure on firm innovation
- Introduction to algorithms.
- Modeling one-mode projection of bipartite networks by tagging vertex information
- Monte Carlo sampling methods using Markov chains and their applications
- Random graph models of social networks
- Sampling from complex networks with high community structures
- Sampling social networks using shortest paths
- Statistical mechanics of complex networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The structure of scientific collaboration networks
Cited in
(3)
This page was built for publication: Sampling on bipartite networks: a comparative analysis of eight crawling methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303298)
