Local cliques in ER-perturbed random geometric graphs

by   Matthew Kahle, et al.

Random graphs are mathematical models that have applications in a wide range of domains. We study the following model where one adds Erdős--Rényi (ER) type perturbation to a random geometric graph. More precisely, assume G_X^* is a random geometric graph sampled from a nice measure on a metric space X = (X,d). The input observed graph G(p,q) is generated by removing each existing edge from G_X^* with probability p, while inserting each non-existent edge to G_X^* with probability q. We refer to such random p-deletion and q-insertion as ER-perturbation. Although these graphs are related to the objects in the continuum percolation theory, our understanding of them is still rather limited. In this paper we consider a localized version of the classical notion of clique number for the aforementioned ER-perturbed random geometric graphs: Specifically, we study the edge clique number for each edge in a graph, defined as the size of the largest clique(s) in the graph containing that edge. The clique number of the graph is simply the largest edge clique number. Interestingly, given a ER-perturbed random geometric graph, we show that the edge clique number presents two fundamentally different types of behaviors, depending on which "type" of randomness it is generated from. As an application of the above results, we show that by using a filtering process based on the edge clique number, we can recover the shortest-path metric of the random geometric graph G_X^* within a multiplicative factor of 3, from an ER-perturbed observed graph G(p,q), for a significantly wider range of insertion probability q than in previous work.


page 1

page 2

page 3

page 4


The jump of the clique chromatic number of random graphs

The clique chromatic number of a graph is the smallest number of colors ...

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs

A recent trend in the context of graph theory is to bring theoretical an...

On Clique Roots of Flat Graphs

A complete subgraph of a given graph is called a clique. A clique Polyno...

Strong Collapse of Random Simplicial Complexes

The strong collapse of a simplicial complex, proposed by Barmak and Mini...

Volume Doubling Condition and a Local Poincaré Inequality on Unweighted Random Geometric Graphs

The aim of this paper is to establish two fundamental measure-metric pro...

Constructing transient amplifiers for death-Birth updating: A case study of cubic and quartic regular graphs

A central question of evolutionary dynamics on graphs is whether or not ...

Random clique covers for graphs with local density and global sparsity

Large real-world graphs tend to be sparse, but they often contain densel...

Please sign up or login with your details

Forgot password? Click here to reset