An extension of 0‐1 laws

DOI10.1002/RSA.3240050115zbMath0789.03014OpenAlexW1497377634WikidataQ115150346 ScholiaQ115150346MaRDI QIDQ4288886

James F. Lynch

Publication date: 16 May 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050115

zbMATH Keywords

random graphfinite structuresrapidly mixing Markov chainsexpected waiting timeedge probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Foundations of classical theories (including reverse mathematics) (03B30) Model theory of finite structures (03C13)

Related Items (3)

Infinitary logics and very sparse random graphs ⋮ Counting finite models ⋮ On probabilistic elimination of generalized quantifiers

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of 0‐1 laws