{"id":"https://openalex.org/W2619418495","doi":"https://doi.org/10.1145/3086465","title":"Tight Bounds on Vertex Connectivity Under Sampling","display_name":"Tight Bounds on Vertex Connectivity Under Sampling","publication_year":2017,"publication_date":"2017-04-30","ids":{"openalex":"https://openalex.org/W2619418495","doi":"https://doi.org/10.1145/3086465","mag":"2619418495"},"language":"en","primary_location":{"id":"doi:10.1145/3086465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3086465","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"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":true,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["MIT"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006944198","display_name":"George Giakkoupis","orcid":"https://orcid.org/0000-0002-8023-4485"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"George Giakkoupis","raw_affiliation_strings":["INRIA, Rennes Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA, Rennes Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["University of Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5061279024"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.08678533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/combinatorics","display_name":"Combinatorics","score":0.7876662015914917},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7287302017211914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6272035837173462},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5756481289863586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5100510716438293},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4746870696544647},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46722328662872314},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.44820666313171387}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7876662015914917},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7287302017211914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6272035837173462},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5756481289863586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5100510716438293},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4746870696544647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46722328662872314},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.44820666313171387},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3086465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3086465","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01635743v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01635743","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","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":"ACM Transactions on Algorithms, 2017, 13 (2), pp.19:1 - 19:26. ⟨10.1145/3086465⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4376290272","display_name":null,"funder_award_id":"CCF-1618280 and CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W568926409","https://openalex.org/W1653231547","https://openalex.org/W1971680255","https://openalex.org/W1974912205","https://openalex.org/W1981519953","https://openalex.org/W1994931826","https://openalex.org/W1996169001","https://openalex.org/W2022887970","https://openalex.org/W2042706982","https://openalex.org/W2045107949","https://openalex.org/W2051540665","https://openalex.org/W2058858486","https://openalex.org/W2068888615","https://openalex.org/W2079000395","https://openalex.org/W2905110430","https://openalex.org/W2963654823","https://openalex.org/W4249774010"],"related_works":["https://openalex.org/W2902222102","https://openalex.org/W4287869573","https://openalex.org/W3187181455","https://openalex.org/W2129100545","https://openalex.org/W2159586130","https://openalex.org/W3004984242","https://openalex.org/W2080725679","https://openalex.org/W2339534957","https://openalex.org/W2039200643","https://openalex.org/W4313216298"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"result":[2,46],"by":[3,87],"Karger":[4],"[10]":[5],"states":[6],"that":[7,31,59],"for":[8,47,60],"any":[9,61],"\u03bb-edge-connected":[10],"graph":[11,30,64],"with":[12,19,38,66,75,98,105,125],"n":[13,25,67,79,111],"nodes,":[14,68],"independently":[15,73],"sampling":[16],"each":[17,70],"edge":[18,33],"probability":[20,76,106],"p":[21,36,77,107],"=":[22,108],"\u03a9(log":[23,109],"(":[24,110],")/\u03bb)":[26],"results":[27],"in":[28],"a":[29],"has":[32,91,119],"connectivity":[34,93,121],"\u03a9(\u03bb":[35],"),":[37,82,97,114,124],"high":[39,99,126],"probability.":[40,100,127],"This":[41],"article":[42],"proves":[43],"the":[44,84,88,116],"analogous":[45],"vertex":[48,92,120],"connectivity,":[49],"when":[50],"either":[51],"vertices":[52],"or":[53],"edges":[54,102],"are":[55,103,130],"sampled.":[56],"We":[57],"show":[58],"k":[62,81,113],"-vertex-connected":[63],"G":[65],"if":[69],"node":[71],"is":[72],"sampled":[74,89,104,117],"=\u03a9(\u221alog(":[78],")/":[80,112],"then":[83,115],"subgraph":[85,118],"induced":[86],"nodes":[90],"\u03a9(":[94,122],"kp":[95,123],"2":[96],"If":[101],"Both":[128],"bounds":[129],"existentially":[131],"optimal.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}