Continuum Percolation with Unreliable and Spread-Out Connections

نویسندگان
چکیده

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

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

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

منابع مشابه

Continuum Percolation with Unreliable and Spread-Out Connections

We derive percolation results in the continuum plane that lead to what appears to be a general tendency of many stochastic network models. Namely, when the selection mechanism according to which nodes are connected to each other, is sufficiently spread out, then a lower density of nodes, or on average fewer connections per node, are sufficient to obtain an unbounded connected component. We look...

متن کامل

Spread-out percolation

Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends...

متن کامل

Spread-out percolation in R

Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r →∞, the average degree of the corresponding random graph at the percolation threshold tends ...

متن کامل

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...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2005

ISSN: 0022-4715,1572-9613

DOI: 10.1007/s10955-004-8826-0