✦ LIBER ✦

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes

✍ Scribed by Konstantinos Panagiotou; Reto Spöhel; Angelika Steger; Henning Thomas

Book ID: 119236635
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 204 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.10.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The Critical Point ofk-Clique Percolatio

The Critical Point ofk-Clique Percolation in the Erdős–Rényi Graph

✍ Gergely Palla; Imre Derényi; Tamás Vicsek 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 210 KB

Treewidth of Erdős–Rényi random graphs,

Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs

✍ Yong Gao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 269 KB

The large deviation principle for the Er

The large deviation principle for the Erdős-Rényi random graph

✍ Sourav Chatterjee; S.R.S. Varadhan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 296 KB

On Reversible Cascades in Scale-Free and

On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs

✍ Ching-Lueh Chang, Chao-Hong Wang 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 563 KB

Fast online graph clustering via Erdős–R

Fast online graph clustering via Erdős–Rényi mixture

✍ Hugo Zanghi; Christophe Ambroise; Vincent Miele 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 973 KB