arXiv Analytics

Sign in

arXiv:2408.11615 [math.PR]AbstractReferencesReviewsResources

Asymptotic Shape of Subadditive Processes on Groups and on Random Geometric Graphs

Lucas R. de Lima

Published 2024-08-21Version 1

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates, as well as standard First-Passage Percolation (FPP) models applied to Random Geometric Graphs (RGGs). Employing a diverse range of techniques, including subadditive ergodic theorems and tailored modifications suited for polygonal paths within groups, the thesis examines the asymptotic shape under varying conditions. The investigation extends to subadditive cocycles characterized by at least and at most linear growth. Moreover, the study delves into moderate deviations for FPP models on RGGs, refining previous results with theorems that quantify its speed of convergence to the limiting shape, the fluctuation of the geodesics, and its spanning trees. Additionally, we apply the obtained results in a competition model to verify the positive probability of coexistence of two species competing for territory in a random geometric graph.

Comments: PhD thesis, 146 pages, 13 figures. arXiv admin note: text overlap with arXiv:2312.07811
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:2109.07813 [math.PR] (Published 2021-09-16)
Limiting shape for First-Passage Percolation models on Random Geometric Graphs
arXiv:1107.2280 [math.PR] (Published 2011-07-12, updated 2013-09-18)
Convergence towards an asymptotic shape in first-passage percolation on cone-like subgraphs of the integer lattice
arXiv:1403.1274 [math.PR] (Published 2014-03-05, updated 2014-03-07)
Almost optimal sparsification of random geometric graphs