{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T11:13:18Z","timestamp":1771585998576,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8636015","type":"proceedings-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T03:04:31Z","timestamp":1551409471000},"page":"1028-1035","source":"Crossref","is-referenced-by-count":4,"title":["Matching Graphs with Community Structure: A Concentration of Measure Approach"],"prefix":"10.1109","author":[{"given":"Farhad","family":"Shirani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddharth","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elza","family":"Erkip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref11","article-title":"Exact alignment recovery for correlated erdos renyi graphs","author":"cullina","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437567"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660324"},{"key":"ref15","article-title":"Significance of side information in the graph matching problem","author":"singhal","year":"2017","journal-title":"arXiv preprint arXiv 1706 06936"},{"key":"ref16","volume":"100","author":"isaacs","year":"1994","journal-title":"Algebra A Graduate Course"},{"key":"ref17","author":"csisz\u00e1r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref4","author":"kazemi","year":"2016","journal-title":"Network alignment Theory algorithms and applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.01.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736720"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref8","article-title":"Exact alignment recovery for correlated erdos renyi graphs","author":"cullina","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref2","article-title":"Random graphs. 2001","author":"bollob\u00e1s","year":"2001","journal-title":"Cambridge Studies in Advanced Mathematics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref9","article-title":"Information recovery in shuffled graphs via graph matching","author":"lyzinski","year":"2016","journal-title":"arXiv preprint arXiv 1605 01584"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2018,10,2]]},"end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08636015.pdf?arnumber=8636015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:04:04Z","timestamp":1598238244000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8636015\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8636015","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}