250 citations · 1.1k across the 76 of their papers we have counts for
7 papers · 1 filter
Predicting Signed Edges with Queries
Michael Mitzenmacher, Charalampos E. Tsourakakis
Social networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges correspond to p…
Analyzing Distributed Join-Idle-Queue: A Fluid Limit Approach
Michael Mitzenmacher
In the context of load balancing, Lu et al. introduced the distributed Join-Idle-Queue algorithm, where a group of dispatchers distribute jobs to a cluster of parallel servers. Eac…
Scalable motif-aware graph clustering
Charalampos Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
We develop new methods based on graph motifs for graph clustering, allowing more efficient detection of communities within networks. We focus on triangles within graphs, but our te…
Models and Algorithms for Graph Watermarking
David Eppstein, Michael T. Goodrich, Jenny Lam +3
We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking…
Voronoi Choice Games
Meena Boppana, Rani Hod, Michael Mitzenmacher +1
We study novel variations of Voronoi games and associated random processes that we call Voronoi choice games. These games provide a rich framework for studying questions regarding…
Better bounds for coalescing-branching random walks
Michael Mitzenmacher, Rajmohan Rajaraman, Scott Roche
Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spre…