๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Data analysis and the connectivity of random graphs

โœ Scribed by James V. Schultz; Lawrence J. Hubert

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
407 KB
Volume
10
Category
Article
ISSN
0022-2496

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Connectivity of random regular graphs ge
Connectivity of random regular graphs generated by the pegging algorithm
โœ Pu Gao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB ๐Ÿ‘ 1 views

## Abstract We study the connectivity of random __d__โ€regular graphs which are recursively generated by an algorithm motivated by a peerโ€toโ€peer network. We show that these graphs are asymptotically almost surely __d__โ€connected for any even constant __d__โฉพ4. ยฉ 2010 Wiley Periodicals, Inc. J Graph

Local connectivity of a random graph
Local connectivity of a random graph
โœ P. Erdรถs; E. M. Palmer; R. W. Robinson ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 255 KB

## Abstract A graph is locally connected if for each vertex ฮฝ of degree __โ‰ง2__, the subgraph induced by the vertices adjacent to ฮฝ is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

On the connectivity of graphs generated
On the connectivity of graphs generated by a sum of random mappings
โœ Jerzy Jaworski; Michaล‚ Karoล„ski ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 537 KB

## Abstract We consider four models of random directed multigraphs with __n__ labeled vertices of outโ€degree __d__. First we establish formal relationships between our models with respect to exact and asymptotic (as __n__ โ†’ โˆž) probabilities of possessing a graph monotone property. We also study the