Invariant random graphs with iid degrees in a general geography
Let \(G\) be an infinite transitive finite-degree graph specifying the space geography into which an automorphism-invariant random graph with specified degree distribution should be defined. The existence of such random graphs is investigated when \(G\) has polynomial, exponential, or intermediate growth rate. Conditions are given on the expected edge lengths and on the degree distribution. Special cases of \(G\) considered are integer lattices and regular trees of degree three or more. More exotic geographies include the Trofimov graph, the Diestel-Leader graphs, and the Grigorchuk group.
- Stationary random graphs with prescribed iid degrees on a spatial Poisson process
- Stationary random graphs on Z with prescribed iid degrees and finite mean connections
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Generating infinite random graphs
- Distance in random graphs with infinite mean degrees
- A stable marriage of Poisson and Lebesgue
- A survey on graphs with polynomial growth
- Convergence Rates in the Law of Large Numbers
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Group-invariant percolation on graphs
- scientific article; zbMATH DE number 3871636 (Why is no real title available?)
- scientific article; zbMATH DE number 1267534 (Why is no real title available?)
- Random walks on discrete groups: Boundary and entropy
- Stationary random graphs on Z with prescribed iid degrees and finite mean connections
This page was built for publication: Invariant random graphs with iid degrees in a general geography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017891)