{"id":"https://openalex.org/W4414054307","doi":"https://doi.org/10.1109/tnsm.2025.3607004","title":"Node-Reliability: Monte Carlo, Laplace, and Stochastic Approximations and a Greedy Link-Augmentation Strategy","display_name":"Node-Reliability: Monte Carlo, Laplace, and Stochastic Approximations and a Greedy Link-Augmentation Strategy","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W4414054307","doi":"https://doi.org/10.1109/tnsm.2025.3607004"},"language":"en","primary_location":{"id":"doi:10.1109/tnsm.2025.3607004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2025.3607004","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network and Service Management","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028187398","display_name":"Xinhan Liu","orcid":"https://orcid.org/0009-0005-2225-6538"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Xinhan Liu","raw_affiliation_strings":["Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0005-2225-6538","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084761980","display_name":"Robert E. Kooij","orcid":"https://orcid.org/0000-0001-8654-1550"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robert Kooij","raw_affiliation_strings":["Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8654-1550","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001877366","display_name":"Piet Van Mieghem","orcid":"https://orcid.org/0000-0002-3786-7922"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Piet Van Mieghem","raw_affiliation_strings":["Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-3786-7922","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21900541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"756","last_page":"766"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.156700000166893,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.156700000166893,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6173999905586243},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5257999897003174},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.5227000117301941},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5210000276565552},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4747999906539917},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4442000091075897},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3716000020503998},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.3686999976634979}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6173999905586243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.586899995803833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5687000155448914},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5257999897003174},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.5227000117301941},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.30410000681877136},{"id":"https://openalex.org/C97937538","wikidata":"https://www.wikidata.org/wiki/Q199691","display_name":"Laplace transform","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27950000762939453},{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.2793000042438507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2791000008583069},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnsm.2025.3607004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2025.3607004","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network and Service Management","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1501025043","https://openalex.org/W1511192790","https://openalex.org/W1553342537","https://openalex.org/W1587744656","https://openalex.org/W1987717935","https://openalex.org/W1998076865","https://openalex.org/W2014091871","https://openalex.org/W2029478301","https://openalex.org/W2031807474","https://openalex.org/W2042876290","https://openalex.org/W2044881936","https://openalex.org/W2066629848","https://openalex.org/W2077574607","https://openalex.org/W2093187872","https://openalex.org/W2096811399","https://openalex.org/W2115826669","https://openalex.org/W2150331677","https://openalex.org/W2165021839","https://openalex.org/W2168452204","https://openalex.org/W2294347342","https://openalex.org/W2317141468","https://openalex.org/W2318937935","https://openalex.org/W2808798366","https://openalex.org/W2921135591","https://openalex.org/W2963961084","https://openalex.org/W3004493283","https://openalex.org/W3049700057","https://openalex.org/W4386468260","https://openalex.org/W4387575198","https://openalex.org/W4392370783","https://openalex.org/W4392733169","https://openalex.org/W4409022465"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1518185400"],"abstract_inverted_index":{"The":[0],"node-reliability":[1,23],"polynomial":[2],"nRelG(p)":[3,25,74],"measures":[4],"the":[5,52,69,83],"probability":[6,20],"that":[7,14,50],"a":[8,47,98,120],"connected":[9,12],"network":[10],"remains":[11],"given":[13,99],"each":[15],"node":[16,106],"functions":[17],"independently":[18],"with":[19,75],"p.":[21],"Computing":[22],"polynomials":[24],"exactly":[26,92],"is":[27,43,116],"NP-hard.":[28],"Here":[29],"we":[30,35],"propose":[31],"efficient":[32,122],"approximations.":[33],"First,":[34],"develop":[36],"an":[37],"accurate":[38],"Monte":[39],"Carlo":[40],"simulation,":[41],"which":[42,67,118],"accelerated":[44],"by":[45,90],"incorporating":[46],"Laplace":[48],"approximation":[49],"captures":[51],"polynomial\u2019s":[53],"main":[54],"behavior.":[55],"We":[56],"also":[57],"introduce":[58],"three":[59],"degree-based":[60],"stochastic":[61],"approximations":[62],"(Laplace,":[63],"arithmetic,":[64],"and":[65,123],"geometric),":[66],"leverage":[68],"degree":[70],"distribution":[71],"to":[72,95,97,103],"estimate":[73],"low":[76],"complexity.":[77],"Beyond":[78],"approximations,":[79],"our":[80],"framework":[81],"addresses":[82],"reliability-based":[84],"Global":[85],"Robustness":[86],"Improvement":[87],"Problem":[88],"(k-GRIP)":[89],"selecting":[91],"k":[93],"links":[94],"add":[96],"graph":[100],"so":[101],"as":[102],"maximize":[104],"its":[105],"reliability.":[107],"A":[108],"Greedy":[109],"Lowest-Degree":[110],"Pairing":[111],"Link":[112],"Addition":[113],"(Greedy-LD)":[114],"Algorithm,":[115],"proposed":[117],"offers":[119],"computationally":[121],"practically":[124],"effective":[125],"heuristic,":[126],"particularly":[127],"suitable":[128],"for":[129],"large-scale":[130],"networks.":[131]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}