DOCSLIB.ORG

Course Notes for EE 87021 Advanced Topics in Random Wireless Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Course Notes for EE 87021 Advanced Topics in Random Wireless Networks Course Notes for EE 87021 Advanced Topics in Random Wireless Networks Martin Haenggi November 1, 2010 c Martin Haenggi, 2010 ii Contents I Point Process Theory 1 1 Introduction 3 1.1 Motivation . 3 1.2 Asymptotic Notation . 3 2 Description of Point Processes 5 2.1 One-dimensional Point Processes . 5 2.2 General Point Processes . 5 2.3 Basic Point Processes . 6 2.3.1 One-dimensional Poisson processes . 6 2.3.2 Spatial Poisson processes . 7 2.3.3 General Poisson point processes . 7 2.4 Distributional Characterization . 7 2.4.1 The distribution of a point process . 8 2.4.2 Comparison with numerical random variables . 8 2.4.3 Distribution of a point process viewed as a random set . 9 2.4.4 Finite-dimensional distributions and capacity functional . 9 2.4.5 Measurable decomposition . 10 2.4.6 Intensity measure . 11 2.5 Properties of Point Processes . 11 2.6 Point Process Transformations . 12 2.6.1 Shaping an inhomogeneous Poisson point process . 12 2.7 Distances . 14 2.8 Marked point processes . 14 3 Sums over Point Processes 17 3.1 Notation . 17 3.2 Campbell’s Theorem for the Mean . 18 3.3 The Probability Generating Functional . 19 3.3.1 The moment-generating function of the sum . 19 3.3.2 The characteristic or Laplace functional for the Poisson point process . 21 3.3.3 The probability generating functional for the Poisson point process . 21 3.3.4 Relationship between moment-generating function and the functionals . 22 3.4 Applications . 23 3.4.1 Mean interference in stationary point process . 23 iii 3.4.2 Variance of the interference in stationary Poisson point process . 25 3.4.3 Interference from nearest transmitters . 25 3.4.4 Interference distribution without fading . 26 3.4.5 Interference distribution with fading . 28 3.4.6 Outage in Poisson networks with Rayleigh fading . 29 3.5 Stable Distributions . 30 3.5.1 Definition . 30 3.5.2 LePage Series representation . 30 3.5.3 Shot noise . 30 4 Moment Measures of Point Processes 31 4.1 Introduction . 31 4.2 The First-Order Moment Measure . 31 4.2.1 Constant density vs. stationarity . 32 4.3 Second Moment Measures . 32 4.4 Second Moment Density . 35 4.5 Second Moments for Stationary Processes . 39 5 Conditioning and Palm Theory 43 5.1 Introduction and Basic Concepts for Stationary Point Processes . 43 5.1.1 The local approach . 43 5.1.2 The global approach . 45 5.2 The Palm Distribution . 45 5.2.1 Heuristic introduction . 45 5.2.2 A first definition of the Palm distribution (stationary point processes) . 46 5.2.3 A second definition of the Palm distribution (general point processes) . 47 5.2.4 Alternative interpretation and conditional intensity . 50 5.3 The Reduced Palm Distribution . 50 5.3.1 Definition . 50 5.3.2 Palm distribution for PPPs and proof of Slivnyak’s theorem . 51 5.3.3 Isotropy of Palm distributions . 52 5.3.4 Palm expectations . 52 5.4 Second Moments Measures and Palm Distributions for Stationary Processes . 52 II Percolation Theory, Connectivity, and Coverage 55 6 Introduction 57 6.1 Motivation . 57 6.2 What is Percolation? . 57 7 Bond and Site Percolation 59 7.1 Random Trees and Branching Processes . 59 7.1.1 Percolation on regular branching trees . 59 7.1.2 Generalization to branching processes . 59 7.1.3 Site percolation on the branching tree . 64 7.1.4 Mean cluster size . 64 iv 7.2 Preliminaries for Bond Percolation on the Lattice . 65 7.3 General Behavior of the Percolation Probability . 66 7.3.1 The d-dimensional case . 66 7.3.2 Simple bounds on the percolation probability for the two-dimensional case . 67 7.3.3 Generalization of the lower bound . 69 7.4 Basic Techniques . 70 7.4.1 The FKG Inequality . 70 7.4.2 The BK Inequality . 72 7.4.3 Russo’s Formula . 73 7.4.4 The square-root trick . 75 7.5 Critical Threshold for Bond Percolation on the Square Lattice . 75 7.5.1 Subcritical Phase: Exponential decrease of the radius of the mean cluster size . 75 7.5.2 Supercritical phase: Uniqueness of the infinite open cluster . 76 7.5.3 Critical Threshold . 77 7.5.4 Ingredients used . 79 7.5.5 The Missing Theorem . 79 7.6 Further Results . 79 7.6.1 At the Critical Point . 79 7.6.2 Generalization to d dimensions. 80 7.7 Site Percolation . 81 7.7.1 Results . 82 7.7.2 Numerical Bounds . 83 8 Continuum Percolation 85 8.1 Gilbert’s Disk Graph . 85 8.1.1 Bounding using bond percolation on the square lattice . 85 8.1.2 Bounding using site percolation on the triangular lattice . 85 8.1.3 A better lower bound . 88 8.2 Other Percolation Models . 89 8.2.1 Interference Graph . 89 8.2.2 Secrecy Graph . 90 9 Connectivity 91 9.1 Full Connectivity . 91 9.2 More General Continuum Models . 92 9.2.1 Connectivity: Random connection model (RCM) . 92 9.3 (Abstract) Random Graphs . 93 10 Coverage 95 10.1 Germ-grain (Boolean) models . 95 10.1.1 Uniqueness of the infinite component . 95 v vi Part I Point Process Theory 1 Chapter 1 Introduction In the first part of the course, we give an introduction to stochastic geometry and, in particular, point process theory. 1.1 Motivation Basic questions: How to describe a (random) collection of points in two or three dimensions? • How about in one dimension? (In one dimension, renewal theory helps deal with processes with • independent increments. How to generalize from one dimension to two dimensions? What is the main difference? • Other random geometric objects: How to.
Load more

Recommended publications
  • A J-Function for Marked Point Patterns
    AISM (2006) 58: 235–259 DOI 10.1007/s10463-005-0015-7 M.N.M. van Lieshout A J -function for marked point patterns Received: 5 July 2004 / Revised: 7 February 2005 / Published online: 30 May 2006 © The Institute of Statistical Mathematics, Tokyo 2006 Abstract We propose a new summary statistic for marked point patterns. The underlying principle is to compare the distance from a marked point to the near- est other marked point in the pattern to the same distance seen from an arbitrary point in space. Information about the range of interaction can be inferred, and the statistic is well-behaved under random mark allocation. We develop a range of Hanisch style kernel estimators to tackle the problems of exploding tail variance earlier associated with J -function plug-in estimators, and carry out an exploratory analysis of a forestry data set. Keywords Empty space function · J -function · Marked point pattern · Mark correlation function · Nearest neighbour distance distribution function · Product density · Random labelling · Reduced second moment measure · Spatial interaction · Spatial statistics 1 Introduction Marked point patterns are spatial point configurations with a mark attached to each point (Stoyan and Stoyan, 1994). The points could represent the locations in (Euclidean) space of objects, while the marks capture additional information. The latter could be a type label, in which case we also speak of a multivariate point pattern (Cox and Lewis, 1972), a continuous measurement or shape descriptor, or a combination of these. The statistical analysis of such a pattern in general begins by plotting a few summary statistics. Which statistic is used depends on taste and the type of mark.
    [Show full text]
  • Generalized Factorial Cumulants Applied to Coulomb-Blockade Systems Signal
    Generalized factorial cumulants applied to Coulomb-blockade systems signal time Von der Fakultät für Physik der Universität Duisburg-Essen genehmigte Dissertation zur Erlangung des Grades Dr. rer. nat. von Philipp Stegmann aus Bottrop Tag der Disputation: 05.07.2017 Referent: Prof. Dr. Jürgen König Korreferent: Prof. Dr. Christian Flindt Korreferent: Prof. Dr. Thomas Guhr Summary Tunneling of electrons through a Coulomb-blockade system is a stochastic (i.e., random) process. The number of the transferred electrons per time interval is determined by a prob- ability distribution. The form of this distribution can be characterized by quantities called cumulants. Recently developed electrometers allow for the observation of each electron transported through a Coulomb-blockade system in real time. Therefore, the probability distribution can be directly measured. In this thesis, we introduce generalized factorial cumulants as a new tool to analyze the information contained in the probability distribution. For any kind of Coulomb-blockade system, these cumulants can be used as follows: First, correlations between the tunneling electrons are proven by a certain sign of the cumulants. In the limit of short time intervals, additional criteria indicate correlations, respectively. The cumulants allow for the detection of correlations which cannot be noticed by commonly used quantities such as the current noise. We comment in detail on the necessary ingredients for the presence of correlations in the short-time limit and thereby explain recent experimental observations. Second, we introduce a mathematical procedure called inverse counting statistics. The procedure reconstructs, solely from a few experimentally measured cumulants, character- istic features of an otherwise unknown Coulomb-blockade system, e.g., a lower bound for the system dimension and the full spectrum of relaxation rates.
    [Show full text]
  • Probabilistic and Geometric Methods in Last Passage Percolation
    Probabilistic and geometric methods in last passage percolation by Milind Hegde A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Alan Hammond, Co‐chair Professor Shirshendu Ganguly, Co‐chair Professor Fraydoun Rezakhanlou Professor Alistair Sinclair Spring 2021 Probabilistic and geometric methods in last passage percolation Copyright 2021 by Milind Hegde 1 Abstract Probabilistic and geometric methods in last passage percolation by Milind Hegde Doctor of Philosophy in Mathematics University of California, Berkeley Professor Alan Hammond, Co‐chair Professor Shirshendu Ganguly, Co‐chair Last passage percolation (LPP) refers to a broad class of models thought to lie within the Kardar‐ Parisi‐Zhang universality class of one‐dimensional stochastic growth models. In LPP models, there is a planar random noise environment through which directed paths travel; paths are as‐ signed a weight based on their journey through the environment, usually by, in some sense, integrating the noise over the path. For given points y and x, the weight from y to x is defined by maximizing the weight over all paths from y to x. A path which achieves the maximum weight is called a geodesic. A few last passage percolation models are exactly solvable, i.e., possess what is called integrable structure. This gives rise to valuable information, such as explicit probabilistic resampling prop‐ erties, distributional convergence information, or one point tail bounds of the weight profile as the starting point y is fixed and the ending point x varies.
    [Show full text]
  • Completely Random Measures and Related Models
    CRMs Sinead Williamson Background Completely random measures and related L´evyprocesses Completely models random measures Applications Normalized Sinead Williamson random measures Neutral-to-the- right processes Computational and Biological Learning Laboratory Exchangeable University of Cambridge matrices January 20, 2011 Outline CRMs Sinead Williamson 1 Background Background L´evyprocesses Completely 2 L´evyprocesses random measures Applications 3 Completely random measures Normalized random measures Neutral-to-the- right processes 4 Applications Exchangeable matrices Normalized random measures Neutral-to-the-right processes Exchangeable matrices A little measure theory CRMs Sinead Williamson Set: e.g. Integers, real numbers, people called James. Background May be finite, countably infinite, or uncountably infinite. L´evyprocesses Completely Algebra: Class T of subsets of a set T s.t. random measures 1 T 2 T . 2 If A 2 T , then Ac 2 T . Applications K Normalized 3 If A1;:::; AK 2 T , then [ Ak = A1 [ A2 [ ::: AK 2 T random k=1 measures (closed under finite unions). Neutral-to-the- right K processes 4 If A1;:::; AK 2 T , then \k=1Ak = A1 \ A2 \ ::: AK 2 T Exchangeable matrices (closed under finite intersections). σ-Algebra: Algebra that is closed under countably infinite unions and intersections. A little measure theory CRMs Sinead Williamson Background L´evyprocesses Measurable space: Combination (T ; T ) of a set and a Completely σ-algebra on that set. random measures Measure: Function µ between a σ-field and the positive Applications reals (+ 1) s.t. Normalized random measures 1 µ(;) = 0. Neutral-to-the- right 2 For all countable collections of disjoint sets processes P Exchangeable A1; A2; · · · 2 T , µ([k Ak ) = µ(Ak ).
    [Show full text]
  • Processes on Complex Networks. Percolation
    Chapter 5 Processes on complex networks. Percolation 77 Up till now we discussed the structure of the complex networks. The actual reason to study this structure is to understand how this structure influences the behavior of random processes on networks. I will talk about two such processes. The first one is the percolation process. The second one is the spread of epidemics. There are a lot of open problems in this area, the main of which can be innocently formulated as: How the network topology influences the dynamics of random processes on this network. We are still quite far from a definite answer to this question. 5.1 Percolation 5.1.1 Introduction to percolation Percolation is one of the simplest processes that exhibit the critical phenomena or phase transition. This means that there is a parameter in the system, whose small change yields a large change in the system behavior. To define the percolation process, consider a graph, that has a large connected component. In the classical settings, percolation was actually studied on infinite graphs, whose vertices constitute the set Zd, and edges connect each vertex with nearest neighbors, but we consider general random graphs. We have parameter ϕ, which is the probability that any edge present in the underlying graph is open or closed (an event with probability 1 − ϕ) independently of the other edges. Actually, if we talk about edges being open or closed, this means that we discuss bond percolation. It is also possible to talk about the vertices being open or closed, and this is called site percolation.
    [Show full text]
  • The Q-Factorial Moments of Discrete Q-Distributions and a Characterization of the Euler Distribution
    3 The q-Factorial Moments of Discrete q-Distributions and a Characterization of the Euler Distribution Ch. A. Charalambides and N. Papadatos Department of Mathematics, University of Athens, Athens, Greece ABSTRACT The classical discrete distributions binomial, geometric and negative binomial are defined on the stochastic model of a sequence of indepen- dent and identical Bernoulli trials. The Poisson distribution may be defined as an approximation of the binomial (or negative binomial) distribution. The cor- responding q-distributions are defined on the more general stochastic model of a sequence of Bernoulli trials with probability of success at any trial depending on the number of trials. In this paper targeting to the problem of calculating the moments of q-distributions, we introduce and study q-factorial moments, the calculation of which is as ease as the calculation of the factorial moments of the classical distributions. The usual factorial moments are connected with the q-factorial moments through the q-Stirling numbers of the first kind. Several ex- amples, illustrating the method, are presented. Further, the Euler distribution is characterized through its q-factorial moments. Keywords and phrases: q-distributions, q-moments, q-Stirling numbers 3.1 INTRODUCTION Consider a sequence of independent Bernoulli trials with probability of success at the ith trial pi, i =1, 2,.... The study of the distribution of the number Xn of successes up to the nth trial, as well as the closely related to it distribution of the number Yk of trials until the occurrence of the kth success, have attracted i−1 i−1 special attention.
    [Show full text]
  • Functions of Random Variables
    Names for Eg(X ) Generating Functions Topic 8 The Expected Value Functions of Random Variables 1 / 19 Names for Eg(X ) Generating Functions Outline Names for Eg(X ) Means Moments Factorial Moments Variance and Standard Deviation Generating Functions 2 / 19 Names for Eg(X ) Generating Functions Means If g(x) = x, then µX = EX is called variously the distributional mean, and the first moment. • Sn, the number of successes in n Bernoulli trials with success parameter p, has mean np. • The mean of a geometric random variable with parameter p is (1 − p)=p . • The mean of an exponential random variable with parameter β is1 /β. • A standard normal random variable has mean0. Exercise. Find the mean of a Pareto random variable. Z 1 Z 1 βαβ Z 1 αββ 1 αβ xf (x) dx = x dx = βαβ x−β dx = x1−β = ; β > 1 x β+1 −∞ α x α 1 − β α β − 1 3 / 19 Names for Eg(X ) Generating Functions Moments In analogy to a similar concept in physics, EX m is called the m-th moment. The second moment in physics is associated to the moment of inertia. • If X is a Bernoulli random variable, then X = X m. Thus, EX m = EX = p. • For a uniform random variable on [0; 1], the m-th moment is R 1 m 0 x dx = 1=(m + 1). • The third moment for Z, a standard normal random, is0. The fourth moment, 1 Z 1 z2 1 z2 1 4 4 3 EZ = p z exp − dz = −p z exp − 2π −∞ 2 2π 2 −∞ 1 Z 1 z2 +p 3z2 exp − dz = 3EZ 2 = 3 2π −∞ 2 3 z2 u(z) = z v(t) = − exp − 2 0 2 0 z2 u (z) = 3z v (t) = z exp − 2 4 / 19 Names for Eg(X ) Generating Functions Factorial Moments If g(x) = (x)k , where( x)k = x(x − 1) ··· (x − k + 1), then E(X )k is called the k-th factorial moment.
    [Show full text]
  • The Concentration of Measure Phenomenon
    http://dx.doi.org/10.1090/surv/089 Selected Titles in This Series 89 Michel Ledoux, The concentration of measure phenomenon, 2001 88 Edward Frenkel and David Ben-Zvi, Vertex algebras and algebraic curves, 2001 87 Bruno Poizat, Stable groups, 2001 86 Stanley N. Burris, Number theoretic density and logical limit laws, 2001 85 V. A. Kozlov, V. G. Maz'ya, and J. Rossmann, Spectral problems associated with corner singularities of solutions to elliptic equations, 2001 84 Laszlo Fuchs and Luigi Salce, Modules over non-Noetherian domains, 2001 83 Sigurdur Helgason, Groups and geometric analysis: Integral geometry, invariant differential operators, and spherical functions, 2000 82 Goro Shimura, Arithmeticity in the theory of automorphic forms, 2000 81 Michael E. Taylor, Tools for PDE: Pseudodifferential operators, paradifferential operators, and layer potentials, 2000 80 Lindsay N. Childs, Taming wild extensions: Hopf algebras and local Galois module theory, 2000 79 Joseph A. Cima and William T. Ross, The backward shift on the Hardy space, 2000 78 Boris A. Kupershmidt, KP or mKP: Noncommutative mathematics of Lagrangian, Hamiltonian, and integrable systems, 2000 77 Fumio Hiai and Denes Petz, The semicircle law, free random variables and entropy, 2000 76 Frederick P. Gardiner and Nikola Lakic, Quasiconformal Teichmuller theory, 2000 75 Greg Hjorth, Classification and orbit equivalence relations, 2000 74 Daniel W. Stroock, An introduction to the analysis of paths on a Riemannian manifold, 2000 73 John Locker, Spectral theory of non-self-adjoint two-point differential operators, 2000 72 Gerald Teschl, Jacobi operators and completely integrable nonlinear lattices, 1999 71 Lajos Pukanszky, Characters of connected Lie groups, 1999 70 Carmen Chicone and Yuri Latushkin, Evolution semigroups in dynamical systems and differential equations, 1999 69 C.
    [Show full text]
  • Some Theory for the Analysis of Random Fields Diplomarbeit
    Philipp Pluch Some Theory for the Analysis of Random Fields With Applications to Geostatistics Diplomarbeit zur Erlangung des akademischen Grades Diplom-Ingenieur Studium der Technischen Mathematik Universit¨at Klagenfurt Fakult¨at fur¨ Wirtschaftswissenschaften und Informatik Begutachter: O.Univ.-Prof.Dr. Jurgen¨ Pilz Institut fur¨ Mathematik September 2004 To my parents, Verena and all my friends Ehrenw¨ortliche Erkl¨arung Ich erkl¨are ehrenw¨ortlich, dass ich die vorliegende Schrift verfasst und die mit ihr unmittelbar verbundenen Arbeiten selbst durchgefuhrt¨ habe. Die in der Schrift verwendete Literatur sowie das Ausmaß der mir im gesamten Arbeitsvorgang gew¨ahrten Unterstutzung¨ sind ausnahmslos angegeben. Die Schrift ist noch keiner anderen Prufungsb¨ eh¨orde vorgelegt worden. St. Urban, 29 September 2004 Preface I remember when I first was at our univeristy - I walked inside this large corridor called ’Aula’ and had no idea what I should do, didn’t know what I should study, I had interest in Psychology or Media Studies, and now I’m sitting in my office at the university, five years later, writing my final lines for my master degree theses in mathematics. A long and also hard but so beautiful way was gone, I remember at the beginning, the first mathematic courses in discrete mathematics, how difficult that was for me, the abstract thinking, my first exams and now I have finished them all, I mastered them. I have to thank so many people and I will do so now. First I have to thank my parents, who always believed in me, who gave me financial support and who had to fight with my mood when I was working hard.
    [Show full text]
  • Completely Random Measures
    Pacific Journal of Mathematics COMPLETELY RANDOM MEASURES JOHN FRANK CHARLES KINGMAN Vol. 21, No. 1 November 1967 PACIFIC JOURNAL OF MATHEMATICS Vol. 21, No. 1, 1967 COMPLETELY RANDOM MEASURES J. F. C. KlNGMAN The theory of stochastic processes is concerned with random functions defined on some parameter set. This paper is con- cerned with the case, which occurs naturally in some practical situations, in which the parameter set is a ^-algebra of subsets of some space, and the random functions are all measures on this space. Among all such random measures are distinguished some which are called completely random, which have the property that the values they take on disjoint subsets are independent. A representation theorem is proved for all completely random measures satisfying a weak finiteness condi- tion, and as a consequence it is shown that all such measures are necessarily purely atomic. 1. Stochastic processes X(t) whose realisation are nondecreasing functions of a real parameter t occur in a number of applications of probability theory. For instance, the number of events of a point process in the interval (0, t), the 'load function' of a queue input [2], the amount of water entering a reservoir in time t, and the local time process in a Markov chain ([8], [7] §14), are all processes of this type. In many applications the function X(t) enters as a convenient way of representing a measure on the real line, the Stieltjes measure Φ defined as the unique Borel measure for which (1) Φ(a, b] = X(b + ) - X(a + ), (-co <α< b< oo).
    [Show full text]
  • Probability on Graphs Random Processes on Graphs and Lattices
    Probability on Graphs Random Processes on Graphs and Lattices GEOFFREY GRIMMETT Statistical Laboratory University of Cambridge c G. R. Grimmett 1/4/10, 17/11/10, 5/7/12 Geoffrey Grimmett Statistical Laboratory Centre for Mathematical Sciences University of Cambridge Wilberforce Road Cambridge CB3 0WB United Kingdom 2000 MSC: (Primary) 60K35, 82B20, (Secondary) 05C80, 82B43, 82C22 With 44 Figures c G. R. Grimmett 1/4/10, 17/11/10, 5/7/12 Contents Preface ix 1 Random walks on graphs 1 1.1 RandomwalksandreversibleMarkovchains 1 1.2 Electrical networks 3 1.3 Flowsandenergy 8 1.4 Recurrenceandresistance 11 1.5 Polya's theorem 14 1.6 Graphtheory 16 1.7 Exercises 18 2 Uniform spanning tree 21 2.1 De®nition 21 2.2 Wilson's algorithm 23 2.3 Weak limits on lattices 28 2.4 Uniform forest 31 2.5 Schramm±LownerevolutionsÈ 32 2.6 Exercises 37 3 Percolation and self-avoiding walk 39 3.1 Percolationandphasetransition 39 3.2 Self-avoiding walks 42 3.3 Coupledpercolation 45 3.4 Orientedpercolation 45 3.5 Exercises 48 4 Association and in¯uence 50 4.1 Holley inequality 50 4.2 FKGinequality 53 4.3 BK inequality 54 4.4 Hoeffdinginequality 56 c G. R. Grimmett 1/4/10, 17/11/10, 5/7/12 vi Contents 4.5 In¯uenceforproductmeasures 58 4.6 Proofsofin¯uencetheorems 63 4.7 Russo'sformulaandsharpthresholds 75 4.8 Exercises 78 5 Further percolation 81 5.1 Subcritical phase 81 5.2 Supercritical phase 86 5.3 Uniquenessofthein®nitecluster 92 5.4 Phase transition 95 5.5 Openpathsinannuli 99 5.6 The critical probability in two dimensions 103 5.7 Cardy's formula 110 5.8 The
    [Show full text]
  • Arxiv:1504.02898V2 [Cond-Mat.Stat-Mech] 7 Jun 2015 Keywords: Percolation, Explosive Percolation, SLE, Ising Model, Earth Topography
    Recent advances in percolation theory and its applications Abbas Ali Saberi aDepartment of Physics, University of Tehran, P.O. Box 14395-547,Tehran, Iran bSchool of Particles and Accelerators, Institute for Research in Fundamental Sciences (IPM) P.O. Box 19395-5531, Tehran, Iran Abstract Percolation is the simplest fundamental model in statistical mechanics that exhibits phase transitions signaled by the emergence of a giant connected component. Despite its very simple rules, percolation theory has successfully been applied to describe a large variety of natural, technological and social systems. Percolation models serve as important universality classes in critical phenomena characterized by a set of critical exponents which correspond to a rich fractal and scaling structure of their geometric features. We will first outline the basic features of the ordinary model. Over the years a variety of percolation models has been introduced some of which with completely different scaling and universal properties from the original model with either continuous or discontinuous transitions depending on the control parameter, di- mensionality and the type of the underlying rules and networks. We will try to take a glimpse at a number of selective variations including Achlioptas process, half-restricted process and spanning cluster-avoiding process as examples of the so-called explosive per- colation. We will also introduce non-self-averaging percolation and discuss correlated percolation and bootstrap percolation with special emphasis on their recent progress. Directed percolation process will be also discussed as a prototype of systems displaying a nonequilibrium phase transition into an absorbing state. In the past decade, after the invention of stochastic L¨ownerevolution (SLE) by Oded Schramm, two-dimensional (2D) percolation has become a central problem in probability theory leading to the two recent Fields medals.
    [Show full text]