Continuum percolation theory

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics and probability theory, continuum percolation theory is a branch of mathematics that extends discrete percolation theory to continuous space (often Euclidean space n). More specifically, the underlying points of discrete percolation form types of lattices whereas the underlying points of continuum percolation are often randomly positioned in some continuous space and form a type of point process. For each point, a random shape is frequently placed on it and the shapes overlap each with other to form clumps or components. As in discrete percolation, a common research focus of continuum percolation is studying the conditions of occurrence for infinite or giant components.[1][2] Other shared concepts and analysis techniques exist in these two types of percolation theory as well as the study of random graphs and random geometric graphs.

Continuum percolation arose from an early mathematical model for wireless networks,[2][3] which, with the rise of several wireless network technologies in recent years, has been generalized and studied in order to determine the theoretical bounds of information capacity and performance in wireless networks.[4][5] In addition to this setting, continuum percolation has gained application in other disciplines including biology, geology, and physics, such as the study of porous material and semiconductors, while becoming a subject of mathematical interest in its own right.[6]

Early history[edit]

In the early 1960s Edgar Gilbert[3] proposed a mathematical model in wireless networks that gave rise to the field of continuum percolation theory, thus generalizing discrete percolation.[2] The underlying points of this model, sometimes known as the Gilbert disk model, were scattered uniformly in the infinite plane 2 according to a homogeneous Poisson process. Gilbert, who had noticed similarities between discrete and continuum percolation,[7] then used concepts and techniques from the probability subject of branching processes to show that a threshold value existed for the infinite or "giant" component.

Definitions and terminology[edit]

The exact names, terminology, and definitions of these models may vary slightly depending on the source, which is also reflected in the use of point process notation.

Common models[edit]

A number of well-studied models exist in continuum percolation, which are often based on homogeneous Poisson point processes.

Disk model[edit]

Consider a collection of points {xi} in the plane 2 that form a homogeneous Poisson process Φ with constant (point) density λ. For each point of the Poisson process (i.e. xiΦ, place a disk Di with its center located at the point xi. If each disk Di has a random radius Ri (from a common distribution) that is independent of all the other radii and all the underlying points {xi}, then the resulting mathematical structure is known as a random disk model.

Boolean model[edit]

Given a random disk model, if the set union of all the disks {Di} is taken, then the resulting structure i Di is known as a Boolean–Poisson model (also known as simply the Boolean model),[8] which is a commonly studied model in continuum percolation[1] as well as stochastic geometry.[8] If all the radii are set to some common constant, say, r > 0, then the resulting model is sometimes known as the Gilbert disk (Boolean) model.[9]

Percolation in the Boolean–Poisson (constant disk) model.
Simulation of 4 Poisson–Boolean (constant-radius or Gilbert disk) models as the density increases with largest clusters in red.

Germ-grain model[edit]

The disk model can be generalized to more arbitrary shapes where, instead of a disk, a random compact (hence bounded and closed in 2) shape Si is placed on each point xi. Again, each shape Si has a common distribution and independent to all other shapes and the underlying (Poisson) point process. This model is known as the germ–grain model where the underlying points {xi} are the germs and the random compact shapes Si are the grains. The set union of all the shapes forms a Boolean germ-grain model. Typical choices for the grains include disks, random polygon and segments of random length.[8]

Boolean models are also examples of stochastic processes known as coverage processes.[10] The above models can be extended from the plane 2 to general Euclidean space n.

Components and criticality[edit]

In the Boolean–Poisson model, disks there can be isolated groups or clumps of disks that do not contact any other clumps of disks. These clumps are known as components. If the area (or volume in higher dimensions) of a component is infinite, one says it is an infinite or "giant" component. A major focus of percolation theory is establishing the conditions when giant components exist in models, which has parallels with the study of random networks. If no big component exists, the model is said to be subcritical. The conditions of giant component criticality naturally depend on parameters of the model such as the density of the underlying point process.

Excluded area theory[edit]

The excluded area of a placed object is defined as the minimal area around the object into which an additional object cannot be placed without overlapping with the first object. For example, in a system of randomly oriented homogeneous rectangles of length l, width w and aspect ratio r = l/w, the average excluded area is given by:[11]

In a system of identical ellipses with semi-axes a and b and ratio r = a/b, and perimeter C, the average excluded areas is given by:[12]

The excluded area theory states that the critical number density (percolation threshold) Nc of a system is inversely proportional to the average excluded area Ar:

It has been shown via Monte-Carlo simulations that percolation threshold in both homogeneous and heterogeneous systems of rectangles or ellipses is dominated by the average excluded areas and can be approximated fairly well by the linear relation

with a proportionality constant in the range 3.1–3.5.[11][12]

Applications[edit]

Possible coverage model.
A Boolean model as a coverage model in a wireless network.

The applications of percolation theory are various and range from material sciences to wireless communication systems. Often the work involves showing that a type of phase transition occurs in the system.

Wireless networks[edit]

Wireless networks are sometimes best represented with stochastic models owing to their complexity and unpredictability, hence continuum percolation have been used to develop stochastic geometry models of wireless networks. For example, the tools of continuous percolation theory and coverage processes have been used to study the coverage and connectivity of sensor networks.[13][14] One of the main limitations of these networks is energy consumption where usually each node has a battery and an embedded form of energy harvesting. To reduce energy consumption in sensor networks, various sleep schemes have been suggested that entail having a subcollection of nodes go into a low energy-consuming sleep mode. These sleep schemes obviously affect the coverage and connectivity of sensor networks. Simple power-saving models have been proposed such as the simple uncoordinated 'blinking' model where (at each time interval) each node independently powers down (or up) with some fixed probability. Using the tools of percolation theory, a blinking Boolean Poisson model has been analyzed to study the latency and connectivity effects of such a simple power scheme.[13]

See also[edit]

References[edit]

  1. ^ a b Meester, R. (1996). Continuum Percolation. 119. Cambridge University Press.[ISBN missing]
  2. ^ a b c Franceschetti, M.; Meester, R. (2007). Random Networks for Communication: From Statistical Physics to Information Systems. 24. Cambridge University Press.[ISBN missing]
  3. ^ a b Gilbert, E. N. (1961). "Random plane networks". Journal of the Society for Industrial and Applied Mathematics. 9 (4): 533–543. doi:10.1137/0109045.
  4. ^ Dousse, O.; Baccelli, F.; Thiran, P. (2005). "Impact of interferences on connectivity in ad hoc networks". IEEE/ACM Transactions on Networking. 13 (2): 425–436. CiteSeerX 10.1.1.5.3971. doi:10.1109/tnet.2005.845546.
  5. ^ Dousse, O.; Franceschetti, M.; Macris, N.; Meester, R.; Thiran, P. (2006). "Percolation in the signal to interference ratio graph". Journal of Applied Probability. 2006: 552–562.
  6. ^ Balberg, I. (1987). "Recent developments in continuum percolation". Philosophical Magazine B. 56 (6): 991–1003. Bibcode:1987PMagB..56..991B. doi:10.1080/13642818708215336.
  7. ^ Hall, P. (1985). "On continuum percolation". The Annals of Probability. 13 (4): 1250–1266. doi:10.1214/aop/1176992809.
  8. ^ a b c Stoyan, D.; Kendall, W. S.; Mecke, J.; Ruschendorf, L. (1995). Stochastic Geometry and Its Applications. 2. Wiley Chichester.[ISBN missing]
  9. ^ Balister, Paul; Sarkar, Amites; Bollobás, Béla (2008). "Percolation, connectivity, coverage and colouring of random geometric graphs". Handbook of Large-Scale Random Networks. pp. 117–142.[ISBN missing]
  10. ^ Hall, P. (1988). Introduction to the theory of coverage processes. 1. New York: Wiley.[ISBN missing]
  11. ^ a b Li, Jiantong; Östling, Mikael (2013). "Percolation thresholds of two-dimensional continuum systems of rectangles". Physical Review E. 88 (1): 012101. Bibcode:2013PhRvE..88a2101L. doi:10.1103/PhysRevE.88.012101. ISSN 1539-3755. PMID 23944408.
  12. ^ a b Li, Jiantong; Östling, Mikael (2016). "Precise percolation thresholds of two-dimensional random systems comprising overlapping ellipses". Physica A: Statistical Mechanics and its Applications. 462: 940–950. Bibcode:2016PhyA..462..940L. doi:10.1016/j.physa.2016.06.020. ISSN 0378-4371.
  13. ^ a b Dousse, O.; Mannersalo, P.; Thiran, P. (2004). "Latency of wireless sensor networks with uncoordinated power saving mechanisms". Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM. pp. 109–120.
  14. ^ Gui, C.; Mohapatra, P. (2004). "Power conservation and quality of surveillance in target tracking sensor networks". Proceedings of the 10th Annual International Conference on Mobile Computing and Networking. ACM. pp. 129–143.