{"id":"https://openalex.org/W2080892432","doi":"https://doi.org/10.1137/090758982","title":"A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs","display_name":"A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2080892432","doi":"https://doi.org/10.1137/090758982","mag":"2080892432"},"language":"en","primary_location":{"id":"doi:10.1137/090758982","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090758982","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/A5062316763","display_name":"Randy Cogill","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Randy Cogill","raw_affiliation_strings":["rcogill@virginia.edu and cp5pz@virginia.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"rcogill@virginia.edu and cp5pz@virginia.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036585419","display_name":"Peng Cheng","orcid":"https://orcid.org/0000-0002-9797-6944"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheng Peng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062316763"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9247,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.76462076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"3","first_page":"808","last_page":"820"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9959999918937683,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9959999918937683,"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/T11106","display_name":"Data Management and Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/spanning-tree","display_name":"Spanning tree","score":0.7841442823410034},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7665705680847168},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7570807337760925},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.727774441242218},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.6770095825195312},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.575681209564209},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5330905318260193},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5316819548606873},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.530428409576416},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5271021127700806},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47732454538345337},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4363168776035309},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.42743057012557983},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.410847008228302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4092535376548767},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2067250907421112},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1514812707901001},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1437358856201172},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12885600328445435}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7841442823410034},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7665705680847168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7570807337760925},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.727774441242218},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.6770095825195312},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.575681209564209},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5330905318260193},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5316819548606873},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.530428409576416},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5271021127700806},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47732454538345337},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4363168776035309},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.42743057012557983},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.410847008228302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4092535376548767},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2067250907421112},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1514812707901001},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1437358856201172},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12885600328445435},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090758982","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090758982","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1538639190","https://openalex.org/W1968695868","https://openalex.org/W1972636593","https://openalex.org/W1986269714","https://openalex.org/W2053491613","https://openalex.org/W2069401760","https://openalex.org/W2070900938","https://openalex.org/W2077636904","https://openalex.org/W2136647665","https://openalex.org/W2167064216"],"related_works":["https://openalex.org/W4308416203","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W4295683043","https://openalex.org/W2048177396","https://openalex.org/W2943635264","https://openalex.org/W620960161","https://openalex.org/W1971863547","https://openalex.org/W2084694919","https://openalex.org/W2149927264"],"abstract_inverted_index":{"In":[0,50],"this":[1,45],"paper":[2],"we":[3,55],"consider":[4],"the":[5,9,31,41,58,62],"problem":[6],"of":[7,40,52],"computing":[8,26],"expected":[10,32],"hitting":[11,33],"time":[12,34],"to":[13],"a":[14,23],"vertex":[15],"for":[16,25],"random":[17],"walks":[18],"on":[19,30],"graphs.":[20],"We":[21,43],"give":[22],"method":[24,46,64],"an":[27,36],"upper":[28],"bound":[29],"from":[35,61,70],"arbitrary":[37],"spanning":[38,63],"tree":[39],"graph.":[42],"illustrate":[44],"with":[47],"two":[48],"examples.":[49],"one":[51],"these":[53],"examples,":[54],"show":[56],"that":[57],"bounds":[59,68],"obtained":[60,69],"are":[65],"sharper":[66],"than":[67],"other":[71],"commonly":[72],"used":[73],"techniques.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}