Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs

@article{Ganesan2021BridgedHC,
  title={Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs},
  author={Ghurumuruhan Ganesan},
  journal={Sankhya A},
  year={2021}
}
In this paper, we consider a random geometric graph (RGG) G on n nodes with adjacency distance rn just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by definition do not belong to G and we are interested in estimating the number of bridges and the maximum bridge length, needed for constructing a Hamiltonian cycle. In our main result, we show that with high probability, i.e. with probability converging to one as n → ∞, we… 

References

SHOWING 1-10 OF 10 REFERENCES

Disjoint Hamilton cycles in the random geometric graph

The first edge in the process that creates a k‐connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge‐disjoint Hamilton cycles (for even k), or (k−1)/2 Hamilton cycles plus one perfect matching (for odd k), which proves and extends a conjecture of Krivelevich and M ler.

Rainbow perfect matchings and Hamilton cycles in the random geometric graph

It is shown that if the authors randomly colour the edges of a random geometric graph with sufficiently many colours, then a.a.s. the graph contains a rainbow perfect matching (rainbow Hamilton cycle) if and only if the minimum degree is at least $1$ (respectively, at least €2$).

Sharp threshold for hamiltonicity of random geometric graphs

The proof is constructive and yields a linear time algorithm for finding a Hamiltonian cycle of $\mathcal{G}(n,r)$ asymptotically almost surely, provided r=r(n)ge\sqrt{\frac{\log n}{(\alpha_p -\epsilon)n}}$ for some fixed $\ep silon>0$.

The longest edge of the random minimal spanning tree

For n points placed uniformly at random on the unit square, suppose Mn (respectively,Mn) denotes the longest edge-length of the nearest neighbor graph (respectively, the minimal spanning tree) on

Duality in percolation via outermost boundaries II: Star connected components and left right crossings

Tile \(\mathbb{R}^2\) into disjoint unit squares \(\{S_k\}_{k \geq 0}\) with the origin being the centre of \(S_0\) and say that \(S_i\) and \(S_j\) are star adjacent if they share a corner and plus

Random Geometric Graphs

This chapter discusses probabilistic ingredients, the largest component for a binomial process, and connectedivity and the number of components in a graph-like model.

The Probabilistic Method

A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.

Size of the giant component in a random geometric graph

In this paper, we study the size of the giant component CG in the random geometric graph G = G(n, rn, f) of n nodes independently distributed each according to a certain density f(.) in [0, 1]2

The Longest Edge of the RandomMinimal Spanning Tree

  • Annals of Applied Probability,
  • 1997

Hamiltonian Cycles in Random Geometric Graphs

  • Annals of Applied Probability,
  • 2011