{"id":"https://openalex.org/W2018870964","doi":"https://doi.org/10.5555/1070432.1070572","title":"The cover time of two classes of random graphs","display_name":"The cover time of two classes of random graphs","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-23","ids":{"openalex":"https://openalex.org/W2018870964","doi":"https://doi.org/10.5555/1070432.1070572","mag":"2018870964"},"language":"en","primary_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/7a67542e-b3cf-4fcb-9c7a-6fc38dd8ce27","doi":null,"is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/7a67542e-b3cf-4fcb-9c7a-6fc38dd8ce27","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper, C & Frieze, A 2005, The Cover Time of Two Classes of Random Graphs. in 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 961 - 970, 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1/01/2005.","raw_type":"contributionToPeriodical"},"parent_works":[],"lineage":["https://openalex.org/W2018870964"],"child_works_count":0,"type":"conference-paper","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/A5022238950","display_name":"Colin Cooper","orcid":"https://orcid.org/0000-0002-5264-4401","observed_orcids":["https://orcid.org/0000-0002-5264-4401"]},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Colin Cooper","raw_affiliation_strings":["University of London  ,  London ,  UK"],"raw_orcid":"https://orcid.org/0000-0002-5264-4401","affiliations":[{"raw_affiliation_string":"University of London  ,  London ,  UK","institution_ids":["https://openalex.org/I124357947"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"ALAN M. FRIEZE","orcid":"https://orcid.org/0000-0002-8481-5615","observed_orcids":["https://orcid.org/0000-0002-8481-5615"]},"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":"Alan Frieze","raw_affiliation_strings":["Carnegie Mellon University. Pittsburgh"],"raw_orcid":"https://orcid.org/0000-0002-8481-5615","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University. Pittsburgh","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5693,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84379562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"961","last_page":"970"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.8812999725341797,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.8812999725341797,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13500","display_name":"Probability and Statistical Research","score":0.020899999886751175,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.01979999989271164,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cover-time","display_name":"cover time","score":0.9869999885559082},{"id":"https://openalex.org/keywords/random-walks-on-graphs","display_name":"random walks on graphs","score":0.8840000033378601},{"id":"https://openalex.org/keywords/markov-chains","display_name":"Markov chains","score":0.7620000243186951},{"id":"https://openalex.org/keywords/random-graphs","display_name":"random graphs","score":0.7360000014305115},{"id":"https://openalex.org/keywords/coupon-collector-s-problem","display_name":"coupon collector problem","score":0.859000027179718},{"id":"https://openalex.org/keywords/complete-graphs","display_name":"complete graphs","score":0.7020000219345093},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"upper and lower bounds","score":0.6349999904632568},{"id":"https://openalex.org/keywords/connected-graphs","display_name":"connected graphs","score":0.5830000042915344}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8642828464508057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5926491022109985},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5750001072883606},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5156227946281433},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.48935455083847046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4811476469039917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4663587808609009},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4607009291648865},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/7a67542e-b3cf-4fcb-9c7a-6fc38dd8ce27","doi":null,"is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/7a67542e-b3cf-4fcb-9c7a-6fc38dd8ce27","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper, C & Frieze, A 2005, The Cover Time of Two Classes of Random Graphs. in 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 961 - 970, 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1/01/2005.","raw_type":"contributionToPeriodical"},{"id":"mag:2018870964","doi":"https://doi.org/10.5555/1070432.1070572","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda2005.html#CooperF05","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1546919957","https://openalex.org/W1569752386","https://openalex.org/W1607251184","https://openalex.org/W1980985200","https://openalex.org/W1997429681","https://openalex.org/W2008620264","https://openalex.org/W2050219593","https://openalex.org/W2056380633","https://openalex.org/W2061118827","https://openalex.org/W2064975723","https://openalex.org/W2091476183","https://openalex.org/W2093897717","https://openalex.org/W2156184725","https://openalex.org/W2170807097","https://openalex.org/W2770485470","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W2170807097","https://openalex.org/W4230376356","https://openalex.org/W2913110029","https://openalex.org/W2058824252","https://openalex.org/W1980985200","https://openalex.org/W2084768526","https://openalex.org/W4233834403","https://openalex.org/W7097581272","https://openalex.org/W110816161","https://openalex.org/W7099500388"],"abstract_inverted_index":{"Let":[0],"G":[1,26,102],"=":[2,10,14,27,35,107],"(V,E)":[3],"be":[4,84],"a":[5,31,42,58,122],"connected":[6,114,149],"graph,":[7],"let":[8,82],"|V|":[9],"n,":[11],"and":[12,75,130],"|E|":[13],"m.A":[15],"random":[16],"walk":[17],"Wu,":[18],"u":[19,79],"\u2208":[20,38,73,80],"V":[21,39,81],"on":[22],"the":[23,52,55,85,159,169],"undirected":[24],"graph":[25,150,161],"(V,":[28],"E)":[29],"is":[30,69,103,121,154,166],"Markov":[32],"chain":[33],"X0":[34],"u,":[36],"X1,...Xt,...":[37],"associated":[40],"to":[41,48,51,66,91],"particle":[43],"that":[44,133,146],"moves":[45],"from":[46,60],"vertex":[47,49,61,67,94],"according":[50],"following":[53],"rule:":[54],"probability":[56],"of":[57,63,95,101,113,125],"transition":[59],"i,":[62],"degree":[64],"di,":[65],"j":[68],"1/di":[70],"if":[71],"{i,j}":[72],"E,":[74],"0":[76],"otherwise.":[77],"For":[78],"Cu":[83],"expected":[86],"time":[87,99,112,165],"taken":[88],"for":[89,147],"Wu":[90],"visit":[92],"every":[93],"G.":[96],"The":[97,110],"cover":[98,111,164],"CG":[100,106,134],"defined":[104],"as":[105],"maxu\u2208V":[108],"Cu.":[109],"graphs":[115],"has":[116],"been":[117],"extensively":[118],"studied.":[119],"It":[120,139],"classic":[123],"result":[124],"Aleliunas,":[126],"Karp,":[127],"Lipton,":[128],"Lovasz":[129],"Rackoff":[131],"[2]":[132],"\u2264":[135],"2m(n":[136],"-":[137],"1).":[138],"was":[140],"shown":[141],"by":[142,156,168],"Feige":[143],"[11],":[144],"[12],":[145],"any":[148],"G[EQUATION]The":[151],"lower":[152],"bound":[153],"achieved":[155],"(for":[157],"example)":[158],"complete":[160],"Kn,":[162],"whose":[163],"determined":[167],"Coupon":[170],"Collector":[171],"problem.":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2018870964","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
