Logical convergence laws via stochastic approximation and Markov processes
From MaRDI portal
Publication:6414964
arXiv2210.13437MaRDI QIDQ6414964FDOQ6414964
Authors: Yury Malyshkin, M. E. Zhukovskii 
Publication date: 24 October 2022
Abstract: In this paper we prove that the uniform attachment random graph with bounded degrees obeys the first-order convergence law. To prove the law, we describe the dynamics of the logical equivalence class of the random graph using Markov chains. The convergence law follows from the existence of a limit distribution of the considered Markov chain. To show the latter convergence, we use stochastic approximation processes.
This page was built for publication: Logical convergence laws via stochastic approximation and Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414964)
