On the distances within cliques in a soft random geometric graph

On the distances within cliques in a soft random geometric graph

We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two poin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-02
Hauptverfasser: Sönmez, Ercan, Stegehuis, Clara
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Graph theory
Mathematics - Probability
Toruses
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Sönmez, Ercan
Stegehuis, Clara
description We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two points within a clique of size \(k\). Moreover, we show that asymptotically in all cliques with large distances, there is only one remote point and all other points are nearby. Furthermore, we prove that a re-scaled version of the maximal \(k\)-clique distance converges in distribution to a Fréchet distribution. Thereby, we describe the order of magnitude according to which the largest distance between two points in a clique decreases with the clique size.
doi_str_mv 10.48550/arxiv.2308.07168
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2308_07168</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2850925325</sourcerecordid><originalsourceid>FETCH-LOGICAL-a958-33b046175eba27982363f06fd5cdd21c9141133507a7bfe52ee6211d47a315ec3</originalsourceid><addsrcrecordid>eNotj0trwzAQhEWh0JDmB_RUQc92pV3r4VtL6AsCueRuZFmOFWI7lZQ-_n2dpDCwMzAs8xFyx1leaCHYowk__isHZDpnikt9RWaAyDNdANyQRYw7xhhIBULgjDytB5o6Rxsfkxmsi_Tbp84P1O7953GKkzU0jm2iwQzN2NOtG3uXgrd0G8yhuyXXrdlHt_i_c7J5fdks37PV-u1j-bzKTCl0hlizQnIlXG1AlRpQYstk2wjbNMBtyQvOEQVTRtWtE-CcBM6bQhnkwlmck_vL2zNedQi-N-G3OmFWZ8yp8XBpHMJ4Wp6q3XgMw7SpAi1YCQIn_QFyblPd</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2850925325</pqid></control><display><type>article</type><title>On the distances within cliques in a soft random geometric graph</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Sönmez, Ercan ; Stegehuis, Clara</creator><creatorcontrib>Sönmez, Ercan ; Stegehuis, Clara</creatorcontrib><description>We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two points within a clique of size \(k\). Moreover, we show that asymptotically in all cliques with large distances, there is only one remote point and all other points are nearby. Furthermore, we prove that a re-scaled version of the maximal \(k\)-clique distance converges in distribution to a Fréchet distribution. Thereby, we describe the order of magnitude according to which the largest distance between two points in a clique decreases with the clique size.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2308.07168</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Apexes ; Graph theory ; Mathematics - Probability ; Toruses</subject><ispartof>arXiv.org, 2024-02</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1007/s10955-024-03254-3$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2308.07168$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sönmez, Ercan</creatorcontrib><creatorcontrib>Stegehuis, Clara</creatorcontrib><title>On the distances within cliques in a soft random geometric graph</title><title>arXiv.org</title><description>We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two points within a clique of size \(k\). Moreover, we show that asymptotically in all cliques with large distances, there is only one remote point and all other points are nearby. Furthermore, we prove that a re-scaled version of the maximal \(k\)-clique distance converges in distribution to a Fréchet distribution. Thereby, we describe the order of magnitude according to which the largest distance between two points in a clique decreases with the clique size.</description><subject>Apexes</subject><subject>Graph theory</subject><subject>Mathematics - Probability</subject><subject>Toruses</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0trwzAQhEWh0JDmB_RUQc92pV3r4VtL6AsCueRuZFmOFWI7lZQ-_n2dpDCwMzAs8xFyx1leaCHYowk__isHZDpnikt9RWaAyDNdANyQRYw7xhhIBULgjDytB5o6Rxsfkxmsi_Tbp84P1O7953GKkzU0jm2iwQzN2NOtG3uXgrd0G8yhuyXXrdlHt_i_c7J5fdks37PV-u1j-bzKTCl0hlizQnIlXG1AlRpQYstk2wjbNMBtyQvOEQVTRtWtE-CcBM6bQhnkwlmck_vL2zNedQi-N-G3OmFWZ8yp8XBpHMJ4Wp6q3XgMw7SpAi1YCQIn_QFyblPd</recordid><startdate>20240226</startdate><enddate>20240226</enddate><creator>Sönmez, Ercan</creator><creator>Stegehuis, Clara</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240226</creationdate><title>On the distances within cliques in a soft random geometric graph</title><author>Sönmez, Ercan ; Stegehuis, Clara</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a958-33b046175eba27982363f06fd5cdd21c9141133507a7bfe52ee6211d47a315ec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Apexes</topic><topic>Graph theory</topic><topic>Mathematics - Probability</topic><topic>Toruses</topic><toplevel>online_resources</toplevel><creatorcontrib>Sönmez, Ercan</creatorcontrib><creatorcontrib>Stegehuis, Clara</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sönmez, Ercan</au><au>Stegehuis, Clara</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the distances within cliques in a soft random geometric graph</atitle><jtitle>arXiv.org</jtitle><date>2024-02-26</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two points within a clique of size \(k\). Moreover, we show that asymptotically in all cliques with large distances, there is only one remote point and all other points are nearby. Furthermore, we prove that a re-scaled version of the maximal \(k\)-clique distance converges in distribution to a Fréchet distribution. Thereby, we describe the order of magnitude according to which the largest distance between two points in a clique decreases with the clique size.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2308.07168</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-02
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2308_07168
source arXiv.org; Free E- Journals
subjects Apexes
Graph theory
Mathematics - Probability
Toruses
title On the distances within cliques in a soft random geometric graph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T15%3A27%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20distances%20within%20cliques%20in%20a%20soft%20random%20geometric%20graph&rft.jtitle=arXiv.org&rft.au=S%C3%B6nmez,%20Ercan&rft.date=2024-02-26&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2308.07168&rft_dat=%3Cproquest_arxiv%3E2850925325%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2850925325&rft_id=info:pmid/&rfr_iscdi=true