Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
Large deviations of the giant in supercritical kernel-based spatial random graphs
We study cluster sizes in supercritical $ d $-dimensional inhomogeneous percolation
models with long-range edges--such as long-range percolation--and/or heavy-tailed degree …
models with long-range edges--such as long-range percolation--and/or heavy-tailed degree …
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
One-dependent first passage percolation is a spreading process on a graph where the
transmission time through each edge depends on the direct surroundings of the edge. In …
transmission time through each edge depends on the direct surroundings of the edge. In …
Cluster-size decay in supercritical kernel-based spatial random graphs
We consider a large class of spatially-embedded random graphs that includes among others
long-range percolation, continuum scale-free percolation and the age-dependent random …
long-range percolation, continuum scale-free percolation and the age-dependent random …
Inhomogeneous long-range percolation in the weak decay regime
C Mönch - Probability Theory and Related Fields, 2024 - Springer
We study a general class of percolation models in Euclidean space including long-range
percolation, scale-free percolation, the weight-dependent random connection model and …
percolation, scale-free percolation, the weight-dependent random connection model 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 …
The triangle condition for the marked random connection model
M Dickson, M Heydenreich - arxiv preprint arxiv:2210.07727, 2022 - arxiv.org
We investigate a spatial random graph model whose vertices are given as a marked
Poisson process on $\mathbb {R}^ d $. Edges are inserted between any pair of points …
Poisson process on $\mathbb {R}^ d $. Edges are inserted between any pair of points …
Percolation in weight-dependent random connection models
L Lüchtrath - 2022 - kups.ub.uni-koeln.de
We study a general class of inhomogeneous spatial random graphs, the weight-dependent
random connection model. Vertices are given through a standard Poisson point process in …
random connection model. Vertices are given through a standard Poisson point process in …
Cluster sizes in subcritical soft Boolean models
We consider the soft Boolean model, a model that interpolates between the Boolean model
and long-range percolation, where vertices are given via a stationary Poisson point process …
and long-range percolation, where vertices are given via a stationary Poisson point process …
Subcritical annulus crossing in spatial random graphs
We consider general continuum percolation models obeying sparseness, translation
invariance, and spatial decorrelation. In particular, this includes models constructed on …
invariance, and spatial decorrelation. In particular, this includes models constructed on …