{"id":"https://openalex.org/W7140116349","doi":"https://doi.org/10.48550/arxiv.2603.19955","title":"Structural Controllability of Large-Scale Hypergraphs","display_name":"Structural Controllability of Large-Scale Hypergraphs","publication_year":2026,"publication_date":"2026-03-20","ids":{"openalex":"https://openalex.org/W7140116349","doi":"https://doi.org/10.48550/arxiv.2603.19955"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.19955","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19955","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.19955","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130336010","display_name":"Joshua Pickard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pickard, Joshua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130373226","display_name":"Xin Mao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mao, Xin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130343746","display_name":"Can Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Can","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":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.1565999984741211,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.1565999984741211,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1404999941587448,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.1354999989271164,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8069999814033508},{"id":"https://openalex.org/keywords/controllability","display_name":"Controllability","score":0.6984999775886536},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.532800018787384},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5151000022888184},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49729999899864197},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4645000100135803},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.4494999945163727},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.447299987077713},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.414000004529953},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4068000018596649}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8069999814033508},{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.6984999775886536},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.532800018787384},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5151000022888184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5037000179290771},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3804999887943268},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3562000095844269},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C41982775","wikidata":"https://www.wikidata.org/wiki/Q7000977","display_name":"Network controllability","level":4,"score":0.328900009393692},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3248000144958496},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C114275822","wikidata":"https://www.wikidata.org/wiki/Q621512","display_name":"Linear dynamical system","level":3,"score":0.29179999232292175},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.25270000100135803},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.19955","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19955","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.19955","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19955","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Controlling":[0],"real-world":[1],"networked":[2],"systems,":[3],"including":[4],"ecological,":[5],"biomedical,":[6],"and":[7,20,79,89,103,130,156,173],"engineered":[8],"networks":[9],"that":[10],"exhibit":[11],"higher-order":[12,174],"interactions,":[13],"remains":[14],"challenging":[15],"due":[16],"to":[17,85,134,169],"inherent":[18],"nonlinearities":[19],"large":[21],"system":[22],"scales.":[23],"Despite":[24],"extensive":[25],"studies":[26],"on":[27,42,119,165],"graph":[28],"controllability,":[29,44],"the":[30,96,120,154,159],"controllability":[31,59,129],"properties":[32],"of":[33,77,100,123,158,171],"hypergraphs":[34,62,166],"remain":[35],"largely":[36],"underdeveloped.":[37],"Existing":[38],"results":[39],"focus":[40],"primarily":[41],"exact":[43],"which":[45,95],"is":[46],"often":[47],"impractical":[48],"for":[49,61,107,127],"large-scale":[50],"hypergraphs.":[51],"In":[52,71],"this":[53,132],"article,":[54],"we":[55,73],"develop":[56],"a":[57,91,115,136],"structural":[58,128],"framework":[60,161],"by":[63],"modeling":[64],"hypergraph":[65,87],"dynamics":[66,88],"as":[67],"polynomial":[68,86],"dynamical":[69],"systems.":[70],"particular,":[72],"extend":[74],"classical":[75,101],"notions":[76],"accessibility":[78,150],"dilation":[80],"from":[81],"linear":[82],"graph-based":[83],"systems":[84],"establish":[90],"hypergraph-based":[92],"criterion":[93],"under":[94],"topology":[97],"guarantees":[98],"satisfaction":[99],"Lie-algebraic":[102],"Kalman-type":[104],"rank":[105],"conditions":[106],"almost":[108],"all":[109],"parameter":[110],"choices.":[111],"We":[112,152],"further":[113],"derive":[114],"topology-based":[116],"lower":[117],"bound":[118,133],"minimum":[121],"number":[122],"driver":[124,138],"nodes":[125,172],"required":[126],"leverage":[131],"design":[135],"scalable":[137],"node":[139],"selection":[140],"algorithm":[141],"combining":[142],"dilation-aware":[143],"initialization":[144],"via":[145],"maximum":[146],"matching":[147],"with":[148,167],"greedy":[149],"expansion.":[151],"demonstrate":[153],"effectiveness":[155],"scalability":[157],"proposed":[160],"through":[162],"numerical":[163],"experiments":[164],"tens":[168],"thousands":[170],"interactions.":[175]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-24T00:00:00"}