منابع مشابه
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...
متن کامل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...
متن کاملInfinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملDynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.001