{"id":"https://openalex.org/W1970075049","doi":"https://doi.org/10.1137/090756053","title":"Flooding Time of Edge-Markovian Evolving Graphs","display_name":"Flooding Time of Edge-Markovian Evolving Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1970075049","doi":"https://doi.org/10.1137/090756053","mag":"1970075049"},"language":"en","primary_location":{"id":"doi:10.1137/090756053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090756053","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrea E. F. Clementi","raw_affiliation_strings":["clementi@mat.uniroma2.it and macci@mat.uniroma2.it#TAB#"],"affiliations":[{"raw_affiliation_string":"clementi@mat.uniroma2.it and macci@mat.uniroma2.it#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070521308","display_name":"Claudio Macci","orcid":"https://orcid.org/0000-0002-2891-5662"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claudio Macci","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027315672","display_name":"Angelo Monti","orcid":"https://orcid.org/0000-0002-3309-8249"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Angelo Monti","raw_affiliation_strings":["monti@di.uniroma1.it and silver@di.uniroma1.it#TAB#"],"affiliations":[{"raw_affiliation_string":"monti@di.uniroma1.it and silver@di.uniroma1.it#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039827196","display_name":"Francesco Pasquale","orcid":"https://orcid.org/0000-0003-1595-5291"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Francesco Pasquale","raw_affiliation_strings":["pasquale@dia.unisa.it#TAB#"],"affiliations":[{"raw_affiliation_string":"pasquale@dia.unisa.it#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056847255","display_name":"Riccardo Silvestri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Riccardo Silvestri","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5001082357"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.1825,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.97207726,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"24","issue":"4","first_page":"1694","last_page":"1712"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9983000159263611,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9983000159263611,"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/T13553","display_name":"Age of Information Optimization","score":0.9983000159263611,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5605204701423645},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5576521754264832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.526972770690918},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5192673206329346},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4490337371826172},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.43401801586151123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32255247235298157},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07851850986480713},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07684293389320374}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5605204701423645},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5576521754264832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.526972770690918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5192673206329346},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4490337371826172},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.43401801586151123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32255247235298157},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07851850986480713},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07684293389320374}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090756053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090756053","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/377972","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-79251545188&partnerID=65&md5=4a509fa0a7e79d9b6c0fb7144f4476a0","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1984977694","https://openalex.org/W2011898573","https://openalex.org/W2032049676","https://openalex.org/W2058322021","https://openalex.org/W2142458954","https://openalex.org/W2163636580","https://openalex.org/W4242518419"],"related_works":["https://openalex.org/W1660242800","https://openalex.org/W2980963558","https://openalex.org/W2077211377","https://openalex.org/W1006270037","https://openalex.org/W3152686072","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"=1We":[0],"introduce":[1],"stochastic":[2],"time-dependency":[3],"in":[4,124,134],"evolving":[5,79,115,126,185,212],"graphs:":[6],"starting":[7],"from":[8,165],"an":[9,40,78],"initial":[10,201],"graph,":[11,242],"at":[12,43,47,62,71,243],"every":[13,16,244],"time":[14,44,48,63,72,153,189,216,245,259,267],"step,":[15,246],"edge":[17,41,58,223],"changes":[18],"its":[19],"state":[20],"(existing":[21],"or":[22],"not)":[23],"according":[24],"to":[25,138,159,169],"a":[26,83,142,161,166,177,204],"two-state":[27],"Markovian":[28],"process":[29],"with":[30,52,74],"probabilities":[31,146],"p":[32,147],"(edge":[33,37],"birth-rate)":[34],"and":[35,99,110,148,250],"q":[36],"death-rate).":[38],"If":[39,55],"exists":[42],"t,":[45,64],"then,":[46],"$t+1$,":[49],"it":[50,66,194],"dies":[51],"probability":[53,75],"q.":[54,225],"instead":[56],"the":[57,119,151,155,181,200,208,222,241,257,265,269],"does":[59,195,217],"not":[60,196,218],"exist":[61],"then":[65],"will":[67,111],"come":[68],"into":[69],"existence":[70],"$t+1$":[73],"p.":[76],"Such":[77],"graph":[80],"model":[81],"is":[82,190,232,247],"wide":[84,143],"generalization":[85],"of":[86,121,145,154,163,180,183,207,210,229,268],"time-independent":[87],"dynamic":[88],"random":[89],"graphs":[90,186,213],"[A.":[91],"E.":[92],"F.":[93,97],"Clementi,":[94],"A.":[95],"Monti,":[96],"Pasquale,":[98],"R.":[100],"Silvestri,":[101],"J.":[102],"Comput.":[103],"System":[104],"Sci.,":[105],"75":[106],"(2009),":[107],"pp.":[108],"213\u2013220]":[109],"be":[112,139,237,261],"called":[113],"edge-Markovian":[114,184,211,270],"graphs.":[116,127],"We":[117,128],"investigate":[118],"speed":[120],"information":[122,164,234],"spreading":[123,235],"such":[125],"provide":[129,175],"nearly":[130],"tight":[131,140,178,205],"bounds":[132,254],"(which":[133],"fact":[135],"turn":[136],"out":[137],"for":[141],"range":[144],"q)":[149],"on":[150,199,221],"completion":[152],"flooding":[156,188,215,258],"mechanism":[157],"aiming":[158],"broadcast":[160],"piece":[162],"source":[167],"node":[168],"all":[170],"nodes.":[171],"In":[172],"particular,":[173],"we":[174],"i)":[176],"characterization":[179,206],"class":[182,209],"where":[187,214],"constant":[191],"and,":[192],"thus,":[193],"asymptotically":[197,219],"depend":[198,220],"graph;":[202],"ii)":[203],"death-rate":[224],"An":[226],"interesting":[227],"consequence":[228],"our":[230,253],"results":[231],"that":[233,256],"can":[236,260],"fast":[238],"even":[239],"if":[240],"very":[248],"sparse":[249],"disconnected.":[251],"Furthermore,":[252],"imply":[255],"exponentially":[262],"shorter":[263],"than":[264],"mixing":[266],"graph.":[271]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}