Search Results

Now showing 1 - 10 of 36
  • Item
    Exponential Moments for Planar Tessellations
    (New York, NY [u.a.] : Springer Science + Business Media B.V., 2020) Jahnel, Benedikt; Tóbiás, András
    In 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.
  • Item
    Sharp phase transition for Cox percolation
    (Seattle, Wash. : Univ. of Washington, Mathematics Dep., 2022) Hirsch, Christian; Jahnel, Benedikt; Muirhead, Stephen
    We prove the sharpness of the percolation phase transition for a class of Cox percolation models, i.e., models of continuum percolation in a random environment. The key requirements are that the environment has a finite range of dependence, satisfies a local boundedness condition and can be constructed from a discrete iid random field, however the FKG inequality need not hold. The proof combines the OSSS inequality with a coarse-graining construction that allows us to compare different notions of influence.
  • Item
    Extremal decomposition for random Gibbs measures: from general metastates to metastates on extremal random Gibbs measures
    ([Madralin] : EMIS ELibEMS, 2018) Cotar, Codina; Jahnel, Benedikt; Külske, Christof
    The concept of metastate measures on the states of a random spin system was introduced to be able to treat the large-volume asymptotics for complex quenched random systems, like spin glasses, which may exhibit chaotic volume dependence in the strong-coupling regime. We consider the general issue of the extremal decomposition for Gibbsian specifications which depend measurably on a parameter that may describe a whole random environment in the infinite volume. Given a random Gibbs measure, as a measurable map from the environment space, we prove measurability of its decomposition measure on pure states at fixed environment, with respect to the environment. As a general corollary we obtain that, for any metastate, there is an associated decomposition metastate, which is supported on the extremes for almost all environments, and which has the same barycenter.
  • Item
    Phase transitions for chase-escape models on Poisson–Gilbert graphs
    ([Madralin] : EMIS ELibEMS, 2020) Hinsen, Alexander; Jahnel, Benedikt; Cali, Elie; Wary, Jean-Philippe
    We present results on phase transitions of local and global survival in a two-species model on Poisson–Gilbert graphs. Initially, there is an infection at the origin that propagates on the graph according to a continuous-time nearest-neighbor interacting particle system. The graph consists of susceptible nodes and nodes of a second type, which we call white knights. The infection can spread on susceptible nodes without restriction. If the infection reaches a white knight, this white knight starts to spread on the set of infected nodes according to the same mechanism, with a potentially different rate, giving rise to a competition of chase and escape. We show well-definedness of the model, isolate regimes of global survival and extinction of the infection and present estimates on local survival. The proofs rest on comparisons to the process on trees, percolation arguments and finite-degree approximations of the underlying random graphs.
  • Item
    Lower large deviations for geometric functionals
    ([Madralin] : EMIS ELibEMS, 2020) Hirsch, Christian; Jahnel, Benedikt; Tóbiás, András
    This 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.
  • Item
    Phase transitions for chase-escape models on Gilbert graphs
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Hinsen, Alexander; Jahnel, Benedikt; Cali, Eli; Wary, Jean-Philippe
    We present results on phase transitions of local and global survival in a two-species model on Gilbert graphs. At initial time there is an infection at the origin that propagates on the Gilbert graph according to a continuous-time nearest-neighbor interacting particle system. The Gilbert graph consists of susceptible nodes and nodes of a second type, which we call white knights. The infection can spread on susceptible nodes without restriction. If the infection reaches a white knight, this white knight starts to spread on the set of infected nodes according to the same mechanism, with a potentially different rate, giving rise to a competition of chase and escape. We show well-definedness of the model, isolate regimes of global survival and extinction of the infection and present estimates on local survival. The proofs rest on comparisons to the process on trees, percolation arguments and finite-degree approximations of the underlying random graphs.
  • Item
    Attractor properties for irreversible and reversible interacting particle systems
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2015) Jahnel, Benedikt; Külske, Christof
    We consider translation-invariant interacting particle systems on the lattice with finite local state space admitting at least one Gibbs measure as a time-stationary measure. The dynamics can be irreversible but should satisfy some mild non-degeneracy conditions. We prove that weak limit points of any trajectory of translation-invariant measures, satisfying a non-nullness condition, are Gibbs states for the same specification as the time-stationary measure. This is done under the additional assumption that zero entropy loss of the limiting measure w.r.t. the time-stationary measure implies that they are Gibbs measures for the same specification.We also give an alternate version of the last condition such that the non-nullness requirement can be dropped. For dynamics admitting a reversible Gibbs measure the alternative condition can be verified, which yields the attractor property for such dynamics. This generalizes convergence results using relative entropy techniques to a large class of dynamics including irreversible and non-ergodic ones. We use this to show synchronization for the rotation dynamics exhibited in citeJaKu12 possibly at low temperature, and possibly non-reversible. We assume the additional regularity properties on the dynamics: 1 There is at least one stationary measure which is a Gibbs measure. 2 Zero loss of relative entropy density under dynamics implies the Gibbs property.
  • Item
    Malware propagation in urban D2D networks
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hinsen, Alexander; Jahnel, Benedikt; Cali, Eli; Wary, Jean-Philippe
    We introduce and analyze models for the propagation of malware in pure D2D networks given via stationary Cox--Gilbert graphs. Here, the devices form a Poisson point process with random intensity measure λ, Λ where Λ is stationary and given, for example, by the edge-length measure of a realization of a Poisson--Voronoi tessellation that represents an urban street system. We assume that, at initial time, a typical device at the center of the network carries a malware and starts to infect neighboring devices after random waiting times. Here we focus on Markovian models, where the waiting times are exponential random variables, and non-Markovian models, where the waiting times feature strictly positive minimal and finite maximal waiting times. We present numerical results for the speed of propagation depending on the system parameters. In a second step, we introduce and analyze a counter measure for the malware propagation given by special devices called white knights, which have the ability, once attacked, to eliminate the malware from infected devices and turn them into white knights. Based on simulations, we isolate parameter regimes in which the malware survives or is eliminated, both in the Markovian and non-Markovian setting.
  • Item
    Agent-based simulations for coverage extensions in 5G networks and beyond
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Ghribi, Chaima; Cali, Eli; Hirsch, Christian; Jahnel, Benedikt
    Device-to-device (D2D) communications is one of the key emerging technologies for the fifth generation (5G) networks and beyond. It enables direct communication between mobile users and thereby extends coverage for devices lacking direct access to the cellular infrastructure and hence enhances network capacity. D2D networks are complex, highly dynamic and will be strongly augmented by intelligence for decision making at both the edge and core of the network, which makes them particularly difficult to predict and analyze. Conventionally, D2D systems are evaluated, investigated and analyzed using analytical and probabilistic models (e.g., from stochastic geometry). However, applying classical simulation and analytical tools to such a complex system is often hard to track and inaccurate. In this paper, we present a modeling and simulation framework from the perspective of complex-systems science and exhibit an agent-based model for the simulation of D2D coverage extensions. We also present a theoretical study to benchmark our proposed approach for a basic scenario that is less complicated to model mathematically. Our simulation results show that we are indeed able to predict coverage extensions for multi-hop scenarios and quantify the effects of street-system characteristics and pedestrian mobility on the connection time of devices to the base station (BS). To our knowledge, this is the first study that applies agent-based simulations for coverage extensions in D2D.
  • Item
    Agent-based modeling and simulation for malware spreading in D2D networks
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Benomar, Ziyad; Ghribi, Chaima; Cali, Eli; Hinsen, Alexander; Jahnel, Benedikt
    This paper presents a new multi-agent model for simulating malware propagation in device-to-device (D2D) 5G networks. This model allows to understand and analyze mobile malware-spreading dynamics in such highly dynamical networks. Additionally, we present a theoretical study to validate and benchmark our proposed approach for some basic scenarios that are less complicated to model mathematically and also to highlight the key parameters of the model. Our simulations identify critical thresholds for em no propagation and for em maximum malware propagation and make predictions on the malware-spread velocity as well as device-infection rates. To the best of our knowledge, this paper is the first study applying agent-based simulations for malware propagation in D2D.