Abstract
We determine information theoretic conditions under which it is possible to partially recover the alignment used to generate a pair of sparse, correlated Erdos-Renyi graphs. To prove our achievability result, we introduce the k-core alignment estimator. This estimator searches for an alignment in which the intersection of the correlated graphs using this alignment has a minimum degree of k. We prove a matching converse bound. As the number of vertices grows, recovery of the alignment for a fraction of the vertices tending to one is possible when the average degree of the intersection of the graph pair tends to infinity. It was previously known that exact alignment is possible when this average degree grows faster than the logarithm of the number of vertices.
- E. M. Wright, “Graphs on unlabelled nodes with a given number of edges,” Acta Mathematica, vol. 126, no. 1, pp. 1--9, 1971.Google Scholar
Cross Ref
- P. Pedarsani and M. Grossglauser, “On the privacy of anonymized networks,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. hskip 1em plus 0.5em minus 0.4emrelax ACM, 2011, pp. 1235--1243.Google Scholar
Digital Library
- BIBentryALTinterwordspacingD. Cullina and N. Kiyavash, “Exact alignment recovery for correlated ErdHos Rényi graphs,” arXiv:1711.06783 [cs, math], Nov. 2017, arXiv: 1711.06783. [Online]. Available: http://arxiv.org/abs/1711.06783BIBentrySTDinterwordspacingGoogle Scholar
- ----, “Improved achievability and converse bounds for ErdHos-Rényi graph matching,” in Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science .hskip 1em plus 0.5em minus 0.4emrelax ACM, 2016, pp. 63--72.Google Scholar
Digital Library
- E. Kazemi, L. Yartseva, and M. Grossglauser, “When Can Two Unlabeled Networks Be Aligned Under Partial Overlap” in Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing, 2015.Google Scholar
Cross Ref
- F. Shirani, S. Garg, and E. Erkip, “Typicality Matching for Pairs of Correlated Graphs,” arXiv preprint arXiv:1802.00918, 2018.Google Scholar
- BIBentryALTinterwordspacingD. Cullina, P. Mittal, and N. Kiyavash, “Fundamental Limits of Database Alignment,” arXiv:1805.03829 [cs, math], May 2018, arXiv: 1805.03829. [Online]. Available: http://arxiv.org/abs/1805.03829BIBentrySTDinterwordspacingGoogle Scholar
- S. Ji, W. Li, N. Z. Gong, P. Mittal, and R. Beyah, “On Your Social Network De-anonymizablity: Quantification and Large Scale Evaluation with Seed Knowledge,” 2015.Google Scholar
- W.-H. Lee, C. Liu, S. Ji, P. Mittal, and R. B. Lee, “Blind de-anonymization attacks using social networks,” in Proceedings of the 2017 on Workshop on Privacy in the Electronic Society .hskip 1em plus 0.5em minus 0.4emrelax ACM, 2017, pp. 1--4.Google Scholar
Digital Library
- L. Backstrom, C. Dwork, and J. Kleinberg, “Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography,” in Proceedings of the 16th international conference on World Wide Web .hskip 1em plus 0.5em minus 0.4emrelax ACM, 2007, pp. 181--190.Google Scholar
Digital Library
- N. Korula and S. Lattanzi, “An efficient reconciliation algorithm for social networks,” Proceedings of the VLDB Endowment, vol. 7, no. 5, pp. 377--388, 2014.Google Scholar
Digital Library
- N. Malod-Dognin and N. Prulj, “L-GRAAL: Lagrangian graphlet-based network aligner,” Bioinformatics, vol. 31, no. 13, pp. 2182--2189, 2015.Google Scholar
Cross Ref
- O. Kuchaiev, T. Milenkovic, V. Memievic, W. Hayes, and N. Prulj, “Topological network alignment uncovers biological function and phylogeny,” Journal of the Royal Society Interface, p. rsif20100063, 2010.Google Scholar
- R. Singh, J. Xu, and B. Berger, “Global alignment of multiple protein interaction networks with application to functional orthology detection,” Proceedings of the National Academy of Sciences, 2008.Google Scholar
Cross Ref
- Y. Tian and J. M. Patel, “TALE: A tool for approximate large graph matching,” in Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on. hskip 1em plus 0.5em minus 0.4emrelax IEEE, 2008, pp. 963--972.Google Scholar
Digital Library
- S. Zhang, J. Yang, and W. Jin, “SAPPER: subgraph indexing and approximate matching in large graphs,” Proceedings of the VLDB Endowment, vol. 3, no. 1--2, pp. 1185--1194, 2010.Google Scholar
- L. Yartseva and M. Grossglauser, “On the performance of percolation graph matching,” in Proceedings of the first ACM conference on Online social networks. hskip 1em plus 0.5em minus 0.4emrelax ACM, 2013, pp. 119--130.Google Scholar
Digital Library
- E. Kazemi, S. H. Hassani, and M. Grossglauser, “Growing a Graph Matching from a Handful of Seeds,” in Proceedings of the Vldb Endowment International Conference on Very Large Data Bases, vol. 8, 2015.Google Scholar
Digital Library
- P. Pedarsani, D. R. Figueiredo, and M. Grossglauser, “A bayesian method for matching two similar graphs without seeds,” in Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on. hskip 1em plus 0.5em minus 0.4emrelax IEEE, 2013, pp. 1598--1607.Google Scholar
- V. Lyzinski, D. E. Fishkind, and C. E. Priebe, “Seeded graph matching for correlated Erdös-Rényi graphs.” Journal of Machine Learning Research, vol. 15, no. 1, pp. 3513--3540, 2014.Google Scholar
Digital Library
- BIBentryALTinterwordspacingS. Feizi, G. Quon, M. Recamonde-Mendoza, M. Medard, M. Kellis, and A. Jadbabaie, “Spectral Alignment of Graphs,” arXiv:1602.04181 [cs, math], Feb. 2016, arXiv: 1602.04181. [Online]. Available: http://arxiv.org/abs/1602.04181BIBentrySTDinterwordspacingGoogle Scholar
- V. Lyzinski, D. Fishkind, M. Fiori, J. Vogelstein, C. Priebe, and G. Sapiro, “Graph matching: Relax at your own risk,” IEEE Transactions on Pattern Analysis & Machine Intelligence, no. 1, pp. 1--1, 2016.Google Scholar
- B. Barak, C.-N. Chou, Z. Lei, T. Schramm, and Y. Sheng, “(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs,” arXiv preprint arXiv:1805.02349, 2018.Google Scholar
- E. Mossel and J. Xu, “Seeded Graph Matching via Large Neighborhood Statistics,” arXiv preprint arXiv:1807.10262, 2018.Google Scholar
- BIBentryALTinterwordspacingC. Moore, “BIBforeignlanguageenThe Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness ,” Feb. 2017. [Online]. Available: https://arxiv.org/abs/1702.00467BIBentrySTDinterwordspacingGoogle Scholar
- BIBentryALTinterwordspacingE. Abbe, “Community detection and stochastic block models: recent developments,” arXiv:1703.10146 [cs, math, stat], Mar. 2017, arXiv: 1703.10146. [Online]. Available: http://arxiv.org/abs/1703.10146BIBentrySTDinterwordspacingGoogle Scholar
- BIBentryALTinterwordspacingY. Wu and J. Xu, “Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits,” arXiv:1806.00118 [cs, math, stat], May 2018, arXiv: 1806.00118. [Online]. Available: http://arxiv.org/abs/1806.00118BIBentrySTDinterwordspacingGoogle Scholar
- B. Bollobás, The evolution of sparse graphs, Graph Theory and Combinatorics (Cambridge 1983), 35--57. hskip 1em plus 0.5em minus 0.4emrelax Academic Press, London, 1984.Google Scholar
- T. Łuczak, “Size and connectivity of the k-core of a random graph,” Discrete Mathematics, vol. 91, no. 1, pp. 61--68, 1991.Google Scholar
Digital Library
Index Terms
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
Recommendations
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs
Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-...
Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment
We determine information theoretic conditions under which it is possible to partially recover the alignment used to generate a pair of sparse, correlated Erdős-Rényi graphs. To prove our achievability result, we introduce the k-core alignment estimator. ...
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
Performance evaluation reviewWe consider the problem of perfectly recovering the vertex correspondence between two correlated Erdos-Renyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured by randomly ...






Comments