On the clique number of noisy random geometric graphs

DOI10.1002/rsa.21134zbMath1522.05431arXiv2208.10558MaRDI QIDQ6074724

Yusu Wang, Matthew Kahle, Minghao Tian

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10558

zbMATH Keywords

random graphsrandom perturbationclique number\(\left(q,p\right)\)-perturbed noisy random geometric graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• High-dimensional random geometric graphs and their clique number
• On the chromatic number of random geometric graphs
• Markov chain methods for analyzing urban networks
• Two-point concentration in random geometric graphs
• Cliques in random graphs
• Random Geometric Graphs
• A Quest to Unravel the Metric Structure Behind Perturbed Networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: On the clique number of noisy random geometric graphs