Book Chapter10.1007/978-1-4614-7254-4_22
The Random Graph
Peter J. Cameron
- 31 Jan 2013
- pp 353-378
TL;DR: A survey of countably infinite random graphs and their automorphism groups can be found in this paper, where the authors show that there is a unique (and highly symmetric) countably infinitely infinite random graph.
read more
Abstract: Erdős and Renyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Introduction to random graphs
Alan Frieze,Michał Karoński +1 more
- 01 Jan 2016
TL;DR: All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
•Book
The Game of Cops and Robbers on Graphs
Anthony Bonato,Richard J. Nowakowski +1 more
- 02 Sep 2011
TL;DR: One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games.
432
Weight choosability of graphs
TL;DR: In this paper, it was shown that the answer is positive for several classes of graphs, including complete graphs, complete bipartite graphs, and trees (except K2), even with lists of size two.
175
Deterministic random walks on regular trees
TL;DR: In this paper, it was shown that for any deviation D there is an initial configuration of chips such that after running the rotor-router model for a certain time there is a vertex with at least D more chips than expected in the random walk model, however, to achieve a deviation of D it is necessary that at least exp(Ω(D2)) vertices contribute by being occupied by a number of chips not divisible by k.
141
References
The small-world phenomenon: an algorithmic perspective
Jon Kleinberg
- 01 May 2000
TL;DR: A method of improving certain characteristics of cadmium mercury telluride single crystal material by heat treating thesingle crystal material in the presence of both tellurium and mercury.
Model Theory: Index
Wilfrid Hodges
- 01 Jan 1993
TL;DR: A new structure is produced without the canonical base property, which is interpretable in Baudisch’s group, and is CM-trivial, and thus at the lowest possible level of the ample hierarchy.
1.4K
•Book
Oligomorphic permutation groups
Peter J. Cameron
- 01 Jan 1990
TL;DR: In this paper, a wide range of techniques are used: group theory, combinatorics, Baire category and measure among them, as well as many recent results from a variety of sources.