Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable (in their natural topologies). For those which are amenable, we determine whether they are uniquely ergodic, leaving unsettled precisely one case (the ‘semi-generic’ complete multipartite directed graph). We also consider the Hrushovski property. For most of our results we use the various techniques of Angel et al [Random orderings and unique ergodicity of automorphism groups. J. Eur. Math. Soc. , 16 (2014), 2059–2095], suitably generalized to a context in which the universal minimal flow is not necessarily the space of all orders. Negative results concerning amenability rely on constructions of the type considered in Zucker [Amenability and unique ergodicity of automorphism groups of Fraïssé structures. Fund. Math. , 226 (2014), 41–61]. An additional class of structures (compositions) may be handled directly on the basis of very general principles. The starting point in all cases is the determination of the universal minimal flow for the automorphism group, which in the context of countable homogeneous directed graphs is given in Jasiński et al [Ramsey precompact expansions of homogeneous directed graphs. Electron. J. Combin. , 21 (4), (2014), 31] and the papers cited therein.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it