{"id":"https://openalex.org/W7165672224","doi":"https://doi.org/10.48550/arxiv.2606.22241","title":"Efficient Algorithms for Influence Maximization in General Models and Observed Cascades","display_name":"Efficient Algorithms for Influence Maximization in General Models and Observed Cascades","publication_year":2026,"publication_date":"2026-06-20","ids":{"openalex":"https://openalex.org/W7165672224","doi":"https://doi.org/10.48550/arxiv.2606.22241"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.22241","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22241","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":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.2606.22241","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139184852","display_name":"Fabian Spaeh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spaeh, Fabian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139203840","display_name":"Themistoklis Haris","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haris, Themistoklis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Ene","orcid":"https://orcid.org/0000-0002-5818-1807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ene, Alina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136462312","display_name":"Huy L. Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Huy L.","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2152000069618225,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2152000069618225,"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"}},{"id":"https://openalex.org/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.09759999811649323,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.08079999685287476,"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/maximization","display_name":"Maximization","score":0.6891000270843506},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6442000269889832},{"id":"https://openalex.org/keywords/cascade","display_name":"Cascade","score":0.4643999934196472},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.450300008058548},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42980000376701355},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4023999869823456},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.38420000672340393},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.33629998564720154},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3203999996185303}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6891000270843506},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6442000269889832},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6233000159263611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5295000076293945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48489999771118164},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.4643999934196472},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3986999988555908},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.3027999997138977},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C37616216","wikidata":"https://www.wikidata.org/wiki/Q3218363","display_name":"Lasso (programming language)","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.22241","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22241","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":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.2606.22241","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22241","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":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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,52],"study":[1],"influence":[2,85],"maximization":[3,86],"in":[4,114],"general":[5,19],"stochastic":[6,20],"models,":[7],"the":[8,13,74],"observed":[9,88],"cascades":[10],"model,":[11],"and":[12,37,45,80],"independent":[14],"cascade":[15],"(IC)":[16],"model.":[17],"For":[18,95],"models":[21],"with":[22,70,77,107],"only":[23],"black-box":[24],"sample":[25,35,115],"access,":[26],"we":[27,72,97],"introduce":[28,54],"a":[29,99,104],"low-adaptivity":[30],"optimization":[31,68],"framework":[32,69],"that":[33],"improves":[34],"complexity":[36],"running":[38,82],"time":[39,83],"over":[40,118],"Sadeh":[41],"et":[42],"al.":[43],"(2020)":[44],"is":[46,123,126],"instrumental":[47],"to":[48,92,129],"all":[49],"our":[50,67],"results.":[51],"further":[53],"an":[55],"adaptive":[56],"algorithm":[57,76],"guided":[58],"by":[59],"empirical":[60],"variance,":[61],"avoiding":[62],"pessimistic":[63],"worst-case":[64],"bounds.":[65],"Combining":[66],"sketching,":[71],"obtain":[73],"first":[75],"provable":[78],"guarantees":[79],"nearly-linear":[81],"for":[84],"on":[87],"cascades,":[89],"optimal":[90],"up":[91],"logarithmic":[93],"factors.":[94],"IC,":[96],"prove":[98],"novel":[100],"tail":[101],"bound":[102],"replacing":[103],"factor":[105],"$n$":[106],"$\u03c4$":[108,122],"(the":[109],"number":[110],"of":[111],"diffusion":[112],"steps)":[113],"complexity,":[116],"improving":[117],"prior":[119],"work":[120],"when":[121],"small,":[124],"as":[125],"common":[127],"due":[128],"small-world":[130],"phenomena.":[131],"Experiments":[132],"confirm":[133],"substantial":[134],"speedups":[135],"while":[136],"maintaining":[137],"solution":[138],"quality.":[139]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-24T00:00:00"}