Search: onr:"swepub:oai:DiVA.org:uu-145430" > Recursive Methods i...
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 02892nam a2200445 4500 | |
001 | oai:DiVA.org:uu-145430 | |
003 | SwePub | |
008 | 110209s2011 | |||||||||||000 ||eng| | |
020 | a 9789150621907q print | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-1454302 URI |
040 | a (SwePub)uu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a vet2 swepub-contenttype |
072 | 7 | a dok2 swepub-publicationtype |
100 | 1 | a Renlund, Henrik,d 1979-u Uppsala universitet,Matematisk statistik4 aut0 (Swepub:uu)henre358 |
245 | 1 0 | a Recursive Methods in Urn Models and First-Passage Percolation |
264 | 1 | a Uppsala :b Department of Mathematics,c 2011 |
300 | a 30 s. | |
338 | a electronic2 rdacarrier | |
490 | 0 | a Uppsala Dissertations in Mathematics,x 1401-2049 ;v 69 |
520 | a This PhD thesis consists of a summary and four papers which deal with stochastic approximation algorithms and first-passage percolation. Paper I deals with the a.s. limiting properties of bounded stochastic approximation algorithms in relation to the equilibrium points of the drift function. Applications are given to some generalized Pólya urn processes. Paper II continues the work of Paper I and investigates under what circumstances one gets asymptotic normality from a properly scaled algorithm. The algorithms are shown to converge in some other circumstances, although the limiting distribution is not identified. Paper III deals with the asymptotic speed of first-passage percolation on a graph called the ladder when the times associated to the edges are independent, exponentially distributed with the same intensity. Paper IV generalizes the work of Paper III in allowing more edges in the graph as well as not having all intensities equal. | |
650 | 7 | a NATURVETENSKAPx Matematikx Sannolikhetsteori och statistik0 (SwePub)101062 hsv//swe |
650 | 7 | a NATURAL SCIENCESx Mathematicsx Probability Theory and Statistics0 (SwePub)101062 hsv//eng |
653 | a stochastic approximation algorithm | |
653 | a generalized Polya urn | |
653 | a limit theorem | |
653 | a first-passage percolation | |
653 | a rate of percolation | |
653 | a time constant | |
653 | a Mathematical statistics | |
653 | a Matematisk statistik | |
653 | a Mathematical Statistics | |
653 | a Matematisk statistik | |
700 | 1 | a Alm, Sven Erick,c Professoru Uppsala universitet,Matematisk statistik4 ths |
700 | 1 | a Janson, Svante,c Professoru Uppsala universitet,Matematiska institutionen4 ths |
700 | 1 | a Wierman, John,c Professoru Johns Hopkins University, Dept. of Applied Mathematics and Statistics4 opn |
710 | 2 | a Uppsala universitetb Matematisk statistik4 org |
856 | 4 | u https://uu.diva-portal.org/smash/get/diva2:396187/FULLTEXT01.pdfx primaryx Raw objecty fulltext |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-145430 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.