On the clique number of noisy random geometric graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the clique number of noisy random geometric graphs

Published:2023-02-03 Issue:1 Volume:63 Page:242-279
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Algorithms

Author:

Kahle Matthew¹,Tian Minghao²,Wang Yusu³

Affiliation:

1. Department of Mathematics The Ohio State University Columbus Ohio USA

2. Computer Science and Engineering Department The Ohio State University Columbus Ohio USA

3. Halıcıoğlu Data Science Institute University of California San Diego San Diego California USA

Abstract

AbstractLet be a random geometric graph, and then for we construct a ‐perturbed noisy random geometric graph where each existing edge in is removed with probability , while and each non‐existent edge in is inserted with probability . We give asymptotically tight bounds on the clique number for several regimes of parameter.

Funder

National Science Foundation of Sri Lanka

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21134

Reference18 articles.

1. Cliques in random graphs

2. Random Graphs

3. High-Dimensional Random Geometric Graphs and their Clique Number

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP