CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt165",{id:"formSmash:upper:j_idt165",widgetVar:"widget_formSmash_upper_j_idt165",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt166_j_idt168",{id:"formSmash:upper:j_idt166:j_idt168",widgetVar:"widget_formSmash_upper_j_idt166_j_idt168",target:"formSmash:upper:j_idt166:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Recursive Methods in Urn Models and First-Passage PercolationPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2011 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Uppsala: Department of Mathematics , 2011. , 30 p.
##### Series

Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 69
##### Keyword [en]

stochastic approximation algorithm, generalized Polya urn, limit theorem, first-passage percolation, rate of percolation, time constant
##### National Category

Probability Theory and Statistics
##### Research subject

Mathematical Statistics
##### Identifiers

URN: urn:nbn:se:uu:diva-145430ISBN: 978-91-506-2190-7 (print)OAI: oai:DiVA.org:uu-145430DiVA: diva2:396187
##### Public defence

2011-03-25, Häggsalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala, 13:15 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt476",{id:"formSmash:j_idt476",widgetVar:"widget_formSmash_j_idt476",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt482",{id:"formSmash:j_idt482",widgetVar:"widget_formSmash_j_idt482",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt488",{id:"formSmash:j_idt488",widgetVar:"widget_formSmash_j_idt488",multiple:true});
Available from: 2011-03-04 Created: 2011-02-09 Last updated: 2011-03-04
##### List of papers

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.

1. Generalized Pólya Urns via Stochastic Approximation$(function(){PrimeFaces.cw("OverlayPanel","overlay225226",{id:"formSmash:j_idt524:0:j_idt530",widgetVar:"overlay225226",target:"formSmash:j_idt524:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Limit theorems for stochastic approximation algorithms.$(function(){PrimeFaces.cw("OverlayPanel","overlay396177",{id:"formSmash:j_idt524:1:j_idt530",widgetVar:"overlay396177",target:"formSmash:j_idt524:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. First-Passage Percolation with Exponential Times on a Ladder$(function(){PrimeFaces.cw("OverlayPanel","overlay376395",{id:"formSmash:j_idt524:2:j_idt530",widgetVar:"overlay376395",target:"formSmash:j_idt524:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. First-passage percolation on ladder-like graphs with heterogeneous exponential times.$(function(){PrimeFaces.cw("OverlayPanel","overlay396175",{id:"formSmash:j_idt524:3:j_idt530",widgetVar:"overlay396175",target:"formSmash:j_idt524:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1204",{id:"formSmash:j_idt1204",widgetVar:"widget_formSmash_j_idt1204",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1257",{id:"formSmash:lower:j_idt1257",widgetVar:"widget_formSmash_lower_j_idt1257",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1258_j_idt1260",{id:"formSmash:lower:j_idt1258:j_idt1260",widgetVar:"widget_formSmash_lower_j_idt1258_j_idt1260",target:"formSmash:lower:j_idt1258:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});