{"id":"https://openalex.org/W2783049383","doi":"https://doi.org/10.1017/s0963548318000500","title":"An Upper Bound on the Size of Avoidance Couplings","display_name":"An Upper Bound on the Size of Avoidance Couplings","publication_year":2018,"publication_date":"2018-12-11","ids":{"openalex":"https://openalex.org/W2783049383","doi":"https://doi.org/10.1017/s0963548318000500","mag":"2783049383"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548318000500","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000500","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/49169F4D710A2657F4FA70E3E345AE03/S0963548318000500a.pdf/div-class-title-an-upper-bound-on-the-size-of-avoidance-couplings-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/49169F4D710A2657F4FA70E3E345AE03/S0963548318000500a.pdf/div-class-title-an-upper-bound-on-the-size-of-avoidance-couplings-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"ERIK BATES","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ERIK BATES","raw_affiliation_strings":["Department of Mathematics, Stanford University, Stanford, CA 94305, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Stanford University, Stanford, CA 94305, USA (e-mail:","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":null,"display_name":"LISA SAUERMANN","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"LISA SAUERMANN","raw_affiliation_strings":["Department of Mathematics, Stanford University, Stanford, CA 94305, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Stanford University, Stanford, CA 94305, USA (e-mail:","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.2438,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54538157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"28","issue":"3","first_page":"325","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.24899999797344208,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.24899999797344208,"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/T11716","display_name":"Random Matrices and Applications","score":0.16019999980926514,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.1347000002861023,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7526999711990356},{"id":"https://openalex.org/keywords/bernoullis-principle","display_name":"Bernoulli's principle","score":0.5321000218391418},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5034999847412109},{"id":"https://openalex.org/keywords/coupling","display_name":"Coupling (piping)","score":0.4648999869823456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44510000944137573}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7526999711990356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6237000226974487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5712000131607056},{"id":"https://openalex.org/C152361515","wikidata":"https://www.wikidata.org/wiki/Q181328","display_name":"Bernoulli's principle","level":2,"score":0.5321000218391418},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3555000126361847},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.33489999175071716},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2937999963760376}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548318000500","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000500","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/49169F4D710A2657F4FA70E3E345AE03/S0963548318000500a.pdf/div-class-title-an-upper-bound-on-the-size-of-avoidance-couplings-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1712.00210","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.00210","pdf_url":"https://arxiv.org/pdf/1712.00210","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548318000500","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000500","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/49169F4D710A2657F4FA70E3E345AE03/S0963548318000500a.pdf/div-class-title-an-upper-bound-on-the-size-of-avoidance-couplings-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1665191782","display_name":null,"funder_award_id":"14747","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2783049383.pdf","grobid_xml":"https://content.openalex.org/works/W2783049383.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1572831580","https://openalex.org/W1964535518","https://openalex.org/W2037520821","https://openalex.org/W2048464222","https://openalex.org/W2086906020","https://openalex.org/W2156902791","https://openalex.org/W2160227050","https://openalex.org/W2231670391","https://openalex.org/W3037288318","https://openalex.org/W3037682858","https://openalex.org/W6606532625"],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"a":[3,64],"coupling":[4],"of":[5,34,56,59],"non-colliding":[6],"simple":[7],"random":[8,61],"walkers":[9],"on":[10,14],"the":[11,28],"complete":[12],"graph":[13],"n":[15,21,24,35],"vertices":[16],"can":[17],"include":[18],"at":[19],"most":[20],"-":[22,36],"log":[23],"walkers.":[25],"This":[26],"improves":[27],"only":[29],"previously":[30],"known":[31],"upper":[32],"bound":[33],"2":[37],"due":[38],"to":[39],"Angel,":[40],"Holroyd,":[41],"Martin,":[42],"Wilson":[43],"and":[44],"Winkler":[45],"(":[46],"Electron.":[47],"Commun.":[48],"Probab.":[49],"18":[50],"(2013)).":[51],"The":[52],"proof":[53],"considers":[54],"couplings":[55],"i.i.d.":[57],"sequences":[58],"Bernoulli":[60],"variables":[62],"satisfying":[63],"similar":[65],"avoidance":[66],"property,":[67],"for":[68],"which":[69],"there":[70],"is":[71],"separate":[72],"interest.":[73]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2018-01-26T00:00:00"}