{"id":"https://openalex.org/W7155563551","doi":"https://doi.org/10.48550/arxiv.2604.21504","title":"Efficient generation of expected-degree graphs via edge-arrivals","display_name":"Efficient generation of expected-degree graphs via edge-arrivals","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7155563551","doi":"https://doi.org/10.48550/arxiv.2604.21504"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.21504","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21504","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"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.2604.21504","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050291532","display_name":"Gianlorenzo D\u2019Angelo","orcid":"https://orcid.org/0000-0003-0377-7037"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D'Angelo, Gianlorenzo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033053891","display_name":"Riccardo Michielan","orcid":"https://orcid.org/0000-0003-4642-8507"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michielan, Riccardo","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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.2791000008583069,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.2791000008583069,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.10790000110864639,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.08730000257492065,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.6711000204086304},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.545799970626831},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5049999952316284},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.49410000443458557},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44839999079704285},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4214000105857849},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4009999930858612},{"id":"https://openalex.org/keywords/random-regular-graph","display_name":"Random regular graph","score":0.37929999828338623}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.6711000204086304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5989000201225281},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5827999711036682},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.545799970626831},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5049999952316284},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.49410000443458557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46869999170303345},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44839999079704285},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39320001006126404},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.37929999828338623},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.34950000047683716},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28700000047683716},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2524999976158142},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.21504","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21504","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.21504","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21504","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"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":{"We":[0,39],"study":[1],"the":[2,34,47,67,71,75,80,89,118,127,132,171],"efficient":[3],"generation":[4],"of":[5,36,74,120,156],"random":[6,83,109,188],"graphs":[7,110],"with":[8,30,111],"a":[9,41,51,55,152],"prescribed":[10,90],"expected":[11,86],"degree":[12],"sequence,":[13],"focusing":[14],"on":[15,96,105,143],"rank-1":[16,146],"inhomogeneous":[17],"models":[18],"in":[19,66,170],"which":[20,149],"vertices":[21],"are":[22,27],"assigned":[23],"weights":[24],"and":[25,59,123,176,186,194],"edges":[26,45,65],"drawn":[28],"independently":[29],"probabilities":[31],"proportional":[32,125],"to":[33,46,54,126,151,174,182,184,191],"product":[35],"endpoint":[37],"weights.":[38],"adopt":[40],"temporal":[42,187],"viewpoint,":[43],"adding":[44],"graph":[48],"one":[49],"at":[50],"time":[52,57,113,155],"up":[53,181],"fixed":[56],"horizon,":[58],"allowing":[60],"for":[61,107,145],"self-loops":[62],"or":[63],"duplicate":[64],"first":[68],"stage.":[69],"Then,":[70],"simple":[72,81],"projection":[73],"resulting":[76],"multigraph":[77],"recovers":[78],"exactly":[79],"Norros--Reittu":[82],"graph,":[84],"whose":[85],"degrees":[87],"match":[88],"targets":[91],"under":[92],"mild":[93],"conditions.":[94],"Building":[95],"this":[97],"representation,":[98],"we":[99],"develop":[100],"an":[101],"exact":[102],"generator":[103,140],"based":[104,142],"\\textit{edge-arrivals}":[106],"expected-degree":[108,147],"running":[112,154],"$O(n+m)$,":[114],"where":[115],"$m$":[116],"is":[117,166],"number":[119],"generated":[121],"edges,":[122],"hence":[124],"output":[128],"size.":[129],"This":[130],"removes":[131],"typical":[133],"vertex":[134],"sorting":[135],"used":[136],"by":[137],"widely-used":[138],"fast":[139],"algorithms":[141],"\\textit{edge-skipping}":[144],"models,":[148],"leads":[150],"total":[153],"$O(n":[157],"\\log":[158],"n":[159],"+":[160],"m)$.":[161],"In":[162],"addition,":[163],"our":[164],"algorithm":[165],"simpler":[167],"than":[168],"those":[169],"literature,":[172],"easy":[173],"implement,":[175],"very":[177],"flexible,":[178],"thus":[179],"opening":[180],"extensions":[183],"directed":[185],"graphs,":[189],"generalization":[190],"higher-order":[192],"structures,":[193],"improvements":[195],"through":[196],"parallelization.":[197]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-25T00:00:00"}