scientific article; zbMATH DE number 1340281

DOI10.1002/(SICI)1098-2418(199909)15:2%3C145::AID-RSA2%3E3.0.CO;2-GMaRDI QIDQ4265786zbMATH OpenFDO

Authors Mathew D. Penrose

Publication date 27 February 2000

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199909)15:2%3C145::AID-RSA2%3E3.0.CO;2-G

zbMATH Keywords

\(k\)-connectivitygeometric probabilityrandom graph

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 1222330
• Connectivity of random k-nearest-neighbour graphs
• Connectivity of soft random geometric graphs
• Highly connected random geometric graphs
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).

Cites work

• Cell Growth Problems
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• Some peculiar boundary phenomena for extremes of r-th nearest neighbor links
• The longest edge of the random minimal spanning tree

Cited in

(44)

• Highly connected random geometric graphs
• Maximum scan statistics and channel assignment problems in homogeneous wireless networks
• Continuum percolation of wireless ad hoc communication networks
• Zero-one law for connectivity in superposition of random key graphs on random geometric graphs
• Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• Mobile geometric graphs: detection, coverage and percolation
• The connectivity threshold of random geometric graphs with Cantor distributed vertices
• The acquaintance time of (percolated) random geometric graphs
• Topological properties of random wireless networks
• On the fundamental limits of topology control in ad hoc networks
• On the typical case complexity of graph optimization
• Degree distributions in \(AB\) random geometric graphs
• Connectivity of soft random geometric graphs over annuli
• Connectivity of random high dimensional geometric graphs
• On the easiest way to connect k points in the random interlacements process
• Connectivity of soft random geometric graphs
• On covering by translates of a set
• Disjoint Hamilton cycles in the random geometric graph
• Sharpness in the k-nearest-neighbours random geometric graph model
• On the robustness to multiple agent losses in 2D and 3D formations
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• scientific article; zbMATH DE number 1222330 (Why is no real title available?)
• Full connectivity: corners, edges and faces
• Percolation in Voronoi tilings
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Multiple-SLE _κ connectivity weights for rectangles, hexagons, and octagons
• Plane and planarity thresholds for random geometric graphs
• On the treewidth of random geometric graphs and percolated grids
• Maker-breaker games on random geometric graphs
• Theoretical Aspects of Graph Models for MANETs
• Hamilton cycles in random geometric graphs
• Graph Drawing
• Connectivity for line-of-sight networks in higher dimensions
• Probabilistic properties of highly connected random geometric graphs
• Probabilistic properties of highly connected random geometric graphs
• On the contractibility of random Vietoris-Rips complexes
• Color-avoiding percolation and branching processes
• Fluctuations of the connectivity threshold and largest nearest-neighbour link
• Sublinear average-case shortest paths in weighted unit-disk graphs
• Connectivity properties of the adjacency graph of \(\text{SLE}_{\kappa}\) bubbles for \(\kappa\in(4,8)\)
• Random geometric graph diameter in the unit ball
• A geometric Achlioptas process
• Thresholding random geometric graph properties motivated by ad hoc sensor networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265786)