uu.seUppsala University Publications

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

Correlations for Paths in Random Orientations of G(n, p) and G(n, m)PrimeFaces.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();
}
}
2011 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 39, no 4, p. 486-506Article in journal (Refereed) Published
##### Abstract [en]

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

2011. Vol. 39, no 4, p. 486-506
##### Keywords [en]

random directed graphs, correlation, directed paths, annealed, quenched
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:uu:diva-162440DOI: 10.1002/rsa.20358ISI: 000296716500002OAI: oai:DiVA.org:uu-162440DiVA, id: diva2:460923
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt520",{id:"formSmash:j_idt520",widgetVar:"widget_formSmash_j_idt520",multiple:true}); Available from: 2011-12-01 Created: 2011-11-30 Last updated: 2017-12-08Bibliographically approved

We study random graphs, both G(n, p) and G(n, m), with random orientations on the edges. For three fixed distinct vertices s, a, b we study the correlation, in the combined probability space, of the events {a -> s} and {s -> b}. For G(n, p), we prove that there is a p(c) = 1/2 such that for a fixed p < p(c) the correlation is negative for large enough n and for p > p(c) the correlation is positive for large enough n. We conjecture that for a fixed n >= 27 the correlation changes sign three times for three critical values of p. For G(n, m) it is similarly proved that, with p = m/((n)(2)), there is a critical p(c) that is the solution to a certain equation and approximately equal to 0.7993. A lemma, which computes the probability of non existence of any l directed edges in G(n, m), is thought to be of independent interest. We present exact recursions to compute P(a -> s) and P(a -> s, s -> b). We also briefly discuss the corresponding question in the quenched version of the problem.

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

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