18 citations · 58 across the 16 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2017
On approximating the stationary distribution of time-reversible Markov chains
Marco Bressan, Enoch Peserico, Luca Pretto
Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches requi…
cs.DM2016★ 1 cited
The Power of Local Information in PageRank
Marco Bressan, Enoch Peserico, Luca Pretto
How large a fraction of a graph must one explore to rank a small set of nodes according to their PageRank scores? We show that the answer is quite nuanced, and depends crucially on…
cs.DM2015★ 8 cited
Simple set cardinality estimation through random sampling
Marco Bressan, Enoch Peserico, Luca Pretto
We present a simple algorithm that estimates the cardinality of a set when allowed to sample elements of uniformly and independently at random. Our algorithm with proba…