Framework and algorithms for network bucket testing

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web

Volumn , Issue , 2012, Pages 1029-1036

  Katzir, Liran ^a   Liberty, Edo ^a   Somekh, Oren ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

A b testing; Bucket testing; Network bucket testing; Social networks; Unbiased estimation

Indexed keywords

FRAMEWORK AND ALGORITHMS; NEW SERVICES; RANDOM USERS; RATE ESTIMATOR; SAMPLING ALGORITHM; SAMPLING TECHNIQUE; SOCIAL NETWORKS; SOCIAL SERVICE; THEORETICAL RESULT; UNBIASED ESTIMATION; UNIFORM SAMPLING; USER SATISFACTION; USER SATISFACTION FUNCTION;

LEARNING ALGORITHMS; SOCIAL NETWORKING (ONLINE);

WORLD WIDE WEB;

EID: 84860857419     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187836.2187974     Document Type: Conference Paper

References (9)

1. Lars Backstrom and Jon M. Kleinberg. Network bucket testing. In WWW, pages 615-624, 2011.
2. 1/4) approximation for densest k-subgraph. In STOC, pages 201-210, 2010.
3. Moses Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, pages 84-95, 2000.
4. Uriel Feige, Guy Kortsarz, and David Peleg. The dense k-subgraph problem. Algorithmica, 29:2001, 1999.
5. Minas Gjoka, Maciej Kurant, Carter T. Butts, and Athina Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proceedings of IEEE INFOCOM'10, San Diego, CA, March 2010.
6. L. Lovasz. Random walks on graphs. a survey. Combinatorics, 1993.
7. David Gibson Ravi, Ravi Kumar, and Andrew Tomkins. Discovering large dense subgraphs in massive graphs. In In VLDB'05: Proceedings of the 31st international conference on Very large data bases, pages 721-732, 2005.
8. Albert Reka and Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74:47-97, June 2002.
9. D. J. Watts and S. H. Strogatz. Collective dynamics of'small- world'networks. Nature, 393(6684):440-442, June 1998.