uu.seUppsala University Publications

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

Convergence of directed random graphs to the Poisson-weighted infinite treePrimeFaces.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)In: Journal of Applied Probability, ISSN 0021-9002, E-ISSN 1475-6072, Vol. 53, no 2, 463-474 p.Article in journal (Refereed) Published
##### Resource type

Text
##### Abstract [en]

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

2016. Vol. 53, no 2, 463-474 p.
##### Keyword [en]

Directed random graph, Poisson-weighted infinite tree, rooted geometric graph
##### National Category

Probability Theory and Statistics
##### Identifiers

URN: urn:nbn:se:uu:diva-299908DOI: 10.1017/jpr.2016.13ISI: 000378598700012OAI: oai:DiVA.org:uu-299908DiVA: diva2:950354
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt497",{id:"formSmash:j_idt497",widgetVar:"widget_formSmash_j_idt497",multiple:true});
Available from: 2016-07-29 Created: 2016-07-29 Last updated: 2016-10-23
##### In thesis

We consider a directed graph on the integers with a directed edge from vertex i to j present with probability n^{-1}, whenever i<j, independently of all other edges. Moreover, to each edge (i,j) we assign weight n^{-1}(j - i). We show that the closure of vertex 0 in such a weighted random graph converges in distribution to the Poisson-weighted infinite tree as n→∞. In addition, we derive limit theorems for the length of the longest path in the subgraph of the Poisson-weighted infinite tree which has all vertices at weighted distance of at most ρ from the root.

1. On Directed Random Graphs and Greedy Walks on Point Processes$(function(){PrimeFaces.cw("OverlayPanel","overlay1039330",{id:"formSmash:j_idt761:0:j_idt765",widgetVar:"overlay1039330",target:"formSmash:j_idt761:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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