Graph Ranking and the Cost of Sybil Defense-Reference-Cited by-同舟云学术

Graph Ranking and the Cost of Sybil Defense

Published:2023-07-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Farach-Colton Gwendolyn¹^ORCID,Farach-Colton Martin¹^ORCID,Goldberg Leslie Ann²^ORCID,Komlos Hanna³^ORCID,Lapinskas John⁴^ORCID,Levi Reut⁵^ORCID,Medina Moti⁶^ORCID,Mosteiro Miguel A.⁷^ORCID

Affiliation:

1. Rutgers University, New Brunswick, USA

2. University of Oxford, Oxford, United Kingdom

3. Rutgers University, New Brunswick, United States of America

4. Bristol University, Bristol, United Kingdom

5. Reichman University, Herzliya, Israel

6. Bar Ilan University, Ramat Gan, Israel

7. Pace University, New York, United States of America

Funder

National Science Foundation

Israel Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580507.3597782

Reference54 articles.

1. Louigi Addario-Berry and Tao Lei . 2012 . The mixing time of the Newman-Watts small world . In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1661--1668 . Louigi Addario-Berry and Tao Lei. 2012. The mixing time of the Newman-Watts small world. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1661--1668.

2. Réka Albert , Hawoong Jeong , and Albert-László Barabási . 1999. Diameter of the world-wide web. nature 401, 6749 ( 1999 ), 130. Réka Albert, Hawoong Jeong, and Albert-László Barabási. 1999. Diameter of the world-wide web. nature 401, 6749 (1999), 130.

3. Communities, random walks, and social Sybil defense;Alvisi Lorenzo;Internet Mathematics,2014

4. Robust PageRank and locally computable spam detection features