Probabilistic properties of highly connected random geometric graphs

DOI10.1016/J.DAM.2019.04.007MaRDI QIDQ5919114zbMATH OpenOpenAlexFDO

Authors Bodo Manthey, Victor M. J. J. Reijnders

Publication date 21 October 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/probabilistic-properties-of-highly-connected-random-geometric-graphs(e81ecd48-4f52-40a8-8dd3-35d4bd564200).html

zbMATH Keywords

probabilistic analysisEuclidean optimization problemspower assignments

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)

Recommendations

• Probabilistic properties of highly connected random geometric graphs
• Probabilistic analysis of power assignments
• scientific article; zbMATH DE number 1340281
• Probabilistic analysis of power assignments
• Some properties for the largest component of random geometric graphs with applications in sensor networks

Cites work

• scientific article; zbMATH DE number 176255 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305417 (Why is no real title available?)
• scientific article; zbMATH DE number 3312526 (Why is no real title available?)
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• A matching problem and subadditive Euclidean functionals
• Biconnectivity approximations and graph carvings
• Complete Convergence and the Law of Large Numbers
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Network Analysis
• On the hardness of range assignment problems
• On the method of typical bounded differences
• Probabilistic analysis of power assignments
• Probability theory of classical Euclidean optimization problems
• Smoothed analysis of partitioning algorithms for Euclidean functionals

Cited in

(8)

• Random graphs, geometry and asymptotic structure
• Geometric graphs with randomly deleted edges -- connectivity and routing protocols
• Connectivity of soft random geometric graphs over annuli
• Some properties for the largest component of random geometric graphs with applications in sensor networks
• Probabilistic properties of highly connected random geometric graphs
• Stochastic geometry: Boolean model and random geometric graphs
• Lectures on random geometric graphs
• Gaussian fluctuations for edge counts in high-dimensional random geometric graphs

This page was built for publication: Probabilistic properties of highly connected random geometric graphs

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