6 citations · 7 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 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
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…