{"id":"https://openalex.org/W19046872","doi":"https://doi.org/10.1080/15427951.2016.1164100","title":"Fast Low-Cost Estimation of Network Properties Using Random Walks","display_name":"Fast Low-Cost Estimation of Network Properties Using Random Walks","publication_year":2016,"publication_date":"2016-03-24","ids":{"openalex":"https://openalex.org/W19046872","doi":"https://doi.org/10.1080/15427951.2016.1164100","mag":"19046872"},"language":"en","primary_location":{"id":"doi:10.1080/15427951.2016.1164100","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1164100","pdf_url":"https://www.internetmathematicsjournal.com/article/1605.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.internetmathematicsjournal.com/article/1605.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022238950","display_name":"Colin Cooper","orcid":"https://orcid.org/0000-0002-5264-4401"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Colin Cooper","raw_affiliation_strings":["Department of Informatics, King's College London, London, UK","Department of Informatics, King's College, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070579616","display_name":"Tomasz Radzik","orcid":"https://orcid.org/0000-0002-7776-5461"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tomasz Radzik","raw_affiliation_strings":["Department of Informatics, King's College London, London, UK","Department of Informatics, King's College, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044341352","display_name":"Yiannis Siantos","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yiannis Siantos","raw_affiliation_strings":["Department of Informatics, King's College London, London, UK","Department of Informatics, King's College, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022238950"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":1.3258,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80444746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"4","first_page":"221","last_page":"238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":1.0,"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":1.0,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9979000091552734,"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/T11478","display_name":"Caching and Content Delivery","score":0.9908000230789185,"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/mathematics","display_name":"Mathematics","score":0.8356355428695679},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.7794743776321411},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6580566167831421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.586813747882843},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.4865092635154724},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4590508043766022},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41906091570854187},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.41260990500450134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40225455164909363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.273439884185791},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20796066522598267}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8356355428695679},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7794743776321411},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6580566167831421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.586813747882843},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.4865092635154724},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4590508043766022},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41906091570854187},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.41260990500450134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40225455164909363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.273439884185791},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20796066522598267},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/15427951.2016.1164100","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1164100","pdf_url":"https://www.internetmathematicsjournal.com/article/1605.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/36c267fd-5a8b-4829-9f96-01214837de4f","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/36c267fd-5a8b-4829-9f96-01214837de4f","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/53202781/Fast_Low_Cost_Estimation_COOPER_Accepted_24_Mar_2016_GREEN_AAM.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper , C , Radzik , T & Siantos , Y 2016 , ' Fast Low-Cost Estimation of Network Properties Using Random Walks ' , Internet Mathematics 1 , vol. 12 , no. 4 , pp. 221-238 . https://doi.org/10.1080/15427951.2016.1164100","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.639.9941","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.9941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/ccooper/papers/fastlowcost.pdf","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/a28976e1-ac68-438b-bb17-93e48c4953fb","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84893107771&partnerID=8YFLogxK","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,"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 , Radzik , T & Siantos , Y 2013 , Fast Low-Cost Estimation of Network Properties Using Random Walks . in A Bonato , M Mitzenmacher & P Pralat (eds) , Algorithms and Models for the Web Graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 8305 LNCS , pp. 130-143 , 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013 , Cambridge, MA , United States , 14/12/2013 . https://doi.org/10.1007/978-3-319-03536-9_11","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1080/15427951.2016.1164100","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1164100","pdf_url":"https://www.internetmathematicsjournal.com/article/1605.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1159596240","display_name":null,"funder_award_id":"EP/M005038/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4683772819","display_name":"Random walks on computer networks","funder_award_id":"EP/J006300/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W19046872.pdf","grobid_xml":"https://content.openalex.org/works/W19046872.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1514107797","https://openalex.org/W1584341455","https://openalex.org/W1586184796","https://openalex.org/W1980322272","https://openalex.org/W1985380836","https://openalex.org/W1994392346","https://openalex.org/W2004255137","https://openalex.org/W2007168590","https://openalex.org/W2008620264","https://openalex.org/W2062833795","https://openalex.org/W2089710678","https://openalex.org/W2124036135","https://openalex.org/W2137951248","https://openalex.org/W2140610008","https://openalex.org/W2159741581","https://openalex.org/W2175110005","https://openalex.org/W2471517265","https://openalex.org/W2615103699","https://openalex.org/W2751862591","https://openalex.org/W3029087166","https://openalex.org/W3101473884","https://openalex.org/W4298289668"],"related_works":["https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W2797228403","https://openalex.org/W4297449606","https://openalex.org/W2325737604","https://openalex.org/W2141180764","https://openalex.org/W4245069437","https://openalex.org/W2042537860","https://openalex.org/W2033630974","https://openalex.org/W2382333285"],"abstract_inverted_index":{"_We":[0],"study":[1],"the":[2,23,28,38,56,72,78,92,106,109,133,144,149,155,173],"use":[3],"of":[4,15,22,25,30,40,52,59,96,105,108,112,146,148,154,157,159,175],"random":[5,53,65,114,161],"walks":[6,66],"as":[7,151],"an":[8],"efficient":[9],"method":[10],"to":[11,128,163,171],"estimate":[12,172],"global":[13],"properties":[14,24],"large":[16,97],"connected":[17],"undirected":[18],"graphs.":[19],"Typical":[20],"examples":[21],"interest":[26],"include":[27],"number":[29,39,156,174],"edges,":[31,177],"vertices,":[32,176],"and":[33,35,62,84,103,140,178],"triangles,":[34],"more":[36],"generally,":[37],"small":[41],"fixed":[42],"subgraphs.":[43],"We":[44,76,137,168],"consider":[45],"two":[46,181],"methods":[47,83],"based":[48],"on":[49,143],"first":[50,110],"returns":[51,127,158],"walks:":[54],"(1)":[55],"cycle":[57],"formula":[58],"regenerative":[60],"processes":[61],"(2)":[63],"weighted":[64],"with":[67,117],"edge":[68],"weights":[69],"defined":[70],"by":[71],"property":[73,135],"under":[74],"investigation.":[75],"review":[77],"theoretical":[79,139],"foundations":[80],"for":[81,91,122,180],"these":[82],"indicate":[85],"how":[86],"they":[87],"can":[88],"be":[89],"adapted":[90],"general":[93],"nonintrusive":[94],"investigation":[95],"online":[98],"networks.":[99],"The":[100],"expected":[101],"value":[102],"variance":[104],"time":[107,125],"return":[111],"a":[113,123,152,160,164],"walk":[115,162],"decrease":[116],"increasing":[118],"vertex":[119],"weight,":[120],"so":[121],"given":[124,165],"budget,":[126],"high-weight":[129],"vertices":[130],"should":[131],"give":[132],"best":[134],"estimates.":[136],"present":[138],"experimental":[141],"results":[142],"rate":[145],"convergence":[147],"estimates":[150],"function":[153],"start":[166],"vertex.":[167],"made":[169],"experiments":[170],"triangles":[179],"test":[182],"graphs._":[183]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}