scientific article; zbMATH DE number 1340281

DOI10.1002/(SICI)1098-2418(199909)15:2%3C145::AID-RSA2%3E3.0.CO;2-GzbMATH Open0932.05083MaRDI QIDQ4265786FDOQ4265786

Mathew D. Penrose

Publication date: 27 February 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

random graphgeometric probability\(k\)-connectivity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The longest edge of the random minimal spanning tree
• Cell Growth Problems
• Some peculiar boundary phenomena for extremes of r-th nearest neighbor links

Cited In (33)

• Topological properties of random wireless 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 acquaintance time of (percolated) random geometric graphs
• Connectivity of soft random geometric graphs over annuli
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• Connectivity of soft random geometric graphs
• Theoretical Aspects of Graph Models for MANETs
• Mobile geometric graphs: detection, coverage and percolation
• Thresholding random geometric graph properties motivated by ad hoc sensor networks
• Percolation in Voronoi tilings
• Full connectivity: corners, edges and faces
• Multiple-SLE _κ connectivity weights for rectangles, hexagons, and octagons
• Disjoint Hamilton cycles in the random geometric graph
• On the fundamental limits of topology control in ad hoc networks
• On the contractibility of random Vietoris-Rips complexes
• Hamilton cycles in random geometric graphs
• Color-avoiding percolation and branching processes
• On the easiest way to connect \(k\) points in the random interlacements process
• Maximum scan statistics and channel assignment problems in homogeneous wireless networks
• Continuum percolation of wireless ad hoc communication networks
• On covering by translates of a set
• A geometric Achlioptas process
• Degree distributions in \(AB\) random geometric graphs
• Maker‐breaker games on random geometric graphs
• On the treewidth of random geometric graphs and percolated grids
• Connectivity properties of the adjacency graph of \(\text{SLE}_{\kappa}\) bubbles for \(\kappa\in(4,8)\)
• On the typical case complexity of graph optimization
• Plane and planarity thresholds for random geometric graphs
• On the robustness to multiple agent losses in 2D and 3D formations
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model

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)