Abstract
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-Rényi graphs. However, very little is known about the existence of efficient algorithms to achieve graph alignment without seeds. In this work we identify a region in which a straightforward O(n11/5 log n)-time canonical labeling algorithm, initially introduced in the context of graph isomorphism, succeeds in aligning correlated Erdos-Rényi graphs. The algorithm has two steps. In the first step, all vertices are labeled by their degrees and a trivial minimum distance alignment (i.e., sorting vertices according to their degrees) matches a fixed number of highest degree vertices in the two graphs. Having identified this subset of vertices, the remaining vertices are matched using a alignment algorithm for bipartite graphs. Finally, we show that the implementation of a variant of this algorithm allows for the efficient alignment of large graphs under limited noise.
- Y. Tian and J. Patel, "TALE: A Tool for Approximate Large Graph Matching," Data Engineering, International Conference on, vol. 0, pp. 963--972, 2008. Google Scholar
Digital Library
- S. Zhang, J. Yang, and W. Jin, "SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs," PVLDB, vol. 3, no. 1, pp. 1185--1194, 2010. Google Scholar
Digital Library
- F. Shirani, S. Garg, and E. Erkip, "An information theoretic framework for active de-anonymization in social networks based on group memberships," 2017.Google Scholar
Digital Library
- E. Onaran, S. Garg, and E. Erkip, "Optimal de-anonymization in random graphs with community structure," in 2016 50th Asilomar Conference on Signals, Systems and Computers, pp. 709--713, IEEE, 2016.Google Scholar
- L. Fu, X. Fu, Z. Hu, Z. Xu, and X. Wang, "De-anonymization of social networks with communities: When quantifications meet algorithms," 2017.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, vol. 105, no. 35, pp. 12763--12768, 2008.Google Scholar
Cross Ref
- O. Kuchaiev, T. Milenković, V. Memivs ević, W. Hayes, and N. Prvz ulj, "Topological network alignment uncovers biological function and phylogeny," Journal of the Royal Society Interface, pp. 1341--1354, 2010.Google Scholar
Cross Ref
- N. Malod-Dognin and N. Prvz ulj, "L-GRAAL: Lagrangian graphlet-based network aligner," Bioinformatics, vol. 31, no. 13, pp. 2182--2189, 2015.Google Scholar
Cross Ref
- V. Saraph and T. Milenković, "Magna: Maximizing accuracy in global network alignment," Bioinformatics, vol. 30, no. 20, pp. 2931--2940, 2014.Google Scholar
Cross Ref
- A. E. Aladag and C. Erten, "SPINAL: scalable protein interaction network alignment," Bioinformatics, vol. 29, no. 7, pp. 917--924, 2013. Google Scholar
Digital Library
- L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore art thou r3579x?," Communications of the ACM, vol. 54, p. 133, dec 2011. Google Scholar
Digital Library
- 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," in Proceedings 2015 Network and Distributed System Security Symposium, Internet Society, 2015.Google Scholar
- A. Narayanan and V. Shmatikov, "Robust de-anonymization of large sparse datasets," in 2008 IEEE Symposium on Security and Privacy (sp 2008), IEEE, May 2008. Google Scholar
Digital Library
- N. Korula and S. Lattanzi, "An efficient reconciliation algorithm for social networks," Proceedings of the VLDB Endowment, vol. 7, pp. 377--388, Jan 2014. Google Scholar
Digital Library
- E. Mossel and J. Xu, "Seeded graph matching via large neighborhood statistics," in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1005--1014, SIAM, 2019. Google Scholar
Digital Library
- L. Yartseva and M. Grossglauser, "On the performance of percolation graph matching," in Proceedings of the first ACM conference on Online social networks - COSN 2013, ACM Press, 2013. Google Scholar
Digital Library
- E. Kazemi, S. H. Hassani, and M. Grossglauser, "Growing a graph matching from a handful of seeds," Proceedings of the VLDB Endowment, vol. 8, pp. 1010--1021, jun 2015. Google Scholar
Digital Library
- K. Henderson, B. Gallagher, L. Li, L. Akoglu, T. Eliassi-Rad, H. Tong, and C. Faloutsos, "It's who you know," in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 2011, ACM Press, 2011.Google Scholar
- 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, pp. 1598--1607, IEEE, 2013.Google Scholar
Cross Ref
- 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
- M. Mitzenmacher and T. Morgan, "Reconciling graphs and sets of sets," 2017.Google Scholar
- 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, pp. 1235--1243, ACM, 2011. Google Scholar
Digital Library
- D. Cullina and N. Kiyavash, "Improved achievability and converse bounds for erdos-renyi graph matching," in Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS 2016, ACM Press, 2016.Google Scholar
- D. Cullina and N. Kiyavash, "Exact alignment recovery for correlated erdos renyi graphs," CoRR, vol. abs/1711.06783, 2017.Google Scholar
- L. Babai, P. ErdHo s, and S. M. Selkow, "Random graph isomorphism," SIAM Journal on Computing, vol. 9, pp. 628--635, aug 1980.Google Scholar
Digital Library
- B. Bollobas, Random Graphs. Cambridge University Press, 2001.Google Scholar
Cross Ref
- S. Feizi, G. Quon, M. Recamonde-Mendoza, M. Medard, M. Kellis, and A. Jadbabaie, "Spectral alignment of graphs," arXiv preprint arXiv:1602.04181, 2016.Google Scholar
Index Terms
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs
Recommendations
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
SIGMETRICSWe 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. ...
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-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 informationtheoretic threshold for graph alignment in correlated Erdős-...
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs
SIGMETRICS '19: Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsGraph 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-...






Comments