The longest edge in discrete and continuous long-range percolation

We consider the random connection model in which an edge between two Poisson points at distance \(r\) is present with probability \(g(r)\). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-06
Hauptverfasser: Rousselle, Arnaud, Sönmez, Ercan
Format: Artikel
Sprache:eng
Schlagworte:
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 Rousselle, Arnaud
Sönmez, Ercan
description We consider the random connection model in which an edge between two Poisson points at distance \(r\) is present with probability \(g(r)\). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability \(g(r)\). We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.
doi_str_mv 10.48550/arxiv.2109.11472
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2109_11472</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2576125215</sourcerecordid><originalsourceid>FETCH-LOGICAL-a952-56d68996a44da4732a19e1162bde8643d821209cf88f9823bcda315c0d98a22a3</originalsourceid><addsrcrecordid>eNotz81KxDAUhuEgCA7jXIArA65bk5OfJksd1BEG3HRfzjTp2KEmNW1F797acXU2D4fvJeSGs1wapdg9pu_2KwfObM65LOCCrEAInhkJcEU2w3BijIEuQCmxIo_lu6ddDEc_jNS7o6dtoK4d6uRHTzE4WscwtmGK07C4LOGMae9THTsc2xiuyWWD3eA3_3dNyuencrvL9m8vr9uHfYZWQaa008ZajVI6lIUA5NZzruHgvNFSOAMcmK0bYxprQBxqh4KrmjlrEADFmtye3y6BVZ_aD0w_1V9otYTO4u4s-hQ_pzmoOsUphXlTBarQHBRwJX4Bh0BVCA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2576125215</pqid></control><display><type>article</type><title>The longest edge in discrete and continuous long-range percolation</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Rousselle, Arnaud ; Sönmez, Ercan</creator><creatorcontrib>Rousselle, Arnaud ; Sönmez, Ercan</creatorcontrib><description>We consider the random connection model in which an edge between two Poisson points at distance \(r\) is present with probability \(g(r)\). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability \(g(r)\). We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2109.11472</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Extreme values ; Mathematics - Probability ; Normalizing ; Percolation</subject><ispartof>arXiv.org, 2024-06</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,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2109.11472$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1007/s10687-024-00488-y$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Rousselle, Arnaud</creatorcontrib><creatorcontrib>Sönmez, Ercan</creatorcontrib><title>The longest edge in discrete and continuous long-range percolation</title><title>arXiv.org</title><description>We consider the random connection model in which an edge between two Poisson points at distance \(r\) is present with probability \(g(r)\). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability \(g(r)\). We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.</description><subject>Extreme values</subject><subject>Mathematics - Probability</subject><subject>Normalizing</subject><subject>Percolation</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotz81KxDAUhuEgCA7jXIArA65bk5OfJksd1BEG3HRfzjTp2KEmNW1F797acXU2D4fvJeSGs1wapdg9pu_2KwfObM65LOCCrEAInhkJcEU2w3BijIEuQCmxIo_lu6ddDEc_jNS7o6dtoK4d6uRHTzE4WscwtmGK07C4LOGMae9THTsc2xiuyWWD3eA3_3dNyuencrvL9m8vr9uHfYZWQaa008ZajVI6lIUA5NZzruHgvNFSOAMcmK0bYxprQBxqh4KrmjlrEADFmtye3y6BVZ_aD0w_1V9otYTO4u4s-hQ_pzmoOsUphXlTBarQHBRwJX4Bh0BVCA</recordid><startdate>20240613</startdate><enddate>20240613</enddate><creator>Rousselle, Arnaud</creator><creator>Sönmez, Ercan</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>20240613</creationdate><title>The longest edge in discrete and continuous long-range percolation</title><author>Rousselle, Arnaud ; Sönmez, Ercan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a952-56d68996a44da4732a19e1162bde8643d821209cf88f9823bcda315c0d98a22a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Extreme values</topic><topic>Mathematics - Probability</topic><topic>Normalizing</topic><topic>Percolation</topic><toplevel>online_resources</toplevel><creatorcontrib>Rousselle, Arnaud</creatorcontrib><creatorcontrib>Sönmez, Ercan</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 (ProQuest)</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>Rousselle, Arnaud</au><au>Sönmez, Ercan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The longest edge in discrete and continuous long-range percolation</atitle><jtitle>arXiv.org</jtitle><date>2024-06-13</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>We consider the random connection model in which an edge between two Poisson points at distance \(r\) is present with probability \(g(r)\). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability \(g(r)\). We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2109.11472</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-06
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2109_11472
source arXiv.org; Free E- Journals
subjects Extreme values
Mathematics - Probability
Normalizing
Percolation
title The longest edge in discrete and continuous long-range percolation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T23%3A02%3A21IST&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=The%20longest%20edge%20in%20discrete%20and%20continuous%20long-range%20percolation&rft.jtitle=arXiv.org&rft.au=Rousselle,%20Arnaud&rft.date=2024-06-13&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2109.11472&rft_dat=%3Cproquest_arxiv%3E2576125215%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=2576125215&rft_id=info:pmid/&rfr_iscdi=true