Search Results for author:
Found 4 papers, 1 papers with code
Exact Community Recovery in Correlated Stochastic Block Models
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.
Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
We consider the task of learning latent community structure from multiple correlated networks.
Approximate Trace Reconstruction
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).
Network disruption: maximizing disagreement and polarization in social networks
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
