Advanced search
Publication Cover
Stochastic Models Volume 40, 2024 - Issue 2
Submit an article Journal homepage
54
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

The longest edge of the one-dimensional soft random geometric graph with boundaries

Arnaud Roussellea Institut de Mathématiques de Bourgogne, UMR 5584, CNRS, Université de Bourgogne, Dijon, France; Correspondence[email protected]
View further author information
&
Ercan Sönmezb Department of Statistics, University of Klagenfurt, Klagenfurt, AustriaView further author information
Pages 399-416 | Received 06 Mar 2023, Accepted 05 Sep 2023, Published online: 22 Sep 2023

References

  • Amin, M. Energy: The smart-grid solution. Nature 2013, 499, 145–147. 23846644 DOI: 10.1038/499145a.
  • Benjamini, I.; Berger, N. The diameter of long-range percolation clusters on finite cycles. Random Struct. Alg. 2001, 19, 102–111. DOI: 10.1002/rsa.1022.
  • Biskup, M.; Lin, J. Sharp asymptotic for the chemical distance in long-range percolation. Random Struct. Alg. 2019, 55, 560–583. DOI: 10.1002/rsa.20849.
  • Coppersmith, D.; Gamarnik, D.; Sviridenko, M. The diameter of a long-range percolation graph. Random Struct. Alg. 2002, 21, 1–13. DOI: 10.1002/rsa.10042.
  • Devroye, L. 1986, Nonuniform Random Variate Generation; Springer: New York, NY.
  • Devroye, L.; Fraiman, N. The random connection model on the Torus. Combin. Probab. Comp. 2014, 23, 796–804. DOI: 10.1017/S0963548313000631.
  • Donges, J.F.; Zou, Y.; Marwan, N.; Kurths, J. Complex networks in climate dynamics. Eur. Phys. J. Spec. Top. 2009, 174, 157–179. DOI: 10.1140/epjst/e2009-01098-2.
  • Eubank, S.; Guclu, H.; Kumar, V.S.A.; Marathe, M.V.; Srinivasan, A.; Toroczkai, Z.; Wang, N. Modelling disease outbreaks in realistic urban social networks. Nature 2004, 429, 180–184. 15141212 DOI: 10.1038/nature02541.
  • Gilbert, E.N. Random plane networks. J. Soc. Indus. Appl. Math. 1961, 9, 533–543. DOI: 10.1137/0109045.
  • Gupta, P.; Kumar, P.R. The capacity of wireless networks. IEEE Trans. Inform. Theory 2000, 46, 388–404. DOI: 10.1109/18.825799.
  • Last, G.; Nestmann, F.; Schulte, M. The random connection model and functions of edge-marked Poisson processes: Second order properties and normal approximation. Ann. Appl. Probab. 2021, 31, 128–168. DOI: 10.1214/20-AAP1585.
  • Penrose, M.D. Connectivity of soft random geometric graphs. Ann. Appl. Probab. 2016, 26, 986–1028. DOI: 10.1214/15-AAP1110.
  • Penrose, M.D. Inhomogeneous random graphs, isolated vertices, and Poisson approximation. J. Appl. Probab. 2018, 55, 112–136. DOI: 10.1017/jpr.2018.9.
  • Penrose, M.D. Giant component of the soft random geometric graph. Electron. Commun. Probab. 2022, 27, 1–10. arXiv:2204.10219. DOI: 10.1214/22-ECP491.
  • Rousselle, A.; Sönmez, E. The longest edge in discrete and continuous long-range percolation. 2021, preprint, arXiv:2109.11472.
  • Schulman, L.S. Long range percolation in one dimension. J. Phys. A: Math. Gen. 1983, 16, 639. DOI: 10.1088/0305-4470/16/17/001.
  • Sönmez, E. Graph distances of continuum long-range percolation. Brazil. J. Probab. Stat. 2021, 35, 609–624.
  • Tse, D.; Viswanath, P. 2005, Fundamentals of Wireless Communication; Cambrige: Cambridge University Press.
  • Von Brecht, J.; Kolokolnikov, T.; Bertozzi, A.L.; Sun, H. Swarming on random graphs. J. Stat. Phys. 2013, 151, 150–173. DOI: 10.1007/s10955-012-0680-x.
  • Wilsher, M.; Dettmann, C.P.; Ganesh, A. Connectivity in one-dimensional soft random geometric graphs. Phys. Rev. E. 2020, 102, 62312. DOI: 10.1103/PhysRevE.102.062312.
  • Wilsher, M.; Dettmann, C.P.; Ganesh, A. The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph. Stat. Probab. Lett. 2022, 193, 109695. arXiv:2202.08044. DOI: 10.1016/j.spl.2022.109695.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.