Wedge sampling for computing clustering coefficients and triangle counts on large graphs†

DOI10.1002/SAM.11224MaRDI QIDQ4969952zbMATH OpenOpenAlexFDO

Authors C. Seshadhri, Ali Pinar, Tamara G. Kolda

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.3321

zbMATH Keywords

clustering coefficientsdirected trianglestriangle characteristicstriangle countingwedge sampling

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cited in

(8)

• Trigger detection for adaptive scientific workflows using percentile sampling
• On the Complexity of Sampling Vertices Uniformly from a Graph
• A Fast Counting Method for 6-Motifs with Low Connectivity
• On the efficacy of higher-order spectral clustering under weighted stochastic block models
• Estimating the clustering coefficient using sample complexity analysis
• A class of logarithmic exponential estimators for estimating average degree of a network using triangular graph sampling
• Counting simplices in hypergraph streams
• Towards optimal dynamic indexes for approximate (and exact) triangle counting

This page was built for publication: Wedge sampling for computing clustering coefficients and triangle counts on large graphs^†

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