Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Statistics and Probability
Reference8 articles.
1. Bal, D., Bennett, P., P-Giménez, X. and Pralat, P. (2017). Rainbow perfect matchings and hamilton cycles in the random geometric graph. Random Structures and Algorithms 51, 587–606.
2. Balogh, J., Bollobás, B., Krivelevich, M., Müller, T. and Walters, M. (2011). Hamiltonian cycles in random geometric graphs. Annals of Applied Probability 21, 3, 1053–1072.
3. Díaz, J., Mitsche, D. and Pérez, X. (2007). Sharp threshold for hamiltonicity of random geometric graphs. SIAM Journal of Discrete Mathematics 21, 57–65.
4. Ganesan, G. (2013). Size of the giant component in a random geometric graph. Annales de l’Institut Henri Poincaré 49, 1130–1140.
5. Ganesan, G. (2021). Duality and Outermost Boundaries in Generalized Percolation Lattices, Algorithms, Computing and Mathematics (ACM) Conference, Chennai, India (2021), pp. 1–20, Available at: http://ceur-ws.org/Vol-3010/.