Counting Motifs with Graph Sampling

Keyphrases

• Graph Sampling 100%
• Neighborhood Sampling 75%
• Parent Graph 50%
• Adaptation 25%
• Copy number 25%
• Algebraic Properties 25%
• Optimal Sample Size 25%
• Tree Graph 25%
• Sampling Rate 25%
• Sampling Scheme 25%
• Statistical Aspects 25%
• Universally Optimal 25%
• Maximum Degree 25%
• Induced Subgraph 25%
• Planar Graph 25%
• Maximal Degree 25%
• Minimax Lower Bound 25%
• Subgraph Counting 25%
• Multiplicative Error 25%
• Structure Diagram 25%
• Family of Estimators 25%
• Horvitz-Thompson 25%
• Vertex Sampling 25%
• Horvitz-Thompson Estimator 25%
• Parental Networks 25%

Mathematics

• Induced Subgraph 100%
• Edge 50%
• Probability Theory 50%
• Random Sample 50%
• Algebraic Property 50%
• Real-World Data 50%
• Sampling Scheme 50%
• Minimax 50%
• Clique 50%
• Type Estimator 50%
• Multiplicative 50%
• Maximum Degree 50%
• Planar Graph 50%
• Thompson Estimator 50%