The structure of random automorphisms of the random graph

, , , &
Annals of Pure and Applied Logic 173 (9):103152 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103152

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
Local dependence in random graph models: Characterization, properties and statistical inference.M. Schweinberger & M. S. Handcock - unknown
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the saturated uncountable random graph.Steve Warner - 2004 - Archive for Mathematical Logic 43 (5):665-679.
Phase transitions in associative memory networks.Ben Goertzel - 1993 - Minds and Machines 3 (3):313-317.
Which subsets of an infinite random graph look random?Will Brian - 2018 - Mathematical Logic Quarterly 64 (6):478-486.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
On random as a cause.Enrique Morata - 2015 - Academia.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
What is a Random String?Cristian Calude - 1995 - Vienna Circle Institute Yearbook 3:101-113.
Sull’ambito del logicamente possibile secondo la concezione probabilistica di Bruno de Finetti.Pierpaolo Angelini - 2013 - Science and Philosophy 1 (1):131-142.
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.

Analytics

Added to PP
2022-06-05

Downloads
8 (#1,339,958)

6 months
5 (#703,779)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references