论文信息 - Random Graph Orders Do Not Satisfy a 0-1 Law

Random Graph Orders Do Not Satisfy a 0-1 Law

The random graph order Pn p is defined by taking a random graph Gn p on vertex set [n], interpreting an edge between vertices i and j, with i <j in [n], as a relation i <j, and taking the transitive closure. We present a first—order property 𝓁 of Pn p such that the limiting probability of 𝓁. is bounded away from both 0 and 1 as n → ∞, whenever pn is bounded away from 0 and p is bounded away from 1. © 1995 John Wiley & Sons, Inc.

Graham R. Brightwell

[1] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.

[2] J. Spencer,et al. Zero-one laws for sparse random graphs , 1988 .

[3] Joel H. Spencer,et al. Threshold spectra via the Ehrenfeucht game , 1991, Discret. Appl. Math..

[4] Charles M. Newman,et al. Chain Lengths in Certain Random Directed Graphs , 1992, Random Struct. Algorithms.

[5] Tomasz Łuczak. First order properties of random posets , 1991 .

[6] Peter Dolan. A Zero-One Law for Random Subset , 1991, Random Struct. Algorithms.

[7] Paul Erdös,et al. On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph , 1984 .

[8] K. Compton. Laws in Logic and Combinatorics , 1989 .

[9] Yu. V. Glebskii,et al. Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[10] Noga Alon,et al. LINEAR EXTENSIONS OF A RANDOM PARTIAL ORDER , 1994 .

[11] Saharon Shelah,et al. Random Sparse Unary Predicates , 1994, Random Struct. Algorithms.

[12] Michael H. Albert,et al. Random graph orders , 1989 .