https://hal.inria.fr/hal-02397338Avrachenkov, KonstantinKonstantinAvrachenkovNEO - Network Engineering and Operations - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueBobu, AndreiAndreiBobuNEO - Network Engineering and Operations - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueCliques in high-dimensional random geometric graphsHAL CCSD2019High dimensionRandom geometric graphsClique numberTriangles[MATH.MATH-PR] Mathematics [math]/Probability [math.PR][INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI]Avrachenkov, Konstantin2019-12-06 14:56:182023-03-15 08:58:092019-12-06 15:11:28enConference papershttps://hal.inria.fr/hal-02397338/document10.1007/978-3-030-36687-2_49application/pdf1Random geometric graphs are good examples of random graphs with a tendency to demonstrate community structure. Vertices of such a graph are represented by points in Euclid space $R^d$ , and edge appearance depends on the distance between the points. Random geometric graphs were extensively explored and many of their basic properties are revealed. However, in the case of growing dimension $d → ∞$ practically nothing is known; this regime corresponds to the case of data with many features, a case commonly appearing in practice. In this paper, we focus on the cliques of these graphs in the situation when average vertex degree grows significantly slower than the number of vertices n with $n → ∞$ and $d → ∞$. We show that under these conditions random geometric graphs do not contain cliques of size 4 a.s. As for the size 3, we will present new bounds on the expected number of triangles in the case $log^2(n) << d << log^3(n)$ that improve previously known results.