scholarly journals Packing Arborescences in Random Digraphs

2019 ◽  
Vol 33 (1) ◽  
pp. 438-453
Author(s):  
Carlos Hoppen ◽  
Roberto F. Parente ◽  
Cristiane M. Sato
Keyword(s):  
Random Digraphs

scholarly journals Random walk on sparse random digraphs

2017 ◽  
Vol 170 (3-4) ◽  
pp. 933-960 ◽  
Author(s):  
Charles Bordenave ◽  
Pietro Caputo ◽  
Justin Salez
Keyword(s):  
Random Walk ◽  
Random Digraphs

Strong K-Connectivity in Digraphs and Random Digraphs

1981 ◽  
Author(s):  
John H. Reif ◽  
Paul G. Spirakis
Keyword(s):  
Random Digraphs

scholarly journals Packing and counting arbitrary Hamilton cycles in random digraphs

2018 ◽  
Vol 54 (3) ◽  
pp. 499-514
Author(s):  
Asaf Ferber ◽  
Eoin Long
Keyword(s):  
Hamilton Cycles ◽  
Random Digraphs

scholarly journals PageRank on inhomogeneous random digraphs

2020 ◽  
Vol 130 (4) ◽  
pp. 2312-2348
Author(s):  
Jiung Lee ◽  
Mariana Olvera-Cravioto
Keyword(s):  
Random Digraphs

scholarly journals Walks on random digraphs

1996 ◽  
Vol 9 (1) ◽  
pp. 43-47
Author(s):  
B. Goertzel ◽  
H. Bowman
Keyword(s):  
Random Digraphs

scholarly journals Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph

2012 ◽  
Vol 49 (3) ◽  
pp. 601-611 ◽  
Author(s):  
Mindaugas Bloznelis ◽  
Friedrich Götze ◽  
Jerzy Jaworski
Keyword(s):  
Critical Point ◽  
General Model ◽  
Branching Process ◽  
Process Approach ◽  
Giant Component ◽  
Strongly Connected ◽  
Random Digraphs

We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and on its orientation. For this model, the critical point for the emergence of a giant component is determined via a branching process approach.

Sign in / Sign up

Export Citation Format

Share Document