no code implementations • 29 Mar 2022 • Julia Gaudio, Miklos Z. Racz, Anirudh Sridhar
In particular, we uncover and characterize a region of the parameter space where exact community recovery is possible using multiple correlated graphs, even though (1) this is information-theoretically impossible using a single graph and (2) exact graph matching is also information-theoretically impossible.
no code implementations • NeurIPS 2021 • Miklos Z. Racz, Anirudh Sridhar
We consider the task of learning latent community structure from multiple correlated networks.
no code implementations • 12 Dec 2020 • Sami Davies, Miklos Z. Racz, Cyrus Rashtchian, Benjamin G. Schiffer
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length $n$ after it passes through a deletion channel many times independently, producing a set of traces (i. e., random subsequences of the string).
2 code implementations • 18 Mar 2020 • Mayee F. Chen, Miklos Z. Racz
Motivated by this reality, we introduce a simple model of network disruption where an adversary can take over a limited number of user profiles in a social network with the aim of maximizing disagreement and/or polarization in the network.
Social and Information Networks Data Structures and Algorithms Computer Science and Game Theory Physics and Society