18 citations · 18 across the 2 of their papers we have counts for
2 papers
cs.DS2017
Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams
Lorenzo De Stefani, Erisa Terolli, Eli Upfal
We introduce Tiered Sampling, a novel technique for approximate counting sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single…
cs.SI2016★ 18 cited
The Limits of Popularity-Based Recommendations, and the Role of Social Ties
Marco Bressan, Stefano Leucci, Alessandro Panconesi +2
In this paper we introduce a mathematical model that captures some of the salient features of recommender systems that are based on popularity and that try to exploit social ties a…