Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLocal neighbourhoods for first passage percolation on the configuration model
95
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen uniformly at random, a sender and a recipient, and all edges along the geodesic connecting the two vertices are coloured in red (in the case that both vertices are in the same component). In this article we prove local limit theorems for the coloured graph around the recipient in the spirit of Benjamini and Schramm. We consider the explosive regime, in which case the random distances are of finite order, and the Malthusian regime, in which case the random distances are of logarithmic order.
rate research
Read More
We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape theorem, and we express the limiting shape in terms of the limiting shapes for the homogeneous processes for the two weight distributions. We further show that there exist pairs of distributions for which the rate of growth in the vertical direction is strictly larger than the rate of growth of the homogeneous process with either of the two distributions, and that this corresponds to the creation of a defect along the vertical axis in the form of a `pyramid.
We study the time constant $mu(e_{1})$ in first passage percolation on $mathbb Z^{d}$ as a function of the dimension. We prove that if the passage times have finite mean, $$lim_{d to infty} frac{mu(e_{1}) d}{log d} = frac{1}{2a},$$ where $a in [0,infty]$ is a constant that depends only on the behavior of the distribution of the passage times at $0$. For the same class of distributions, we also prove that the limit shape is not an Euclidean ball, nor a $d$-dimensional cube or diamond, provided that $d$ is large enough.
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed random variables on the random infinite connected component. We provide sufficient conditions for the existence of the asymptotic shape and we show that the shape is an Euclidean ball. We give some examples exhibiting the result for Bernoulli percolation and the Richardson model. For the Richardson model we further show that it converges weakly to a nonstandard branching process in the joint limit of large intensities and slow passing times.
We consider first-passage percolation with i.i.d. non-negative weights coming from some continuous distribution under a moment condition. We review recent results in the study of geodesics in first-passage percolation and study their implications for the multi-type Richardson model. In two dimensions this establishes a dual relation between the existence of infinite geodesics and coexistence among competing types. The argument amounts to making precise the heuristic that infinite geodesics can be thought of as `highways to infinity. We explain the limitations of the current techniques by presenting a partial result in dimensions higher than two.
The non-random fluctuation is one of the central objects in first passage percolation. It was proved in [Shuta Nakajima. Divergence of non-random fluctuation in First Passage Percolation. {em Electron. Commun. Probab.} 24 (65), 1-13. 2019.] that for a particular asymptotic direction, it diverges in a lattice first passage percolation with an explicit lower bound. In this paper, we discuss the non-random fluctuation in Euclidean first passage percolations and show that it diverges in dimension $dgeq 2$ in this model also. Compared with the result in cite{N19}, the present result is proved for any direction and improves the lower bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
