{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:25:12Z","timestamp":1771489512969,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2002,2,14]],"date-time":"2002-02-14T00:00:00Z","timestamp":1013644800000},"content-version":"unspecified","delay-in-days":44,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>For a stochastic approximation-type recursion with finitely many possible limit points, we \nfind a lower bound on the probability of converging to a prescribed point in its \u2018domain \nof attraction\u2019. This has implications for the lock-in phenomena in the stochastic models \nof increasing return economics and the sample complexity of stochastic approximation \nalgorithms in engineering.<\/jats:p>","DOI":"10.1017\/s0963548301004953","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:49:03Z","timestamp":1027777743000},"page":"11-20","source":"Crossref","is-referenced-by-count":17,"title":["On the Lock-in Probability \nof Stochastic Approximation"],"prefix":"10.1017","volume":"11","author":[{"given":"V. S.","family":"BORKAR","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,2,14]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548301004953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T19:19:33Z","timestamp":1554405573000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548301004953\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0963548301004953"],"URL":"https:\/\/doi.org\/10.1017\/s0963548301004953","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}