scholarly journals On the relation between graph distance and Euclidean distance in random geometric graphs

2016 ◽  
Vol 48 (3) ◽  
pp. 848-864 ◽  
Author(s):  
J. Díaz ◽  
D. Mitsche ◽  
G. Perarnau ◽  
X. Pérez-Giménez
Keyword(s):  
Lower Bound ◽  
Euclidean Distance ◽  
Geometric Graph ◽  
Upper Bounds ◽  
Geometric Graphs ◽  
Graph Distance ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Connectivity Threshold

Abstract Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) that hold asymptotically almost surely has received quite a bit of attention in the literature. In this paper we improve the known upper bounds for values of r=ω(√logn) (that is, for r above the connectivity threshold). Our result also improves the best known estimates on the diameter of random geometric graphs. We also provide a lower bound on dE(u, v) conditional on dE(u, v).

Infection Spread in Random Geometric Graphs

2015 ◽  
Vol 47 (1) ◽  
pp. 164-181 ◽  
Author(s):  
Ghurumuruhan Ganesan
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Contact Process ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Long Time ◽  
Explicit Lower Bound ◽  
Infection Spread

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, rn, f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D1nrn2. In the second part of the paper we consider the contact process ξt on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c1 and c2 such that, with probability at least 1 - c1 / n4, the contact process starting with all nodes infected survives up to time tn = exp(c2n/logn) for all n.

scholarly journals Plane and planarity thresholds for random geometric graphs

2019 ◽  
Vol 12 (01) ◽  
pp. 2050005
Author(s):  
Ahmad Biniaz ◽  
Evangelos Kranakis ◽  
Anil Maheshwari ◽  
Michiel Smid
Keyword(s):  
Euclidean Distance ◽  
Independent Set ◽  
Geometric Graph ◽  
Threshold Function ◽  
Geometric Graphs ◽  
Connected Subgraph ◽  
Random Geometric Graph ◽  
Distance Threshold ◽  
Random Geometric Graphs ◽  
Straight Line

A random geometric graph, [Formula: see text], is formed by choosing [Formula: see text] points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most [Formula: see text]. For a given constant [Formula: see text], we show that [Formula: see text] is a distance threshold function for [Formula: see text] to have a connected subgraph on [Formula: see text] points. Based on this, we show that [Formula: see text] is a distance threshold for [Formula: see text] to be plane, and [Formula: see text] is a distance threshold to be planar. We also investigate distance thresholds for [Formula: see text] to have a non-crossing edge, a clique of a given size, and an independent set of a given size.

Infection Spread in Random Geometric Graphs

2015 ◽  
Vol 47 (01) ◽  
pp. 164-181 ◽  
Author(s):  
Ghurumuruhan Ganesan
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Contact Process ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Long Time ◽  
Explicit Lower Bound ◽  
Infection Spread

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, r n , f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D 1 nr n 2. In the second part of the paper we consider the contact process ξ t on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c 1 and c 2 such that, with probability at least 1 - c 1 / n 4, the contact process starting with all nodes infected survives up to time t n = exp(c 2 n/logn) for all n.

scholarly journals Clique Colourings of Geometric Graphs

10.37236/7159 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Colin McDiarmid ◽  
Dieter Mitsche ◽  
Pawel Prałat
Keyword(s):  
Asymptotic Behaviour ◽  
Chromatic Number ◽  
Euclidean Distance ◽  
High Probability ◽  
Maximal Clique ◽  
Higher Dimensions ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Vertex Set

A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number.  Given $n$ points $\mathbf{x}_1, \ldots,\mathbf{x}_n$ in the plane, and a threshold $r>0$, the corresponding geometric graph has vertex set $\{v_1,\ldots,v_n\}$, and distinct $v_i$ and $v_j$ are adjacent when the Euclidean distance between $\mathbf{x}_i$ and $\mathbf{x}_j$ is at most $r$. We investigate the clique chromatic number of such graphs.We first show that the clique chromatic number is at most 9 for any geometric graph in the plane, and briefly consider geometric graphs in higher dimensions. Then we study the asymptotic behaviour of the clique chromatic number for the random geometric graph $\mathcal{G}$ in the plane, where $n$ random points are independently and uniformly distributed in a suitable square. We see that as $r$ increases from 0, with high probability the clique chromatic number is 1 for very small $r$, then 2 for small $r$, then at least 3 for larger $r$, and finally drops back to 2.

On the treewidth of random geometric graphs and percolated grids

2017 ◽  
Vol 49 (1) ◽  
pp. 49-60 ◽  
Author(s):  
Anshui Li ◽  
Tobias Müller
Keyword(s):  
Critical Radius ◽  
Geometric Graph ◽  
Giant Component ◽  
Bond Percolation ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs

Abstract In this paper we study the treewidth of the random geometric graph, obtained by dropping n points onto the square [0,√n]2 and connecting pairs of points by an edge if their distance is at most r=r(n). We prove a conjecture of Mitsche and Perarnau (2014) stating that, with probability going to 1 as n→∞, the treewidth of the random geometric graph is 𝜣(r√n) when lim inf r>rc, where rc is the critical radius for the appearance of the giant component. The proof makes use of a comparison to standard bond percolation and with a little bit of extra work we are also able to show that, with probability tending to 1 as k→∞, the treewidth of the graph we obtain by retaining each edge of the k×k grid with probability p is 𝜣(k) if p>½ and 𝜣(√log k) if p<½.

scholarly journals Crossings in Grid Drawings

10.37236/3025 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Vida Dujmović ◽  
Pat Morin ◽  
Adam Sheffer
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Geometric Graph ◽  
Upper Bounds ◽  
Crossing Number ◽  
Geometric Graphs ◽  
Vertex Sets

We prove tight crossing number inequalities for geometric graphs whose vertex sets are taken from a $d$-dimensional grid of volume $N$ and give applications of these inequalities to counting the number of crossing-free geometric graphs that can be drawn on such grids.In particular, we show that any geometric graph with $m\geq 8N$ edges and with vertices on a 3D integer grid of volume $N$, has $\Omega((m^2/N)\log(m/N))$ crossings. In $d$-dimensions, with $d\ge 4$, this bound becomes $\Omega(m^2/N)$. We provide matching upper bounds for all $d$. Finally, for $d\ge 4$ the upper bound implies that the maximum number of crossing-free geometric graphs with vertices on some $d$-dimensional grid of volume $N$ is $N^{\Theta(N)}$. In 3 dimensions it remains open to improve the trivial bounds, namely, the $2^{\Omega(N)}$ lower bound and the $N^{O(N)}$ upper bound.

scholarly journals Cliques in high-dimensional random geometric graphs

2020 ◽  
Vol 5 (1) ◽  
Author(s):  
Konstantin E. Avrachenkov ◽  
Andrei V. Bobu
Keyword(s):  
Data Science ◽  
Real Life ◽  
Geometric Graph ◽  
Dimensional Euclidean Space ◽  
Geometric Graphs ◽  
Data Set ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Real Life Situation ◽  
Average Vertex

AbstractRandom geometric graphs have become now a popular object of research. Defined rather simply, these graphs describe real networks much better than classical Erdős–Rényi graphs due to their ability to produce tightly connected communities. The n vertices of a random geometric graph are points in d-dimensional Euclidean space, and two vertices are adjacent if they are close to each other. Many properties of these graphs have been revealed in the case when d is fixed. However, the case of growing dimension d is practically unexplored. This regime corresponds to a real-life situation when one has a data set of n observations with a significant number of features, a quite common case in data science today. In this paper, we study the clique structure of random geometric graphs when $$n\rightarrow \infty$$ n → ∞ , and $$d \rightarrow \infty$$ d → ∞ , and average vertex degree grows significantly slower than n. We show that under these conditions, random geometric graphs do not contain cliques of size 4 a. s. if only $$d \gg \log ^{1 + \epsilon } n$$ d ≫ log 1 + ϵ n . As for the cliques of size 3, we present new bounds on the expected number of triangles in the case $$\log ^2 n \ll d \ll \log ^3 n$$ log 2 n ≪ d ≪ log 3 n that improve previously known results. In addition, we provide new numerical results showing that the underlying geometry can be detected using the number of triangles even for small n.

scholarly journals The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications

2014 ◽  
Vol 46 (02) ◽  
pp. 307-324 ◽  
Author(s):  
Ge Chen ◽  
Changlong Yao ◽  
Tiande Guo
Keyword(s):  
Limit Theorem ◽  
Open Cluster ◽  
Geometric Graph ◽  
Open Clusters ◽  
Asymptotic Result ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Asymptotic Size ◽  
The Central Limit Theorem

In this paper we estimate the expectation of the size of the largest component in a supercritical random geometric graph; the expectation tends to a polynomial on a rate of exponential decay. We sharpen the expectation's asymptotic result using the central limit theorem. Similar results can be obtained for the size of the biggest open cluster, and for the number of open clusters of percolation on a box, and so on.

scholarly journals Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Y. Tang ◽  
Q. L. Li
Keyword(s):  
Recent Work ◽  
Random Graphs ◽  
Geometric Graph ◽  
Graph Connectivity ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Connectivity Property

We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here strengthen recent work by the Krishnan et al.

scholarly journals Cops and Robbers on Geometric Graphs

2012 ◽  
Vol 21 (6) ◽  
pp. 816-834 ◽  
Author(s):  
ANDREW BEVERIDGE ◽  
ANDRZEJ DUDEK ◽  
ALAN FRIEZE ◽  
TOBIAS MÜLLER
Keyword(s):  
Lower Bound ◽  
Absolute Constant ◽  
High Probability ◽  
Probability Space ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graphs ◽  
Cops And Robbers ◽  
Minimum Number ◽  
Vertex Set

Cops and robbers is a turn-based pursuit game played on a graph G. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number c(G) denotes the minimum number of cops required to catch the robber in finite time. We study the cop number of geometric graphs. For points x1, . . ., xn ∈ ℝ2, and r ∈ ℝ+, the vertex set of the geometric graph G(x1, . . ., xn; r) is the graph on these n points, with xi, xj adjacent when ∥xi − xj∥ ≤ r. We prove that c(G) ≤ 9 for any connected geometric graph G in ℝ2 and we give an example of a connected geometric graph with c(G) = 3. We improve on our upper bound for random geometric graphs that are sufficiently dense. Let (n,r) denote the probability space of geometric graphs with n vertices chosen uniformly and independently from [0,1]2. For G ∈ (n,r), we show that with high probability (w.h.p.), if r ≥ K1 (log n/n)1/4 then c(G) ≤ 2, and if r ≥ K2(log n/n)1/5 then c(G) = 1, where K1, K2 > 0 are absolute constants. Finally, we provide a lower bound near the connectivity regime of (n,r): if r ≤ K3 log n/ then c(G) > 1 w.h.p., where K3 > 0 is an absolute constant.

Sign in / Sign up

Export Citation Format

Share Document