{"id":"https://openalex.org/W1991545795","doi":"https://doi.org/10.5555/2133036.2133071","title":"Fast information spreading in graphs with large weak conductance","display_name":"Fast information spreading in graphs with large weak conductance","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-23","ids":{"openalex":"https://openalex.org/W1991545795","doi":"https://doi.org/10.5555/2133036.2133071","mag":"1991545795"},"language":"en","primary_location":{"id":"mag:1991545795","doi":"https://doi.org/10.5555/2133036.2133071","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/110845380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1991545795"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205","observed_orcids":["https://orcid.org/0000-0003-4395-5205"]},"institutions":[{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["CSAIL/MIT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSAIL/MIT","institution_ids":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061815610","display_name":"Hadas Shachnai","orcid":"https://orcid.org/0000-0002-6645-4350","observed_orcids":["https://orcid.org/0000-0002-6645-4350"]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hadas Shachnai","raw_affiliation_strings":["Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4952,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.972511,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"448"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9047999978065491,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9047999978065491,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0406000018119812,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.016899999231100082,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/information-dissemination","display_name":"information dissemination","score":0.9750000238418579},{"id":"https://openalex.org/keywords/graph-conductance","display_name":"graph conductance","score":0.703000009059906},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.6620000004768372},{"id":"https://openalex.org/keywords/communication-bottleneck","display_name":"communication bottleneck","score":0.7549999952316284},{"id":"https://openalex.org/keywords/communication-topology","display_name":"communication topology","score":0.5189999938011169},{"id":"https://openalex.org/keywords/time-complexity-bounds","display_name":"time complexity bounds","score":0.460999995470047}],"concepts":[{"id":"https://openalex.org/C121932024","wikidata":"https://www.wikidata.org/wiki/Q5159376","display_name":"Conductance","level":2,"score":0.6623039245605469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6381429433822632},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5818122625350952},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5264041423797607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5046855211257935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49029067158699036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48888224363327026},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45376598834991455},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42816779017448425},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.427384614944458},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35612714290618896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3041343092918396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.281636506319046},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26385533809661865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2404308319091797},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:1991545795","doi":"https://doi.org/10.5555/2133036.2133071","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/110845380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.1430","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.1430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://groups.csail.mit.edu/tds/papers/Censor/soda11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.194.1063","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.194.1063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/soda/2011/SODA11_035_censorhillelk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.413.8978","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.8978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/ckeren/CensorHillelShachnaiSODA2010/","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1498909462","https://openalex.org/W1526359699","https://openalex.org/W1536693177","https://openalex.org/W1568495775","https://openalex.org/W1666717679","https://openalex.org/W1771950282","https://openalex.org/W1784233768","https://openalex.org/W1864333249","https://openalex.org/W1865724022","https://openalex.org/W1975950716","https://openalex.org/W2009267577","https://openalex.org/W2009356484","https://openalex.org/W2014705821","https://openalex.org/W2018963243","https://openalex.org/W2025827262","https://openalex.org/W2038562061","https://openalex.org/W2047784567","https://openalex.org/W2047812461","https://openalex.org/W2068749247","https://openalex.org/W2075400537","https://openalex.org/W2076305111","https://openalex.org/W2078958987","https://openalex.org/W2103160469","https://openalex.org/W2110100895","https://openalex.org/W2117905067","https://openalex.org/W2119098504","https://openalex.org/W2138830906","https://openalex.org/W2144828388","https://openalex.org/W2146466672","https://openalex.org/W2151350366","https://openalex.org/W2151893328","https://openalex.org/W2156168215","https://openalex.org/W2159505833","https://openalex.org/W2160504298","https://openalex.org/W2163636580","https://openalex.org/W2163823499","https://openalex.org/W2167805066","https://openalex.org/W2621876985"],"related_works":["https://openalex.org/W7095829838","https://openalex.org/W2167805066","https://openalex.org/W7100953244","https://openalex.org/W2009356484","https://openalex.org/W2778960147","https://openalex.org/W2103160469","https://openalex.org/W2797313639","https://openalex.org/W7163735564","https://openalex.org/W2736737189","https://openalex.org/W2583780251"],"abstract_inverted_index":{"Gathering":[0],"data":[1],"from":[2],"nodes":[3,28],"in":[4,115],"a":[5,19,30,37,102,112],"network":[6],"is":[7,86],"at":[8],"the":[9,63,66,120],"heart":[10],"of":[11,29,65,83,105,124],"many":[12],"distributed":[13],"applications,":[14],"most":[15],"notably,":[16],"while":[17],"performing":[18],"global":[20],"task.":[21],"We":[22],"consider":[23],"information":[24,52,88,99],"spreading":[25,53,89,100],"among":[26],"n":[27],"network,":[31],"where":[32],"each":[33],"node":[34],"v":[35],"has":[36,54],"message":[38],"m(v)":[39],"which":[40,91],"must":[41],"be":[42],"received":[43],"by":[44],"all":[45],"other":[46],"nodes.":[47],"The":[48,80],"time":[49],"required":[50],"for":[51,75,101],"been":[55],"previously":[56],"upper-bounded":[57],"with":[58,77],"an":[59,87],"inverse":[60],"relationship":[61],"to":[62],"conductance":[64],"underlying":[67],"communication":[68,93],"graph.":[69],"This":[70],"implies":[71],"high":[72],"running":[73],"times":[74],"graphs":[76],"small":[78,109],"conductance.":[79,110],"main":[81],"contribution":[82],"this":[84],"paper":[85],"algorithm":[90],"overcomes":[92],"bottlenecks":[94],"and":[95],"thus":[96],"achieves":[97],"fast":[98],"wide":[103],"class":[104],"graphs,":[106],"despite":[107],"their":[108],"As":[111],"key":[113],"tool":[114],"our":[116],"study":[117],"we":[118],"use":[119],"recently":[121],"defined":[122],"concept":[123]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1991545795","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
