{"id":12683,"date":"2021-11-15T18:47:24","date_gmt":"2021-11-15T23:47:24","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12683"},"modified":"2026-06-02T14:59:26","modified_gmt":"2026-06-02T18:59:26","slug":"tr-139-the-theory-and-application-of-uni-dimensional-random-races-with-probabilistic-handicaps","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1988\/tr-139-the-theory-and-application-of-uni-dimensional-random-races-with-probabilistic-handicaps\/","title":{"rendered":"TR-139: The Theory and Application of Uni-Dimensional Random Races With Probabilistic Handicaps"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-139: The Theory and Application of Uni-Dimensional Random Races With Probabilistic Handicaps\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n<p>Carleton University<br>\n<a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1988\/\">Technical Report<\/a> <strong>TR-139<\/strong><br>\nJune 1988<\/p>\n\n\n\n<h2 id=\"the-theory-and-application-of-uni-dimensional-random-races-with-probabilistic-handicaps\" class=\"wp-block-heading tr_t1\">The Theory and Application of Uni-Dimensional Random Races With Probabilistic Handicaps<\/h2>\n\n\n\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">D.T.H. Ng, B.J. Oommen, E.R. Hansen<\/div>\n<\/div>\n<\/div>\n\n\n\n<div>\n<h3>Abstract<\/h3>\n<p>We consider the problem of M racers running towards a goal, where, at each instant, racer Ri moves towards the goal with a probability of Si and stays where he is with a probability of (1-Si)- Additionally, we permit each racer to be granted a certain handicap which allows him to start closer to the goal. This handicap may be stochastically assigned. In the simplest model, the racers run on multiple tracks, and in this scenario, each racer has his own track, thus disallowing interference between the racers. However, in a more general setting, the racers may run on a single track, in which case, interferences between racers are specified in terms of overtaking rules. In this paper, which we believe is a pioneering paper in this area, we first examine random races in a one dimensional space subject to the constraint that the race has multi-tracks and that exactly one racer moves towards the goal at any given instant. A powerful result is derived for the case when the individual racers are given no handicaps at all. Subsequently, a variety of results are proven for the cases when the racers are given handicaps which are either uniformly or geometrically distributed. In each of these cases, the results proved have been obtained for the setting when the length of the track is finite and for the asymptotic condition when the race is arbitrarily long. Analogous results for the single track race are also conjectured and these conjectures are strengthened by numerous simulations.<\/p>\n<\/div>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-139.pdf\">TR-139.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-139 June 1988 The Theory and Application of Uni-Dimensional Random Races With Probabilistic Handicaps D.T.H. Ng, B.J. Oommen, E.R. Hansen Abstract We consider the problem of M racers running towards a goal, where, at each instant, racer Ri moves towards the goal with a probability of Si and stays where he [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11829,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12683","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12683","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12683"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12683\/revisions"}],"predecessor-version":[{"id":12684,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12683\/revisions\/12684"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11829"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12683"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12683"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}