✦ LIBER ✦

Graphs of Random Processes as Random Sets

✍ Scribed by Lyashenko, N. N.

Book ID: 118225021
Publisher: Society for Industrial and Applied Mathematics
Year: 1987
Tongue: English
Weight: 892 KB
Volume: 31
Category: Article
ISSN: 0040-585X
DOI: 10.1137/1131006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent sets in random sparse graphs

✍ Pedro G. Gazmuri 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Random closed sets viewed as random recu

Random closed sets viewed as random recursions

✍ R. Daniel Mauldin; Alexander P. McLinden 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 151 KB

Large independent sets in general random

Large independent sets in general random intersection graphs

✍ S. Nikoletseas; C. Raptopoulos; P. Spirakis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 335 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 intersection graph of random sets

✍ Hiroshi Maehara 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}

Superbranching processes and projections

Superbranching processes and projections of random Cantor sets

✍ F. M. Dekking; G. R. Grimmett 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 973 KB