✦ LIBER ✦

Connectivity in random networks

✍ Scribed by Derek F. Stubbs; Phillip I. Good

Publisher: Springer
Year: 1976
Tongue: English
Weight: 471 KB
Volume: 38
Category: Article
ISSN: 1522-9602
DOI: 10.1016/s0092-8240(76)80054-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SIR dynamics in random networks with het

SIR dynamics in random networks with heterogeneous connectivity

✍ Erik Volz 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 523 KB

The diameter and connectivity of network

The diameter and connectivity of networks with random dependent faults

✍ Evangelos Kranakis; Michel Paquette; Andrzej Pelc 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

Connectivity change in habitat networks

✍ Timothy C. Matisziw; Alan T. Murray 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 467 KB

k-connectivity in random undirected grap

k-connectivity in random undirected graphs

✍ John H Reif; Paul G Spirakis 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 591 KB

This paper concerns vertex connectivity in random graphs. We present results bounding the cardinality of the biggest k-block in random graphs of the G,~p model, for any constant value of k. Our results extend the work of Erd6s and R6nyi and Karp and Tarjan. We prove here that (~.~p, with [9 ~ tin, h

Connectivity of kautz networks

✍ J.-C. Bermond; N. Homobono; C. Peyrat 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 720 KB

We show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) have their connectivities equal to their minimum degrees. In view of their other properties, these results show that Kautz graphs are very good fault-tolerant networks.

Closure, connectivity and degree distrib

Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph