Search

We derive normal approximation bounds in the Wasserstein distance for sums of generalized U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to normal approximation for the combined weights of subgraphs in the Erdős–Rényi random graph, extending the graph counting results of Barbour et al. (A central limit theorem for decomposable random variables with applications to random graphs, J. Combin. Theory Ser. B 47(2) (1989), pp. 125–145) to the setting of weighted graphs. Our approach relies on a general stochastic analytic framework for functionals of independent random sequences. [ABSTRACT FROM AUTHOR]

We derive sufficient conditions for the mixing of all orders of interacting transformations of a spatial Poisson point process, under a zero-type condition in probability and a generalized adaptedness condition. This extends a classical result in the case of deterministic transformations of Poisson measures. The approach relies on moment and covariance identities for Poisson stochastic integrals with random integrands. [ABSTRACT FROM PUBLISHER]