Jiayang Jiang
ABSTRACT
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph is known as the k-core. In this paper, we analyze parallel peeling processes, where in each round, all vertices of degree less than k are removed. It is known that, below a specific edge density threshold, the k-core is empty with high probability. We show that, with high probability, below this threshold, only 1⁄log((k-1)(r-1)) log logn+O(1) rounds of peeling are needed to obtain the empty k-core for r-uniform hypergraphs. Interestingly, we show that above this threshold, Ω(log n) rounds of peeling are required to find the non-empty k-core. Since most algorithms and data structures aim to peel to an empty k-core, this asymmetry appears fortunate. We verify the theoretical results both with simulation and with a parallel implementation using graphics processing units (GPUs). Our implementation provides insights into how to structure parallel peeling algorithms for efficiency in practice.
- D. Achlioptas and M. Molloy. The solution space geometry of random linear equations. Random Structures and Algorithms (to appear), 2013.Google Scholar
- Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal of Computing 29(1):180--200, 1999. Google ScholarDigital Library
- A. Broder, A. Frieze, and E. Upfal. On the satisfiability and maximumsatisfiability of random 3-CNF formulas. In Proc. of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 322--330,1993. Google ScholarDigital Library
- B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal.The Bloomier filter: an efficient data structure for static support lookup tables.In Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 30--39, 2004. Google ScholarDigital Library
- F. Chung and L. Lu.Concentration inequalities and martingale inequalities: a survey. Internet Mathematics, 3(1):79--127, 2006.Google ScholarCross Ref
- M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari,R. Pagh, and M. Rink. Tight thresholds for cuckoo hashing viaXORSAT. In Proc. of ICALP, pp. 213--225, 2010. Google ScholarDigital Library
- D. Eppstein, M. Goodrich, F Uyeda, and G. Varghese. What's the Difference? Efficient Set Reconciliation without Prior Context.\textitACM SIGCOMM Computer Communications Review (SIGCOMM 2011), 41(4):218--229, 2011. Google ScholarDigital Library
- P. Gao.Analysis of the parallel peeling algorithm: a short proof.pharXiv:1402.7326, 2014.Google Scholar
- M. Goodrich and M. Mitzenmacher. Invertible Bloom Lookup Tables. Proc. of the 49th Allerton Conference, pp. 792--799, 2011.Google ScholarCross Ref
- J. Jiang, M. Mitzenmacher, J. Thaler.Parallel Peeling Algorithms. CoRR abs/1302.7014, 2013. Google ScholarDigital Library
- R. Karp, M. Luby, and F. Meyer auf der Heide.Efficient PRAM simulation on a distributed memory machine. Algorithmica, 16(4):517--542, 1996.Google ScholarCross Ref
- A. Kirsch, M. Mitzenmacher, and U. Wieder.More robust hashing: Cuckoo hashing with a stash. SIAM Journal on Computing, 39(4):1543--1561, 2009. Google ScholarDigital Library
- L. Le Cam.An approximation theorem for the Poisson binomial distribution. Pacific Journal of Mathematics 10(4):1181--1197, 1960.Google ScholarCross Ref
- M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman.Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2):569--584, 2001. Google ScholarDigital Library
- M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10):1094--1104, 2001. Google ScholarDigital Library
- M. Mitzenmacher and E. Upfal. Probability and computing: Randomized algorithms and probabilistic analysis, 2005, Cambridge University Press. Google ScholarDigital Library
- M. Mitzenmacher and G. Varghese. Biff (Bloom filter) codes: Fasterror correction for large data sets. In Proc. of the IEEE International Symposium on Information Theory, pp. 483--487, 2012.Google ScholarCross Ref
- M. Mitzenmacher and B. Vöcking.The asymptotics of selecting the shortest of two, improved. Proc. of the 37th Annual Allerton Conference on Communication Control and Computing,pp. 326--327, 1999.Google Scholar
- M. Molloy. The pure literal rule threshold and cores in randomhypergraphs. IntextitProc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 672--681, 2004. Google ScholarDigital Library
- A. Pagh and F. Rodler. Cuckoo hashing.textJournal of Algorithms,51(2):122--144, 2004. Google ScholarDigital Library
- B. Vöcking.How asymmetry helps load balancing, Journal of the ACM, 50(4):568--589, 2003. Google ScholarDigital Library
- U. Voll.Threshold Phenomena in Branching Trees and Sparse Random Graphs.Dissertation. Techischen Universitat München. 2001.Google Scholar
Index Terms
- Parallel peeling algorithms
Recommendations
Parallel Peeling Algorithms
Special Issue for SPAA 2014The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph is known as ...
Parallel algorithms for P4-comparability graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of such a graph. ...
Efficient Parallel Algorithms for Chordal Graphs
We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a ...
Comments