Recurrence versus transience for weight-dependent random connection models
We investigate random graphs on the points of a Poisson process in d-dimensional space,
which combine scale-free degree distributions and long-range effects. Every Poisson point …
which combine scale-free degree distributions and long-range effects. Every Poisson point …
The age-dependent random connection model
We investigate a class of growing graphs embedded into the d-dimensional torus where
new vertices arrive according to a Poisson process in time, are randomly placed in space …
new vertices arrive according to a Poisson process in time, are randomly placed in space …
Chemical distance in geometric random graphs with long edges and scale-free degree distribution
We study geometric random graphs defined on the points of a Poisson process in d-
dimensional space, which additionally carry independent random marks. Edges are …
dimensional space, which additionally carry independent random marks. Edges are …
Graph distances in scale-free percolation: the logarithmic case
N Hao, M Heydenreich - Journal of Applied Probability, 2023 - cambridge.org
Scale-free percolation is a stochastic model for complex networks. In this spatial random
graph model, vertices are linked by an edge with probability depending on independent and …
graph model, vertices are linked by an edge with probability depending on independent and …
Recurrence and transience of symmetric random walks with long-range jumps
J Bäumler - Electronic Journal of Probability, 2023 - projecteuclid.org
Abstract Let X 1, X 2,… be iid random variables with values in Z d satisfying PX 1= x= PX
1=− x= Θ‖ x‖− s for some s> d. We show that the random walk defined by S n=∑ k= 1 n X …
1=− x= Θ‖ x‖− s for some s> d. We show that the random walk defined by S n=∑ k= 1 n X …
[Retracted] Research on the Flow Space Planning Model of a Classical Garden Based on an Ant Colony Optimization Algorithm
YL Tang, Z Madina - Journal of Mathematics, 2022 - Wiley Online Library
The traditional spatial planning model has a large error and poor spatial planning effect,
which cannot adapt to the construction of classical gardens. The flow spatial planning model …
which cannot adapt to the construction of classical gardens. The flow spatial planning model …
Weighted distances in scale‐free preferential attachment models
J Jorritsma, J Komjáthy - Random Structures & Algorithms, 2020 - Wiley Online Library
We study three preferential attachment models where the parameters are such that the
asymptotic degree distribution has infinite variance. Every edge is equipped with a …
asymptotic degree distribution has infinite variance. Every edge is equipped with a …
Distance evolutions in growing preferential attachment graphs
J Jorritsma, J Komjáthy - The Annals of Applied Probability, 2022 - projecteuclid.org
We study the evolution of the graph distance and weighted distance between two fixed
vertices in dynamically growing random graph models. More precisely, we consider …
vertices in dynamically growing random graph models. More precisely, we consider …
[PDF][PDF] Tangent graphs
P Mörters - Pure and Applied Functional Analysis, 2023 - mi.uni-koeln.de
The purpose of this note is to demonstrate an analogy of the concepts of weak local limits in
the theory of random graphs and of tangent measures in geometric measure theory. We …
the theory of random graphs and of tangent measures in geometric measure theory. We …
Behavior of long-range percolation at critical phases
J Bäumler - 2023 - mediatum.ub.tum.de
In this thesis, we study long-range percolation at critical phases. We consider the graph
distances for the long-range percolation graph with critical decay parameter and we provide …
distances for the long-range percolation graph with critical decay parameter and we provide …