Inspired by the recent studies on the analysis of biased random walk behavior of Escherichia coli[Passino, K.M., 2002. Biomimicry of bacterial foraging for distributed optimizatio...
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...