Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Invariant random graphs with iid degrees in a general geography
Download PDF
Download PDF
  • Published: 13 June 2008

Invariant random graphs with iid degrees in a general geography

  • Johan Jonasson1,2 

Probability Theory and Related Fields volume 143, pages 643–656 (2009)Cite this article

  • 75 Accesses

  • 3 Citations

  • Metrics details

Abstract

Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive finite-degree graph. Continuing the work of Deijfen and Meester (Adv Appl Probab 38:287–298) and Deijfen and Jonasson (Electron Comm Probab 11:336–346), we seek an Aut(G)-invariant random graph model with V as vertex set, iid degrees distributed as D and finite mean connections (i.e., the sum of the edge lengths in the graph metric of G of a given vertex has finite expectation). It is shown that if G has either polynomial growth or rapid growth, then such a random graph model exists if and only if \({\mathbb{E}[D\,R(D)] < \infty}\). Here R(n) is the smallest possible radius of a combinatorial ball containing more than n vertices. With rapid growth we mean that the number of vertices in a ball of radius n is of at least order exp(n c) for some c > 0. All known transitive graphs have either polynomial or rapid growth. It is believed that no other growth rates are possible. When G has rapid growth, the result holds also when the degrees form an arbitrary invariant process. A counter-example shows that this is not the case when G grows polynomially. For this case, we provide other, quite sharp, conditions under which the stronger statement does and does not hold respectively. Our work simplifies and generalizes the results for \({G\,=\,\mathbb {Z}}\) in [4] and proves, e.g., that with \({G\,=\,\mathbb {Z}^d}\), there exists an invariant model with finite mean connections if and only if \({\mathbb {E}[D^{(d+1)/d}] < \infty}\). When G has exponential growth, e.g., when G is a regular tree, the condition becomes \({\mathbb {E}[D\,\log\,D] < \infty}\).

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Bartholdi L.: The growth of Grigorchuk’s torsion group. Int. Math. Res. Notices 20, 1049–1054 (1998)

    Article  MathSciNet  Google Scholar 

  2. Baum E., Katz M.: Convergence rates in the law of large numbers. Trans. Am. Math. Soc. 120, 108–123 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benjamini I., Lyons R., Peres Y., Schramm O.: Group-invariant percolation on graphs. Geom. Funct. Anal. 9, 29–66 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Deijfen M., Jonasson J.: Stationary random graphs on \(\mathbb{Z}\) with prescribed iid degrees and finite mean connections. Electron. Comm. Probab. 11, 336–346 (2006)

    MATH  MathSciNet  Google Scholar 

  5. Deijfen M., Meester R.: Generating stationary random graphs on \(\mathbb{Z}\) with prescribed iid degrees. Adv. Appl. Probab. 38, 287–298 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Grigorchuk R.: On the Milnor problem of group growth. Sov. Math. Dokl. 28, 23–26 (1983)

    MATH  Google Scholar 

  7. Hoffman C., Holroyd A., Peres Y.: A stable marriage of Poisson and Lebesgue. Ann. Probab. 34, 1241–1272 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Imrich W., Seifter N.: A survey on graphs with polynomial growth. Discrete Math. 95, 101–117 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kaimanovich V., Vershik A.: Random walks on discrete groups: boundary and entropy. Ann. Probab. 11, 457–490 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Göteborg, Sweden

    Johan Jonasson

  2. Göteborg University, Göteborg, Sweden

    Johan Jonasson

Authors
  1. Johan Jonasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johan Jonasson.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Jonasson, J. Invariant random graphs with iid degrees in a general geography. Probab. Theory Relat. Fields 143, 643–656 (2009). https://doi.org/10.1007/s00440-008-0160-z

Download citation

  • Received: 02 April 2007

  • Revised: 12 May 2008

  • Published: 13 June 2008

  • Issue Date: March 2009

  • DOI: https://doi.org/10.1007/s00440-008-0160-z

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Random graphs
  • Degree distribution
  • Automorphism
  • Invariant model
  • Mass-transport principle
  • Unimodular graph
  • Polynomial growth
  • Intermediate growth
  • Exponential growth

Mathematics Subject Classification (2000)

  • 05C80
  • 60B15
  • 60G10
  • 60G50
  • 60K35
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature