Archives

  • 2018-07
  • 2018-10
  • 2018-11
  • 2019-04
  • 2019-05
  • 2019-06
  • 2019-07
  • 2019-08
  • 2019-09
  • 2019-10
  • 2019-11
  • 2019-12
  • 2020-01
  • 2020-02
  • 2020-03
  • 2020-04
  • 2020-05
  • 2020-06
  • 2020-07
  • 2020-08
  • 2020-09
  • 2020-10
  • 2020-11
  • 2020-12
  • 2021-01
  • 2021-02
  • 2021-03
  • 2021-04
  • 2021-05
  • 2021-06
  • 2021-07
  • 2021-08
  • 2021-09
  • 2021-10
  • 2021-11
  • 2021-12
  • 2022-01
  • 2022-02
  • 2022-03
  • 2022-04
  • 2022-05
  • 2022-06
  • 2022-07
  • 2022-08
  • 2022-09
  • 2022-10
  • 2022-11
  • 2022-12
  • 2023-01
  • 2023-02
  • 2023-03
  • 2023-04
  • 2023-05
  • 2023-07
  • 2023-08
  • 2023-09
  • 2023-10
  • 2023-11
  • 2023-12
  • 2024-01
  • 2024-02
  • 2024-03
  • MRT67307 HCl Second when considering the Poisson point proce

    2020-11-23

    Second, when considering the Poisson point process, the high-density or large-radius limit of the percolation probability tends to 1 exponentially fast and is governed by the isolation probability. In the random environment, the picture is more subtle since the regime of a large radius is no longer equivalent to that of a high density. Since we rely on a refined large-deviation analysis, we assume that the random environment is not only stabilizing, but in fact -dependent.
    Model definition and main results Loosely speaking, Cox point processes are Poisson point processes in a random environment. More precisely, the random environment is given by a random MRT67307 HCl in the space of Borel measures on equipped with the usual evaluation -algebra. Throughout the manuscript we assume that is stationary, but at this point we do not impose any additional conditions. In particular, could be an absolutely continuous or singular random intensity measure. Nevertheless, in some of the presented results, completely different behavior will appear.
    Then, let be a Cox process in with stationary intensity measure where and . That is, conditioned on , the point process is a Poisson point process with intensity measure , see Fig. 1. To study continuum percolation on , we work with the Gilbert graph on the vertex set where two points are connected by an edge if their distance is less than a connection threshold . The graph percolates if it contains an infinite connected component.
    Examples
    Simulations
    Proof of phase transitions The main idea is to introduce a renormalization scheme reducing the continuum percolation problem to a dependent lattice percolation problem. To make this work, we rely crucially on the stabilization assumption. It allows us to make use of the standard -dependent percolation arguments presented in [19, Theorem 0.0].
    To begin with, we prove the meta results announced in Section 2.3.3.
    Acknowledgments We thank D. Ahlberg and J. Tykesson for the recent and highly valuable Ref. [2]. Moreover, we thank an anonymous referee whose suggestions and comments improved the quality of the manuscript substantially. In particular, one of the remarks lead to a more general notion of asymptotic essential connectedness that is now also applicable to the super-critical Poisson–Boolean model. This research was supported by the Leibniz program Probabilistic Methods for Mobile Ad-Hoc Networks, by The Danish Council for Independent Research, Natural Sciences, grant DFF-7014-00074 Statistics for Point Processes in Space and Beyond, by the Centre for Stochastic Geometry and Advanced Bioimaging, funded by grant 8721 from the Villum Foundation, Denmark and by Orange S.A., France grant CRE G09292. We thank Nila Novita Gafur for her contribution in the simulation section.
    Introduction Feature screening can effectively reduce ultrahigh dimensionality and therefore has attracted considerable attention in the recent literature. Fan and Lv [12] proposed a marginal screening procedure for ultrahigh-dimensional Gaussian linear model, and further showed that marginal screening procedures may possess a sure screening property under certain conditions. Feature screening procedures for varying-coefficient models (VCM) with ultrahigh-dimensional covariates have been proposed in the literature. Liu et al. [21] developed a sure independence screening (SIS) procedure for ultrahigh-dimensional VCM by taking conditional Pearson correlation coefficients as a marginal utility for ranking the importance of predictors. Fan et al. [13] proposed an SIS procedure for ultrahigh-dimensional VCM by extending B-spline techniques in Fan et al. [10] for additive models. Xia et al. [26] further extended the SIS procedure proposed in [13] to generalized varying-coefficient models (GVCM). Cheng et al. [5] proposed a forward variable selection procedure for ultrahigh-dimensional VCM based on techniques related to B-splines regression and grouped variable selection. Song et al. [22] extended the procedure in [13] to longitudinal data without taking into account within-subject correlation, while Chu et al. [6] proposed an SIS procedure for longitudinal data based on a weighted residual sum of squares to use within-subjection correlation to improve accuracy of feature screening. Kong et al. [17] proposed a new screening method that leaves a variable in the active set if it has, jointly with some other variables, a high canonical correlation with the response.