{"id":"https://openalex.org/W6960639088","doi":"https://doi.org/10.13016/4gli-r3pp","title":"STATISTICAL INFERENCE ACROSS MULTIPLE NETWORKS: ADVANCEMENTS IN MULTIPLEX GRAPH MATCHING AND JOINT SPECTRAL NETWORK EMBEDDINGS","display_name":"STATISTICAL INFERENCE ACROSS MULTIPLE NETWORKS: ADVANCEMENTS IN MULTIPLEX GRAPH MATCHING AND JOINT SPECTRAL NETWORK EMBEDDINGS","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6960639088","doi":"https://doi.org/10.13016/4gli-r3pp"},"language":"en","primary_location":{"id":"doi:10.13016/4gli-r3pp","is_oa":true,"landing_page_url":"https://doi.org/10.13016/4gli-r3pp","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.13016/4gli-r3pp","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pantazis, Konstantinos","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pantazis, Konstantinos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T13238","display_name":"Botanical Studies and Applications","score":0.1899999976158142,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13238","display_name":"Botanical Studies and Applications","score":0.1899999976158142,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10012","display_name":"Genetic diversity and population structure","score":0.12409999966621399,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12370","display_name":"Advances in Cucurbitaceae Research","score":0.07750000059604645,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.7470999956130981},{"id":"https://openalex.org/keywords/multiplex","display_name":"Multiplex","score":0.7372000217437744},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5131000280380249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49540001153945923},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49239999055862427},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.40720000863075256},{"id":"https://openalex.org/keywords/statistical-inference","display_name":"Statistical inference","score":0.39469999074935913},{"id":"https://openalex.org/keywords/network-analysis","display_name":"Network analysis","score":0.3720000088214874},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.35659998655319214}],"concepts":[{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.7470999956130981},{"id":"https://openalex.org/C2781188995","wikidata":"https://www.wikidata.org/wiki/Q6934982","display_name":"Multiplex","level":2,"score":0.7372000217437744},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6626999974250793},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5131000280380249},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49540001153945923},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49239999055862427},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.44749999046325684},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.40720000863075256},{"id":"https://openalex.org/C134261354","wikidata":"https://www.wikidata.org/wiki/Q938438","display_name":"Statistical inference","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3853999972343445},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.3474000096321106},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2802000045776367},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2800000011920929},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.26330000162124634},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.257099986076355}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.13016/4gli-r3pp","is_oa":true,"landing_page_url":"https://doi.org/10.13016/4gli-r3pp","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.13016/4gli-r3pp","is_oa":true,"landing_page_url":"https://doi.org/10.13016/4gli-r3pp","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Networks":[0],"are":[1,26,324,398,406],"commonly":[2],"used":[3],"to":[4,87,184,219,228,262,361,408],"model":[5],"and":[6,85,92,124,209,280,290,294,377,395,442,452,486],"study":[7,88],"complex":[8,42],"systems":[9],"that":[10,120,170,272,491,501],"arise":[11],"in":[12,139,168,195,235,269,292,391,413,421],"a":[13,29,34,71,113,159,164,172,189,196,247,263,275,307,319,328,334,480,508,513,530],"variety":[14],"of":[15,28,31,60,63,102,136,146,154,161,187,214,242,285,302,321,346,354,418,429,457,475,515,525,533],"scientific":[16],"domains.One":[17],"important":[18,522],"network":[19,49,61,66,90,117,127,194,222,227,314,366,370,374,402,450,455],"data":[20,44,296],"modality":[21],"is":[22,181,244,378,384,426],"multiplex":[23,75,162,178,192,198,248],"networks":[24,32,39,323],"which":[25,202,256,338,392,425],"comprised":[27],"collection":[30,320,345,367,514],"over":[33],"common":[35,329],"vertex":[36],"set.":[37],"Multiplex":[38],"can":[40,50,257,445],"describe":[41],"relational":[43],"where":[45,239,527],"edges":[46],"within":[47],"each":[48,100],"encode":[51],"different":[52,365],"relationship":[53],"or":[54,265],"interaction":[55],"types.":[56],"With":[57],"the":[58,103,134,140,143,147,151,156,185,204,210,220,225,231,236,240,260,270,283,299,303,340,343,352,386,416,422,437,440,462,472,476,505,536],"rise":[59],"modeling":[62],"complex,":[64],"multi-sample":[65,126],"data,":[67,375,451],"there":[68],"has":[69,105],"been":[70],"recent":[72],"emphasis":[73],"on":[74,96],"inference":[76,95,118,152,447],"methods.":[77],"In":[78,142,298,471],"this":[79],"thesis,":[80,148,304,477],"we":[81,149,281,305,405,453,478,487,518,528],"develop":[82],"novel":[83],"theory":[84],"methodology":[86],"underlying":[89],"structures":[91],"perform":[93],"statistical":[94,393],"multiple":[97,221],"networks.":[98,347,516,537],"While":[99],"chapter":[101],"thesis":[104],"its":[106],"own":[107],"individual":[108],"merit,":[109],"synergistically":[110],"they":[111],"constitute":[112],"coherent":[114],"multi-scale":[115,312],"spectral":[116,313],"framework":[119,180,208],"accounts":[121],"for":[122,230,311,448,466],"unlabeled":[123],"correlated":[125,401,449,469],"data.":[128,175,470],"Together,":[129],"these":[130],"results":[131],"significantly":[132],"extend":[133],"reach":[135],"such":[137,460],"procedures":[138],"literature.":[141],"first":[144,387],"part":[145,301,474],"consider":[150,479],"task":[153,186],"aligning":[155],"vertices":[157],"across":[158,342,400,512,535],"pair":[160],"networks,":[163],"key":[165],"algorithmic":[166],"step":[167],"routines":[169],"assume":[171],"priori":[173],"node-aligned":[174,322],"This":[176],"general":[177],"matching":[179,207,250,278],"then":[182],"adapted":[183],"detecting":[188],"noisy":[190],"induced":[191,419,438],"template":[193,226,261],"larger":[197],"background":[199,237,271],"network.Our":[200],"methodology,":[201],"lifts":[203],"classical":[205,458],"graph":[206,249,277],"matched":[211],"filters":[212],"method":[213,383],"Sussman":[215],"et":[216,356],"al.":[217,357],"(2018)":[218],"setting,":[223],"uses":[224],"search":[229],"``most\"":[232],"similar":[233],"subgraph(s)":[234],"network,":[238],"notion":[241],"similarity":[243],"measured":[245],"via":[246],"distance.":[251],"We":[252,433],"present":[253,306,488],"an":[254,427,489,521],"algorithm":[255,490],"efficiently":[258],"match":[259],"(induced":[264],"not":[266],"induced)":[267],"subgraph":[268],"approximately":[273],"minimizes":[274],"suitable":[276],"distance,":[279],"demonstrate":[282],"effectiveness":[284],"our":[286,316,382,414],"approach":[287],"both":[288,436],"theoretically":[289,379,520],"empirically":[291],"synthetic":[293],"real-world":[295],"settings.":[297],"second":[300],"joint":[308,388,430],"embedding":[309,333,389,431,499],"procedure":[310],"inference.In":[315],"proposed":[317],"framework,":[318],"jointly":[325,498],"embedded":[326,423,506],"into":[327],"Euclidean":[330],"space":[331],"by":[332],"specialized":[335],"omnibus":[336,494],"matrix":[337,495],"contains":[339],"information":[341],"entire":[344],"Our":[348],"approach---which":[349],"builds":[350],"upon":[351],"work":[353],"Levin":[355],"(2017)---is":[358],"flexible":[359],"enough":[360],"faithfully":[362],"embed":[363],"many":[364],"types":[368],"(e.g.,":[369],"time-series":[371],"data;":[372],"test-retest":[373],"etc.)":[376],"tractable.":[380],"Indeed,":[381],"among":[385],"methods":[390],"consistency":[394],"asymptotic":[396],"normality":[397],"established":[399],"collections.":[403],"Moreover,":[404,517],"able":[407],"identify":[409],"(and":[410],"fully":[411],"analyze":[412,519],"setting)":[415],"phenomenon":[417],"correlation":[420,444,510,534],"space,":[424],"artifact":[428],"methodologies.":[432],"examine":[434],"how":[435],"(by":[439],"method)":[441],"inherent":[443],"impact":[446],"provide":[454],"analogues":[456],"questions":[459],"as":[461],"effective":[463],"sample":[464],"size":[465],"more":[467],"generally":[468],"final":[473],"constrained":[481],"optimization":[482],"problem":[483],"called":[484],"corr2OMNI,":[485],"approximates":[492],"generalized":[493],"structure":[496,511],"(for":[497],"networks)":[500],"best":[502],"preserve":[503],"(in":[504],"space)":[507],"given":[509],"special":[523],"case":[524],"corr2OMNI":[526],"desire":[529],"fixed":[531],"level":[532]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}