Communities, Random Walks, and Social Sybil Defense

DOI10.1080/15427951.2013.865685zbMath1461.68020OpenAlexW2032158229WikidataQ60125579 ScholiaQ60125579MaRDI QIDQ4985360

Allen Clement, Lorenzo Alvisi, Alessandro Panconesi, Alessandro Epasto, Silvio Lattanzi

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2013.865685

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Network protocols (68M12) Internet topics (68M11) Random walks on graphs (05C81) Computer security (68M25)

Related Items (2)

Resource Burning for Permissionless Systems (Invited Paper) ⋮ Interactive proofs for social graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Using PageRank to Locally Partition a Graph
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Finding sparse cuts locally using evolving sets
• Collective dynamics of ‘small-world’ networks
• Machine Learning: ECML 2004
• Probability and Computing
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Concentration of Measure for the Analysis of Randomized Algorithms
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: Communities, Random Walks, and Social Sybil Defense