Annals of Pure and Applied Logic 143 (1-3):79-86 (2006)

Abstract
We consider random processes more general than those considered by Erdös and Rényi for generating the countable random graph. It is proved that, in the category sense, almost all random processes we consider generate the countable random graph with probability 1. Under a weak boundedness assumption we give a criterion for the random processes which generate the countable random graph almost surely. We also consider further questions asked by Jackson regarding the outcome graphs when the process fails to produce the countable random graph.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2005.12.016
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,231
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
The Cofinality of the Random Graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The Cofinality of the Random Graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The Cofinality of the Saturated Uncountable Random Graph.Steve Warner - 2004 - Archive for Mathematical Logic 43 (5):665-679.
Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Ramsey Theory for Countable Binary Homogeneous Structures.Jean A. Larson - 2005 - Notre Dame Journal of Formal Logic 46 (3):335-352.
The Modal Logic of the Countable Random Frame.Valentin Goranko & Bruce Kapron - 2003 - Archive for Mathematical Logic 42 (3):221-243.
Infinitary Logics and Very Sparse Random Graphs.James Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Phase Transitions in Associative Memory Networks.Ben Goertzel - 1993 - Minds and Machines 3 (3):313-317.
Random Closed Sets Viewed as Random Recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
What is a Random String?Cristian Calude - 1995 - Vienna Circle Institute Yearbook 3:101-113.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
On the Construction of Effectively Random Sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.

Analytics

Added to PP index
2013-12-31

Total views
11 ( #855,567 of 2,518,147 )

Recent downloads (6 months)
1 ( #408,577 of 2,518,147 )

How can I increase my downloads?

Downloads

My notes