|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[mathematics]] and [[probability theory]], '''continuum percolation theory''' is a branch of mathematics that extends discrete [[percolation theory]] to continuous space (often [[Euclidean space]] {{math|'''R'''<sup>''n''</sup>}} ). 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.<ref name="meester1996continuum">R. Meester. ''Continuum percolation'', volume 119. Cambridge University Press, 1996.
| | It simple family friendly loop walk travels with farms with vibrant wildflowers, thicker brighten fir woods,Louis Vuitton Outlet as well as previous amazing cascades connected with Cataract Creek.<br>Hook potential sponsors using a brochure that describes your event and the benefits they'll reap from supporting it logos on your T shirts. Companies are often willing to donate products or services good way to get postride food.<br>[http://www.shlgrouptr.com/warm/?p=151 http://www.shlgrouptr.com/warm/?p=151] cheap ugg boots bailey bow, <br/> [http://www.shlgrouptr.com/warm/?p=369 http://www.shlgrouptr.com/warm/?p=369] cheap ugg hat and scarf, <br/> [http://www.shlgrouptr.com/warm/?p=60 http://www.shlgrouptr.com/warm/?p=60] cheap ugg boots perth, <br/> [http://www.shlgrouptr.com/warm/?p=12 http://www.shlgrouptr.com/warm/?p=12] cheap ugg classic tall boots, <br/> [http://www.shlgrouptr.com/warm/?p=339 http://www.shlgrouptr.com/warm/?p=339] cheap ugg adirondack boot ii, <br/> , <br/><br>http://gracechapel.kr/?document_srl=494932 |
| | |
| </ref><ref name="franceschetti2007random">M. Franceschetti and R. Meester. ''Random networks for communication: from statistical physics to information systems'', volume 24. Cambridge University Press, 2007.
| |
| | |
| </ref> 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 communication|wireless networks]],<ref name="franceschetti2007random"/><ref name="gilbert1961random">E. N. Gilbert. Random plane networks. ''Journal of the Society for Industrial \& Applied Mathematics'', 9(4):533–543, 1961.
| |
| | |
| </ref> 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.<ref name="dousse2005impact">O. Dousse, F. Baccelli, and P. Thiran. Impact of interferences on connectivity in ad hoc networks. ''Networking, IEEE/ACM Transactions on'', 13(2):425–436, 2005.
| |
| | |
| </ref><ref name="dousse2006percolation">O. Dousse, M. Franceschetti, N. Macris, R. Meester, and P. Thiran. Percolation in the signal to interference ratio graph. ''Journal of Applied Probability'', pages 552–562, 2006.
| |
| | |
| </ref> In additions to this setting, continuum percolation has gained application in other disciplines including biology, geology, and physics, such as the study of porous material and semi-conductors, while becoming a subject of mathematical interest in its own right.<ref name="balberg1987recent">I. Balberg. Recent developments in continuum percolation. ''Philosophical Magazine Part B'', 56(6):991–1003, 1987.
| |
| </ref>
| |
| | |
| ==Early history==
| |
| | |
| In the early 1960s [[Edgar Gilbert]] <ref name="gilbert1961random"/> proposed a mathematical model in wireless networks that gave rise to the field of continuum percolation theory, thus generalizing discrete percolation.<ref name="franceschetti2007random"/> The underlying points of this model, sometimes known as the Gilbert disk model, were scattered uniformly in the infinite plane {{math|'''R'''<sup>''2''</sup>}} according to a homogeneous [[Poisson process]]. Gilbert, who had noticed similarities between discrete and continuum percolation,<ref name="hall1985continuum">P. Hall. On continuum percolation. ''The Annals of Probability'', 13(4):1250–1266, 1985.</ref> then used concepts and techniques from the probability subject of [[branching processes]] to show that a [[Percolation threshold|threshold value]] existed for the infinite or "giant" component.
| |
| | |
| ==Definitions and terminology==
| |
| | |
| 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===
| |
| | |
| A number of well-studied models exist in continuum percolation, which are often based on homogeneous Poisson point processes.
| |
| | |
| ====Disk model====
| |
| | |
| Consider a collection of points <math> \{x_i \}</math> in the plane {{math|'''R'''<sup>''2''</sup>}} that form a homogeneous Poisson process <math> \Phi</math> with constant (point) density <math> \lambda</math>. For each point of the Poisson process (ie <math> x_i\in \Phi</math>), place a disk <math> D_i</math> with its center located at the point <math> x_i</math>. If each disk <math> D_i</math> has a random radius <math> R_i</math> (from a common [[Probability distribution|distribution]] ) that is [[Independence (probability theory)|independent]] of all the other radii and all the underlying points <math> \{x_i\}</math>, then the resulting mathematical structure is known as a random disk model.
| |
| | |
| ====Boolean model====
| |
| | |
| Given a random disk model, if the set union of all the disks <math> \{D_i \}</math> is taken, then the resulting structure <math> \cup_{i} D_i</math> is known as a Boolean–Poisson model (also known as simply the [[Boolean model (probability theory)|Boolean model]]),<ref name="stoyan1995stochastic">D. Stoyan, W. S. Kendall, J. Mecke, and L. Ruschendorf. ''Stochastic geometry and its applications'', volume 2. Wiley Chichester, 1995.</ref> which is a commonly studied model in continuum percolation <ref name="meester1996continuum"/> as well [[stochastic geometry]].<ref name="stoyan1995stochastic"/> 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.<ref name="balister2008percolation">Balister, Paul and Sarkar, Amites and Bollobás, Béla, Percolation, connectivity, coverage and colouring of random geometric graphs, Handbook of Large-Scale Random Networks, 117--142, 2008</ref>
| |
| | |
| [[File:Booleanpercolation.jpg|thumb|right|alt=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====
| |
| | |
| The disk model can be generalized to more arbitrary shapes where, instead of a disk, a random [[Compact space|compact]] (hence bounded and closed in {{math|'''R'''<sup>''2''</sup>}}) shape <math> S_i</math> is placed on each point <math> x_i</math>. Again, each shape <math> S_i</math> has a common [[Probability distribution|distribution]] and [[Independence (probability theory)|independent]] to all other shapes and the underlying (Poisson) point process. This model is known as the germ-grain model where the underlying points <math> \{x_i\}</math> are the "germs" and the random compact shapes <math> S_i</math> 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.<ref name="stoyan1995stochastic"/>
| |
| | |
| Boolean models are also examples of [[stochastic processes]] known as coverage processes.<ref name="hall1988introduction">P. Hall. ''Introduction to the theory of coverage processes'', volume 1. Wiley New York, 1988.
| |
| | |
| </ref> The above models can be extended from the plane {{math|'''R'''<sup>''2''</sup>}} to general Euclidean space {{math|'''R'''<sup>''n''</sup>}}.
| |
| | |
| ===Components and criticality===
| |
| | |
| 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 sub-critical. The conditions of giant component criticality naturally depend on parameters of the model such as the density of the underlying point process.
| |
| | |
| ==Applications==
| |
| | |
| 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===
| |
| | |
| 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.<ref name="dousse2004latency">O. Dousse, P. Mannersalo, and P. Thiran. Latency of wireless sensor networks with uncoordinated power saving mechanisms. In ''Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing'', pages 109–120. ACM, 2004.
| |
| | |
| </ref><ref name="gui2004power">C. Gui and P. Mohapatra. Power conservation and quality of surveillance in target tracking sensor networks. In ''Proceedings of the 10th annual international conference on Mobile computing and networking'', pages 129–143. ACM, 2004. | |
| | |
| </ref> 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 sub-collection 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.<ref name="dousse2004latency"/> | |
| | |
| [[File:BooleanCellCoverage.jpg|thumb|left|alt=Possible coverage model.|A Boolean model as a coverage model in a wireless network.]]
| |
| | |
| ==See also==
| |
| | |
| * [[Percolation theory]]
| |
| * [[Stochastic geometry]]
| |
| * [[Stochastic geometry models of wireless networks]]
| |
| * [[Random graphs]]
| |
| | |
| ==Textbooks==
| |
| | |
| * ''Continuum percolation'': Meester and Roy.<ref name="meester1996continuum"/>
| |
| * ''Discrete and continuum percolation in wireless networks'': Meester and Franceschetti.<ref name="franceschetti2007random"/>
| |
| | |
| ==References== | |
| | |
| <references/>
| |
| | |
| {{Stochastic processes}}
| |
| | |
| [[Category:Probability theory]]
| |
| [[Category:Stochastic geometry]]
| |
| [[Category:Phase transitions]]
| |
It simple family friendly loop walk travels with farms with vibrant wildflowers, thicker brighten fir woods,Louis Vuitton Outlet as well as previous amazing cascades connected with Cataract Creek.
Hook potential sponsors using a brochure that describes your event and the benefits they'll reap from supporting it logos on your T shirts. Companies are often willing to donate products or services good way to get postride food.
http://www.shlgrouptr.com/warm/?p=151 cheap ugg boots bailey bow,
http://www.shlgrouptr.com/warm/?p=369 cheap ugg hat and scarf,
http://www.shlgrouptr.com/warm/?p=60 cheap ugg boots perth,
http://www.shlgrouptr.com/warm/?p=12 cheap ugg classic tall boots,
http://www.shlgrouptr.com/warm/?p=339 cheap ugg adirondack boot ii,
,
http://gracechapel.kr/?document_srl=494932