منابع مشابه
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...
متن کاملGeometric Random Edge
We show that a variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs max{cTx : x ∈ R, Ax 6 b}, whose constraint matrix A satisfies a geometric property introduced by Brunsch and Röglin: The sine of the angle of a row of A to a hyperplane spanned by n− 1 other rows of A is at least δ. This property is a geometric generalization of A ...
متن کامل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...
متن کاملRandom Geometric Complexes
We study the expected topological properties of Čech and Vietoris-Rips complexes built on randomly sampled points in R. These are, in some cases, analogues of known results for connectivity and component counts for random geometric graphs. However, an important difference in this setting is that homology is not monotone in the underlying parameter. In the sparse range, we compute the expectatio...
متن کاملRandom geometric graphs.
We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2012
ISSN: 1042-9832
DOI: 10.1002/rsa.20454