Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-29T15:15:00.981Z Has data issue: false hasContentIssue false

2 - Phase transitions in infinite networks

Published online by Cambridge University Press:  12 December 2009

Massimo Franceschetti
Affiliation:
University of California, San Diego
Ronald Meester
Affiliation:
Vrije Universiteit, Amsterdam
Get access

Summary

One of the advantages of studying random network models on the infinite plane is that it is possible to observe sharp phase transitions. Informally, a phase transition is defined as a phenomenon by which a small change in the local parameters of a system results in an abrupt change of its global behaviour, which can be observed over an infinite domain. We shall see in subsequent chapters how these phenomena observed on the infinite plane are a useful indication of the behaviour in a finite domain. For now, however, we stick with the analysis on the infinite plane.

The random tree; infinite growth

We start by making a precise statement on the possibility that the branching process introduced in Chapter 1 grows forever. This is trivially true when the offspring distribution is such that P(Xi ≥ 1) = 1, i.e., when each node in the tree has at least one child. However, it is perhaps less trivial that for generic offspring distribution it is still possible to have an infinite growth if and only if E(Xi) = μ > 1.

Theorem 2.1.1When μ ≤ 1 the branching process does not grow forever with probability one, except when P(X = 1) = 1. When μ > 1, the branching process grows forever with positive probability.

The proof of Theorem 2.1.1 uses generating functions, so we start by saying a few words about these. Generating functions are a very convenient tool for all sorts of computations that would be difficult and tedious without them. These computations have to do with sums of random variables, expectations and variances.

Type
Chapter
Information
Random Networks for Communication
From Statistical Physics to Information Systems
, pp. 17 - 68
Publisher: Cambridge University Press
Print publication year: 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×