no code implementations • 10 Feb 2023 • Miklós Z. Rácz, Anirudh Sridhar
We consider the task of estimating the latent vertex correspondence between two edge-correlated random graphs with generic, inhomogeneous structure.
1 code implementation • 8 Aug 2022 • Sérgio Machado, Anirudh Sridhar, Paulo Gil, Jorge Henriques, José M. F. Moura, Augusto Santos
This renders the features amenable to train a variety of classifiers to perform causal inference.
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.