8 results
Search Results
Now showing 1 - 8 of 8
- ItemExponential Moments for Planar Tessellations(New York, NY [u.a.] : Springer Science + Business Media B.V., 2020) Jahnel, Benedikt; Tóbiás, AndrásIn this paper we show existence of all exponential moments for the total edge length in a unit disk for a family of planar tessellations based on stationary point processes. Apart from classical tessellations such as the Poisson–Voronoi, Poisson–Delaunay and Poisson line tessellation, we also treat the Johnson–Mehl tessellation, Manhattan grids, nested versions and Palm versions. As part of our proofs, for some planar tessellations, we also derive existence of exponential moments for the number of cells and the number of edges intersecting the unit disk.
- ItemLower large deviations for geometric functionals([Madralin] : EMIS ELibEMS, 2020) Hirsch, Christian; Jahnel, Benedikt; Tóbiás, AndrásThis work develops a methodology for analyzing large-deviation lower tails associated with geometric functionals computed on a homogeneous Poisson point process. The technique applies to characteristics expressed in terms of stabilizing score functions exhibiting suitable monotonicity properties. We apply our results to clique counts in the random geometric graph, intrinsic volumes of Poisson–Voronoi cells, as well as power-weighted edge lengths in the random geometric, k-nearest neighbor and relative neighborhood graph.
- ItemSINR percolation for Cox point processes with random powers(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Jahnel, Benedikt; Tóbiás, AndrásSignal-to-interference plus noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted signal powers of the devices of the network are assumed random, i.i.d. and possibly unbounded. Additionally, we assume that the devices form a stationary Cox point process, i.e., a Poisson point process with stationary random intensity measure, in two or higher dimensions. We present the following main results. First, under suitable moment conditions on the signal powers and the intensity measure, there is percolation in the SINR graph given that the device density is high and interferences are sufficiently reduced, but not vanishing. Second, if the interference cancellation factor γ and the SINR threshold τ satisfy γ ≥ 1/(2τ), then there is no percolation for any intensity parameter. Third, in the case of a Poisson point process with constant powers, for any intensity parameter that is supercritical for the underlying Gilbert graph, the SINR graph also percolates with some small but positive interference cancellation factor.
- ItemExponential moments for planar tessellations(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Tóbiás, András; Jahnel, BenediktIn this paper we show existence of all exponential moments for the total edge length in a unit disc for a family of planar tessellations based on Poisson point processes. Apart from classical such tessellations like the PoissonVoronoi, PoissonDelaunay and Poisson line tessellation, we also treat the JohnsonMehl tessellation, Manhattan grids, nested versions and Palm versions. As part of our proofs, for some planar tessellations, we also derive existence of exponential moments for the number of cells and the number of edges intersecting the unit disk.
- ItemLower large deviations for geometric functionals(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Hirsch, Christian; Jahnel, Benedikt; Tóbiás, AndrásThis work develops a methodology for analyzing large-deviation lower tails associated with geometric functionals computed on a homogeneous Poisson point process. The technique applies to characteristics expressed in terms of stabilizing score functions exhibiting suitable monotonicity properties. We apply our results to clique counts in the random geometric graph, intrinsic volumes of Poisson--Voronoi cells, as well as power-weighted edge lengths in the random geometric, κ-nearest neighbor and relative neighborhood graph.
- ItemPhase transitions for the Boolean model of continuum percolation for Cox point processes(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Jahnel, Benedikt; Tóbiás, András; Cali, EliWe consider the Boolean model with random radii based on Cox point processes. Under a condition of stabilization for the random environment, we establish existence and non-existence of subcritical regimes for the size of the cluster at the origin in terms of volume, diameter and number of points. Further, we prove uniqueness of the infinite cluster for sufficiently connected environments.
- ItemAbsence of percolation in graphs based on stationary point processes with degrees bounded by two(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Jahnel, Benedikt; Tóbiás, AndrásWe consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for SINR graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollobás that the bidirectional $k$-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for k=2.
- ItemAbsence of percolation in graphs based on stationary point processes with degrees bounded by two(New York, NY [u.a.] : Wiley, 2022) Jahnel, Benedikt; Tóbiás, AndrásWe consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for signal-to-interference ratio graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollobás that the bidirectional k-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for k=2.