Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStructured space-sphere point processes and $K$-functions
51
0
0.0
(
0
)
Added by
Heidi S{\\o}gaard Christensen
Publication date
2018
fields
Mathematical Statistics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This paper concerns space-sphere point processes, that is, point processes on the product space of $mathbb R^d$ (the $d$-dimensional Euclidean space) and $mathbb S^k$ (the $k$-dimen-sional sphere). We consider specific classes of models for space-sphere point processes, which are adaptations of existing models for either spherical or spatial point processes. For model checking or fitting, we present the space-sphere $K$-function which is a natural extension of the inhomogeneous $K$-function for point processes on $mathbb R^d$ to the case of space-sphere point processes. Under the assumption that the intensity and pair correlation function both have a certain separable structure, the space-sphere $K$-function is shown to be proportional to the product of the inhomogeneous spatial and spherical $K$-functions. For the presented space-sphere point process models, we discuss cases where such a separable structure can be obtained. The usefulness of the space-sphere $K$-function is illustrated for real and simulated datasets with varying dimensions $d$ and $k$.
rate research
Read More
We are interested in estimating the location of what we call smooth change-point from $n$ independent observations of an inhomogeneous Poisson process. The smooth change-point is a transition of the intensity function of the process from one level to another which happens smoothly, but over such a small interval, that its length $delta_n$ is considered to be decreasing to $0$ as $nto+infty$. We show that if $delta_n$ goes to zero slower than $1/n$, our model is locally asymptotically normal (with a rather unusual rate $sqrt{delta_n/n}$), and the maximum likelihood and Bayesian estimators are consistent, asymptotically normal and asymptotically efficient. If, on the contrary, $delta_n$ goes to zero faster than $1/n$, our model is non-regular and behaves like a change-point model. More precisely, in this case we show that the Bayesian estimators are consistent, converge at rate $1/n$, have non-Gaussian limit distributions and are asymptotically efficient. All these results are obtained using the likelihood ratio analysis method of Ibragimov and Khasminskii, which equally yields the convergence of polynomial moments of the considered estimators. However, in order to study the maximum likelihood estimator in the case where $delta_n$ goes to zero faster than $1/n$, this method cannot be applied using the usual topologies of convergence in functional spaces. So, this study should go through the use of an alternative topology and will be considered in a future work.
Many popular robust estimators are $U$-quantiles, most notably the Hodges-Lehmann location estimator and the $Q_n$ scale estimator. We prove a functional central limit theorem for the sequential $U$-quantile process without any moment assumptions and under weak short-range dependence conditions. We further devise an estimator for the long-run variance and show its consistency, from which the convergence of the studentized version of the sequential $U$-quantile process to a standard Brownian motion follows. This result can be used to construct CUSUM-type change-point tests based on $U$-quantiles, which do not rely on bootstrapping procedures. We demonstrate this approach in detail at the example of the Hodges-Lehmann estimator for robustly detecting changes in the central location. A simulation study confirms the very good robustness and efficiency properties of the test. Two real-life data sets are analyzed.
The robust detection of statistical dependencies between the components of a complex system is a key step in gaining a network-based understanding of the system. Because of their simplicity and low computation cost, pairwise statistics are commonly used in a variety of fields. Those approaches, however, typically suffer from one or more limitations such as lack of confidence intervals requiring reliance on surrogate data, sensitivity to binning, sparsity of the signals, or short duration of the records. In this paper we develop a method for assessing pairwise dependencies in point processes that overcomes these challenges. Given two point processes $X$ and $Y$ each emitting a given number of events $m$ and $n$ in a fixed period of time $T$, we derive exact analytical expressions for the expected value and standard deviation of the number of pairs events $X_i,Y_j$ separated by a delay of less than $tau$ one should expect to observe if $X$ and $Y$ were i.i.d. uniform random variables. We prove that this statistic is normally distributed in the limit of large $T$, which enables the definition of a Z-score characterising the likelihood of the observed number of coincident events happening by chance. We numerically confirm the analytical results and show that the property of normality is robust in a wide range of experimental conditions. We then experimentally demonstrate the predictive power of the method using a noisy version of the common shock model. Our results show that our approach has excellent behaviour even in scenarios with low event density and/or when the recordings are short.
We provide the strong approximation of empirical copula processes by a Gaussian process. In addition we establish a strong approximation of the smoothed empirical copula processes and a law of iterated logarithm.
We introduce the ARMA (autoregressive-moving-average) point process, which is a Hawkes process driven by a Neyman-Scott process with Poisson immigration. It contains both the Hawkes and Neyman-Scott process as special cases and naturally combines self-exciting and shot-noise cluster mechanisms, useful in a variety of applications. The name ARMA is used because the ARMA point process is an appropriate analogue of the ARMA time series model for integer-valued series. As such, the ARMA point process framework accommodates a flexible family of models sharing methodological and mathematical similarities with ARMA time series. We derive an estimation procedure for ARMA point processes, as well as the integer ARMA models, based on an MCEM (Monte Carlo Expectation Maximization) algorithm. This powerful framework for estimation accommodates trends in immigration, multiple parametric specifications of excitement functions, as well as cases where marks and immigrants are not observed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
