Probabilistic properties of highly connected random geometric graphs
نویسندگان
چکیده
منابع مشابه
Highly connected random geometric graphs
Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometric graph Gn,k by joining each point of P to its k nearest neighbours. For many applications it is desirable that Gn,k is highly connected, that is, it remains connected even after the removal of a small number of its vertices. In this paper we relate the study of the s-connectivity of Gn,k to our ...
متن کاملRandom Lifts of Graphs are Highly Connected
In this note we study asymptotic properties of random lifts of graphs introduced by Amit and Linial as a new model of random graphs. Given a base graph G and an integer n, a random lift of G is obtained by replacing each vertex of G by a set of n vertices, and joining these sets by random matchings whenever the corresponding vertices of G are adjacent. In this paper we study connectivity proper...
متن کاملMonotone properties of random geometric graphs have sharp thresholds
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1]d, and connecting two points if their Euclidean distance is at most r, for some prescribed r. We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of n points distributed uniformly in [0, 1]d. We pres...
متن کاملMonotone Properties of Random Geometric Graphs Have Sharp Thresholds By
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0,1]d , and connecting two points if their Euclidean distance is at most r , for some prescribed r . We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of n points distributed uniformly in [0,1]d . We pr...
متن کاملBridges in Highly Connected Graphs
Let P = {P1, . . . , Pl} be a set of internally disjoint paths contained in a graph G and let S be the subgraph defined by ⋃t i=1 Pi. A P-bridge is either an edge of G − E(S) with both endpoints in V (S) or a component C of G − V (S) along with all the edges from V (C) to V (S). The attachments of a bridge B are the vertices of V (B) ∩ V (S). A bridge B is k-stable if there does not exist a sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.04.007