Abstract
When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.
Original language | English (US) |
---|---|
Pages (from-to) | 191-204 |
Number of pages | 14 |
Journal | Random Structures & Algorithms |
Volume | 5 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1994 |
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics