scientific article; zbMATH DE number 1286037

DOI10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3MaRDI QIDQ4242579zbMATH OpenFDO

Authors Gregory Loren McColm

Publication date 15 February 2000

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3

zbMATH Keywords

first-order logicrandom graphsGilbert graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20) Classical first-order logic (03B10)

Recommendations

• Zero-one law for random subgraphs of some distance graphs with vertices in Z^n
• Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
• Zero-one laws for graphs with edge probabilities decaying with distance. Part I
• Zero-one laws for random graphs with vertices in a Boolean cube

Cites work

• scientific article; zbMATH DE number 53570 (Why is no real title available?)
• scientific article; zbMATH DE number 193944 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• A splitting inequality
• A zero‐one law for a random subset
• Can you feel the double jump?
• Convergence in homogeneous random graphs
• Cybernetics
• Eventual periodicity and ``one-dimensional queries
• Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic
• Nonconvergence, undecidability, and intractability in asymptotic problems
• Parametrization over inductive relations of a bounded number of variables
• Random Plane Networks
• Random sparse unary predicates
• Random unary predicates: Almost sure theories and countable models
• Some remarks on the theory of graphs
• Structure and complexity of relational queries
• The logic of ordered random structures
• Unit disk graphs

Cited in

(7)

• \(\gamma\)-variable first-order logic of uniform attachment random graphs
• MSO 0-1 law for recursive random trees
• \( \gamma \)-variable first-order logic of preferential attachment random graphs
• MSO zero-one laws on random labelled acyclic graphs
• Logical convergence laws via stochastic approximation and Markov processes
• On the typical case complexity of graph optimization
• First order complexity of finite random structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242579)