{"id":"https://openalex.org/W1968695868","doi":"https://doi.org/10.1002/rsa.3240010303","title":"Maximum hitting time for random walks on graphs","display_name":"Maximum hitting time for random walks on graphs","publication_year":1990,"publication_date":"1990-09-01","ids":{"openalex":"https://openalex.org/W1968695868","doi":"https://doi.org/10.1002/rsa.3240010303","mag":"1968695868"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240010303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240010303","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & 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/A5039259953","display_name":"Graham Brightwell","orcid":"https://orcid.org/0000-0001-5955-3628"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Graham Brightwell","raw_affiliation_strings":["Cambridge University, Cambridge, United Kingdom","Cambridge University; Cambridge United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cambridge University, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"Cambridge University; Cambridge United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056680757","display_name":"Peter Winkler","orcid":"https://orcid.org/0000-0002-1259-3574"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Winkler","raw_affiliation_strings":["Emory University, Atlanta, GA, and Bellcore, Morristown, NJ","Emory University, Atlanta, GA, and Bellcore, Morristown, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA, and Bellcore, Morristown, NJ","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory University, Atlanta, GA, and Bellcore, Morristown, NJ#TAB#","institution_ids":["https://openalex.org/I150468666"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4550,"currency":"USD","value_usd":4550},"apc_paid":null,"fwci":2.8317,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.90714604,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"1","issue":"3","first_page":"263","last_page":"276"},"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.9879000186920166,"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.9879000186920166,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9869999885559082,"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/T12288","display_name":"Optimization and Search Problems","score":0.9836999773979187,"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.8780909776687622},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.6628671884536743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6196427941322327},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6090214848518372},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5762795209884644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5657730102539062},{"id":"https://openalex.org/keywords/bound-graph","display_name":"Bound graph","score":0.5059444308280945},{"id":"https://openalex.org/keywords/random-regular-graph","display_name":"Random regular graph","score":0.4811493158340454},{"id":"https://openalex.org/keywords/clique-number","display_name":"Clique number","score":0.4551153779029846},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4318738579750061},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4296901822090149},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.4232936501502991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39149728417396545},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15662696957588196},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.10668092966079712}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8780909776687622},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6628671884536743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6196427941322327},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6090214848518372},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5762795209884644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5657730102539062},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.5059444308280945},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.4811493158340454},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.4551153779029846},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4318738579750061},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4296901822090149},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.4232936501502991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39149728417396545},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15662696957588196},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.10668092966079712}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/rsa.3240010303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240010303","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W135807975","https://openalex.org/W1972636593","https://openalex.org/W2038562949","https://openalex.org/W2067012168","https://openalex.org/W2156184725","https://openalex.org/W2531764516","https://openalex.org/W3149749254"],"related_works":["https://openalex.org/W2077631478","https://openalex.org/W4242930043","https://openalex.org/W1995383828","https://openalex.org/W2151291961","https://openalex.org/W4288436438","https://openalex.org/W1970462054","https://openalex.org/W4298388358","https://openalex.org/W2161439427","https://openalex.org/W1973995684","https://openalex.org/W1968695868"],"abstract_inverted_index":{"Abstract":[0],"For":[1],"x":[2,24,40,90],"and":[3,38,41],"y":[4,42,88],"vertices":[5,39],"of":[6,53],"a":[7,19,54,69],"connected":[8],"graph":[9,36,51,93],"G,":[10],"let":[11],"TG(x,":[12,45,84],"y)":[13,46,85],"denote":[14],"the":[15,34,49,72,81],"expected":[16,82],"time":[17,83],"before":[18],"random":[20],"walk":[21],"starting":[22],"from":[23,89],"reaches":[25],"y.":[26],"We":[27],"determine,":[28],"for":[29,43],"each":[30],"n":[31],">":[32],"0,":[33],"n\u2010vertex":[35],"G":[37],"which":[44,68],"is":[47,94],"maximized.":[48],"extremal":[50],"consists":[52],"clique":[55],"on":[56,71],"\u230a(2n":[57],"+":[58],"1)/3\u230b)":[59],"(or":[60],"\u2308)(2n":[61],"\u2212":[62],"2)/3\u2309)":[63],"vertices,":[64,74],"including":[65],"x,":[66],"to":[67,86],"path":[70],"remaining":[73],"ending":[75],"in":[76,91],"y,":[77],"has":[78],"been":[79],"attached;":[80],"reach":[87],"this":[92],"approximately":[95],"4n3/27.":[96]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}