✦ LIBER ✦

The statistics of random directed graphs

✍ Scribed by P. Whittle

Book ID: 105047271
Publisher: Springer
Year: 1989
Tongue: English
Weight: 657 KB
Volume: 56
Category: Article
ISSN: 0022-4715
DOI: 10.1007/bf01044448

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Generation of Directed Acyclic Gr

Random Generation of Directed Acyclic Graphs

✍ G. Melançon; I. Dutour; M. Bousquet-Mélou 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views

Statistical mechanics of random graphs

✍ Zdzisław Burda; Jerzy Jurkiewicz; André Krzywicki 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.

Random Walks on Directed Covers of Graph

Random Walks on Directed Covers of Graphs

✍ Lorenz A. Gilch; Sebastian Müller 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 684 KB

Majority-vote on directed Erdős–Rényi ra

Majority-vote on directed Erdős–Rényi random graphs

✍ F.W.S. Lima; A.O. Sousa; M.A. Sumuor 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter q c , as well as the critical exponents β/ν, γ /ν and 1/ν have been

Long cycles in subgraphs of (pseudo)rand

Long cycles in subgraphs of (pseudo)random directed graphs

✍ Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every 08γ81/2 we find a constant __c__ = __c__(γ) such that the following holds. Let __G__ = (__V, E__) be a (pseudo)random directed graph on __n__ vertice