On the One Dimensional Poisson Random Geometric Graph
نویسندگان
چکیده
منابع مشابه
Poisson convergence can yield very sharp transitions in geometric random graphs
We investigate how quickly phase transitions can occur in some geometric random graphs where n points are distributed uniformly and independently in the unit cube [0, 1] for some positive integer d. In the case of graph connectivity for the one-dimensional case, we show that the transition width behaves like n (when the number n of users is large), a significant improvement over general asympto...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملOn the Critical Density for Percolation in Random Geometric Graphs
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 d-dimensional 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...
متن کاملConnectivity in One-Dimensional Geometric Random Graphs: Poisson Approximations, Zero- One Laws and Phase Transitions
Consider n points (or nodes) distributed uniformly and independently on the unit interval [0, 1]. Two nodes are said to be adjacent if their distance is less than some given threshold value. For the underlying random graph we derive zero-one laws for the property of graph connectivity and give the asymptotics of the transition widths for the associated phase transition. These results all flow f...
متن کاملThresholds for Random Geometric k-SAT
We study two geometric models of random k-satisfiability which combine random k-SAT with the Random Geometric Graph: boolean literals are placed uniformly at random or according to a Poisson process in a cube, and for each set of k literals contained in a ball of a given radius, a clause is formed. For k = 2 we find the exact location of the satisfiability threshold (as either the radius or int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014