{"id":"https://openalex.org/W2753563108","doi":"https://doi.org/10.1109/ita.2017.8023456","title":"Computing inter-encounter time distributions for multiple random walkers on graphs","display_name":"Computing inter-encounter time distributions for multiple random walkers on graphs","publication_year":2017,"publication_date":"2017-02-01","ids":{"openalex":"https://openalex.org/W2753563108","doi":"https://doi.org/10.1109/ita.2017.8023456","mag":"2753563108"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2017.8023456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2017.8023456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-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/A5021646776","display_name":"Quynh Nguyen","orcid":"https://orcid.org/0000-0001-8466-7643"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Quynh Nguyen","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, California"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063784062","display_name":"Bhaskar Krishnamachari","orcid":"https://orcid.org/0000-0002-9994-9931"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Krishnamachari","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, California"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, California","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021646776"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14551843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9997000098228455,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7020273804664612},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6697427034378052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6112834215164185},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6025762557983398},{"id":"https://openalex.org/keywords/random-walker-algorithm","display_name":"Random walker algorithm","score":0.5325160622596741},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5115900635719299},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49979114532470703},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4959777295589447},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.46680548787117004},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4612971246242523},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34547847509384155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3079198896884918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24842342734336853},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09109482169151306}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7020273804664612},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6697427034378052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6112834215164185},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6025762557983398},{"id":"https://openalex.org/C105045736","wikidata":"https://www.wikidata.org/wiki/Q7292002","display_name":"Random walker algorithm","level":3,"score":0.5325160622596741},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5115900635719299},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49979114532470703},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4959777295589447},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.46680548787117004},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4612971246242523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34547847509384155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3079198896884918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24842342734336853},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09109482169151306},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ita.2017.8023456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2017.8023456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W89672033","https://openalex.org/W1875423025","https://openalex.org/W1984421111","https://openalex.org/W2035041033","https://openalex.org/W2096509679","https://openalex.org/W2098636692","https://openalex.org/W2112876030","https://openalex.org/W2149071511","https://openalex.org/W2154584815","https://openalex.org/W2158562280","https://openalex.org/W2162201103","https://openalex.org/W2320319270","https://openalex.org/W4236874490","https://openalex.org/W4285719527","https://openalex.org/W6603676269","https://openalex.org/W6639196776"],"related_works":["https://openalex.org/W1973641485","https://openalex.org/W2472745029","https://openalex.org/W2064285815","https://openalex.org/W2000620996","https://openalex.org/W3163695673","https://openalex.org/W3171278913","https://openalex.org/W4287163214","https://openalex.org/W2793605182","https://openalex.org/W2900071037","https://openalex.org/W2760154051"],"abstract_inverted_index":{"For":[0,101],"intermittently":[1],"connected":[2],"mobile":[3],"networks":[4],"such":[5],"as":[6],"sparsely-deployed":[7],"vehicular":[8],"networks,":[9],"it":[10],"is":[11,33,111],"of":[12,19,62,88,94,119],"great":[13],"interest":[14],"to":[15,35,134],"characterize":[16],"the":[17,54,73,79,84,95,99,117,120,129],"distribution":[18,58],"encounter":[20],"times.":[21],"We":[22,51,76,115,126],"consider":[23,52,78,135],"a":[24,39,43,60,67,89],"very":[25],"general":[26,44],"mobility":[27],"model":[28,130],"in":[29,98],"which":[30],"each":[31],"device":[32],"assumed":[34],"be":[36,132],"moving":[37],"through":[38],"given":[40],"graph":[41],"following":[42],"random":[45,63],"walk":[46],"with":[47,92],"arbitrary":[48],"transition":[49],"probabilities.":[50],"first":[53],"pairwise":[55],"inter-encounter":[56,81],"time":[57,82,85],"for":[59],"pair":[61],"walkers":[64,97],"and":[65],"present":[66],"recursive":[68],"polynomial-time":[69],"computation":[70,109],"that":[71,110],"yields":[72],"exact":[74],"solution.":[75],"then":[77],"individual-to-any":[80],"(i.e.,":[83],"between":[86],"contacts":[87],"particular":[90],"walker":[91],"any":[93],"other":[96],"population).":[100],"this":[102],"harder":[103],"problem,":[104],"we":[105],"give":[106],"an":[107],"approximate":[108],"also":[112],"polynomial":[113],"time.":[114],"validate":[116],"accuracy":[118],"presented":[121],"solutions":[122],"using":[123],"numerical":[124],"simulations.":[125],"discuss":[127],"how":[128],"can":[131],"generalized":[133],"multiple":[136],"populations.":[137]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}