scientific article; zbMATH DE number 238432

MaRDI QIDQ5287871zbMATH OpenFDO

Authors James Lynch

Publication date 5 August 1993

zbMATH Keywords

convergencefinite Markov chainsEhrenfeucht gamerandom wordfirst-order predicate calculusfinite random structuresmonadic second-order calculus

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Convergence in homogeneous random graphs
• An extension of 0‐1 laws
• Convergence of probabilities for the second order monadic properties of a random mapping
• Counting Finite Languages by Total Word Length
• On the convergence of probabilities of first-order sentences for recursive random graph models

Cited in

(7)

• Quasi-random words and limits of word sequences
• Density dichotomy in random words
• Large deviation principles for words drawn from correlated letter sequences
• scientific article; zbMATH DE number 7439745 (Why is no real title available?)
• Corrigendum: Emergence of order in random languages (2019 J. Phys. A: Math. Theor. 52 504001)
• Localisation-resistant random words with small alphabets
• Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers

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 Q5287871)