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

On Directed Random Graphs and Greedy Walks on Point ProcessesPrimeFaces.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}); 2016 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Description

##### Abstract [en]

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

Uppsala: Department of Mathematics, 2016. , 28 p.
##### Series

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

Directed random graphs, Tracy-Widom distribution, Poisson-weighted infinite tree, Greedy walk, Point processes
##### National Category

Probability Theory and Statistics
##### Identifiers

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

2016-12-09, Polhemsalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala, 13:15 (English)
##### Opponent

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt451",{id:"formSmash:j_idt451",widgetVar:"widget_formSmash_j_idt451",multiple:true});
Available from: 2016-11-15 Created: 2016-10-23 Last updated: 2016-11-15
##### List of papers

This thesis consists of an introduction and five papers, of which two contribute to the theory of directed random graphs and three to the theory of greedy walks on point processes.

We consider a directed random graph on a partially ordered vertex set, with an edge between any two comparable vertices present with probability *p*, independently of all other edges, and each edge is directed from the vertex with smaller label to the vertex with larger label. In Paper I we consider a directed random graph on ℤ^{2} with the vertices ordered according to the product order and we show that the limiting distribution of the centered and rescaled length of the longest path from (0,0) to (*n*, [*n ^{a}*] ),

The greedy walk is a deterministic walk on a point process that always moves from its current position to the nearest not yet visited point. Since the greedy walk on a homogeneous Poisson process on the real line, starting from 0, almost surely does not visit all points, in Paper III we find the distribution of the number of visited points on the negative half-line and the distribution of the index at which the walk achieves its minimum. In Paper IV we place homogeneous Poisson processes first on two intersecting lines and then on two parallel lines and we study whether the greedy walk visits all points of the processes. In Paper V we consider the greedy walk on an inhomogeneous Poisson process on the real line and we determine sufficient and necessary conditions on the mean measure of the process for the walk to visit all points.

1. Convergence to the Tracy-Widom distribution for longest paths in a directed random graph$(function(){PrimeFaces.cw("OverlayPanel","overlay1014917",{id:"formSmash:j_idt488:0:j_idt492",widgetVar:"overlay1014917",target:"formSmash:j_idt488:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Convergence of directed random graphs to the Poisson-weighted infinite tree$(function(){PrimeFaces.cw("OverlayPanel","overlay950354",{id:"formSmash:j_idt488:1:j_idt492",widgetVar:"overlay950354",target:"formSmash:j_idt488:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Distribution of the smallest visited point in a greedy walk on the line$(function(){PrimeFaces.cw("OverlayPanel","overlay1039178",{id:"formSmash:j_idt488:2:j_idt492",widgetVar:"overlay1039178",target:"formSmash:j_idt488:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Greedy walks on two lines$(function(){PrimeFaces.cw("OverlayPanel","overlay1039187",{id:"formSmash:j_idt488:3:j_idt492",widgetVar:"overlay1039187",target:"formSmash:j_idt488:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

5. The greedy walk on an inhomogeneous Poisson process$(function(){PrimeFaces.cw("OverlayPanel","overlay1039198",{id:"formSmash:j_idt488:4:j_idt492",widgetVar:"overlay1039198",target:"formSmash:j_idt488:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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

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