Critical path analysis for continuum percolation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A critical exponent for shortest-path scaling in continuum percolation

We carry out Monte Carlo experiments to study the scaling behavior of shortest path lengths in continuum percolation. These studies suggest that the critical exponent governing this scaling is the same for both continuum and lattice percolation. We use splitting, a technique that has not yet been fully exploited in the physics literature, to increase the speed of our simulations. This technique...

متن کامل

Continuum Limits for Critical Percolation and Other Stochastic Geometric Models

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen on the macroscopic scale, in situations where the short–distance scale at which the system’s basic variables are defined is taken to zero. Among the challengi...

متن کامل

New Lower Bound on the Critical Density in Continuum Percolation

Percolation theory has become a useful tool for the analysis of large scale wireless networks. We investigate the fundamental problem of characterizing the critical density λc for Poisson random geometric graphs in continuum percolation theory. In two-dimensional space with the Euclidean norm, simulation studies show λc ≈ 1.44, while the best theoretical bounds obtained thus far are 0.696 < λc ...

متن کامل

Continuum percolation with holes

We analyze a mathematical model of a cognitive radio network introduced in Yemeni et al. (2016). Our analysis reveals several surprising features of the model. We explain some of these features using ideas from percolation theory and stochastic geometry.

متن کامل

Continuum Percolation Thresholds

Awide variety ofmethods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the connected clusters, and (in two dimensions) using exact values from conformal field theory for the probability, at the phase transition, that various kinds of wrappi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l?Institut Henri Poincare (B) Probability and Statistics

سال: 2004

ISSN: 0246-0203

DOI: 10.1016/j.anihpb.2004.05.001