scholarly journals Modelling Burglary in Chicago using a self-exciting point process with isotropic triggering

2021 ◽  
pp. 1-23
Author(s):  
CRAIG GILMOUR ◽  
DESMOND J. HIGHAM
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Distance Measure ◽  
Predictive Accuracy ◽  
Synthetic Data ◽  
Public Domain ◽  
Spatial Distance ◽  
Parametric Form ◽  
Space And Time ◽  
Non Parametric

Self-exciting point processes have been proposed as models for the location of criminal events in space and time. Here we consider the case where the triggering function is isotropic and takes a non-parametric form that is determined from data. We pay special attention to normalisation issues and to the choice of spatial distance measure, thereby extending the current methodology. After validating these ideas on synthetic data, we perform inference and prediction tests on public domain burglary data from Chicago. We show that the algorithmic advances that we propose lead to improved predictive accuracy.

scholarly journals A generalization of Matérn hard-core processes with applications to max-stable processes

2020 ◽  
Vol 57 (4) ◽  
pp. 1298-1312
Author(s):  
Martin Dirrler ◽  
Christopher Dörr ◽  
Martin Schlather
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Hard Core ◽  
Domain Of Attraction ◽  
Stable Processes ◽  
Poisson Point Processes ◽  
Original Process ◽  
Mixed Moving Maxima

AbstractMatérn hard-core processes are classical examples for point processes obtained by dependent thinning of (marked) Poisson point processes. We present a generalization of the Matérn models which encompasses recent extensions of the original Matérn hard-core processes. It generalizes the underlying point process, the thinning rule, and the marks attached to the original process. Based on our model, we introduce processes with a clear interpretation in the context of max-stable processes. In particular, we prove that one of these processes lies in the max-domain of attraction of a mixed moving maxima process.

scholarly journals Couplings for determinantal point processes and their reduced Palm distributions with a view to quantifying repulsiveness

2021 ◽  
Vol 58 (2) ◽  
pp. 469-483
Author(s):  
Jesper Møller ◽  
Eliza O’Reilly
Keyword(s):  
Finite Number ◽  
Point Process ◽  
Point Processes ◽  
Parametric Models ◽  
Determinantal Point Processes ◽  
Determinantal Point Process ◽  
The Difference ◽  
Weaker Conditions ◽  
Palm Distributions

AbstractFor a determinantal point process (DPP) X with a kernel K whose spectrum is strictly less than one, André Goldman has established a coupling to its reduced Palm process $X^u$ at a point u with $K(u,u)>0$ so that, almost surely, $X^u$ is obtained by removing a finite number of points from X. We sharpen this result, assuming weaker conditions and establishing that $X^u$ can be obtained by removing at most one point from X, where we specify the distribution of the difference $\xi_u: = X\setminus X^u$. This is used to discuss the degree of repulsiveness in DPPs in terms of $\xi_u$, including Ginibre point processes and other specific parametric models for DPPs.

Marked point processes as limits of Markovian arrival streams

1993 ◽  
Vol 30 (02) ◽  
pp. 365-372 ◽  
Author(s):  
Søren Asmussen ◽  
Ger Koole
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Marked Point ◽  
The State ◽  
Marked Point Processes ◽  
Marked Point Process ◽  
State Transitions ◽  
Poisson Arrival ◽  
Convergence Of Moments ◽  
Environmental Process

A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.

scholarly journals High-performance sampling of generic determinantal point processes

2020 ◽  
Vol 378 (2166) ◽  
pp. 20190059 ◽  
Author(s):  
Jack Poulson
Keyword(s):  
Point Process ◽  
Spectral Decomposition ◽  
High Performance ◽  
Point Processes ◽  
Cholesky Factorization ◽  
Determinantal Point Processes ◽  
Determinantal Point Process ◽  
Decomposition Approach ◽  
Map Inference ◽  
Sampling Schemes

Determinantal point processes (DPPs) were introduced by Macchi (Macchi 1975 Adv. Appl. Probab. 7 , 83–122) as a model for repulsive (fermionic) particle distributions. But their recent popularization is largely due to their usefulness for encouraging diversity in the final stage of a recommender system (Kulesza & Taskar 2012 Found. Trends Mach. Learn. 5 , 123–286). The standard sampling scheme for finite DPPs is a spectral decomposition followed by an equivalent of a randomly diagonally pivoted Cholesky factorization of an orthogonal projection, which is only applicable to Hermitian kernels and has an expensive set-up cost. Researchers Launay et al. 2018 ( http://arxiv.org/abs/1802.08429 ); Chen & Zhang 2018 NeurIPS ( https://papers.nips.cc/paper/7805-fast-greedy-map-inference-for-determinantal-point-process-to-improve-recommendation-diversity.pdf ) have begun to connect DPP sampling to LDL H factorizations as a means of avoiding the initial spectral decomposition, but existing approaches have only outperformed the spectral decomposition approach in special circumstances, where the number of kept modes is a small percentage of the ground set size. This article proves that trivial modifications of LU and LDL H factorizations yield efficient direct sampling schemes for non-Hermitian and Hermitian DPP kernels, respectively. Furthermore, it is experimentally shown that even dynamically scheduled, shared-memory parallelizations of high-performance dense and sparse-direct factorizations can be trivially modified to yield DPP sampling schemes with essentially identical performance. The software developed as part of this research, Catamari ( hodgestar.com/catamari ) is released under the Mozilla Public License v.2.0. It contains header-only, C++14 plus OpenMP 4.0 implementations of dense and sparse-direct, Hermitian and non-Hermitian DPP samplers. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

An analysis of the Pólya point process

1983 ◽  
Vol 15 (01) ◽  
pp. 39-53 ◽  
Author(s):  
Ed Waymire ◽  
Vijay K. Gupta
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Critical Value ◽  
General Representation ◽  
Infinitely Divisible ◽  
Generating Functional ◽  
Representation Problem ◽  
Polya Process ◽  
Pólya Process ◽  
Stochastic Point Processes

The Pólya process is employed to illustrate certain features of the structure of infinitely divisible stochastic point processes in connection with the representation for the probability generating functional introduced by Milne and Westcott in 1972. The Pólya process is used to provide a counterexample to the result of Ammann and Thall which states that the class of stochastic point processes with the Milne and Westcott representation is the class of regular infinitely divisble point processes. So the general representation problem is still unsolved. By carrying the analysis of the Pólya process further it is possible to see the extent to which the general representation is valid. In fact it is shown in the case of the Pólya process that there is a critical value of a parameter above which the representation breaks down. This leads to a proper version of the representation in the case of regular infinitely divisible point processes.

scholarly journals Neural Decoding Using a Parallel Sequential Monte Carlo Method on Point Processes with Ensemble Effect

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Kai Xu ◽  
Yiwen Wang ◽  
Fang Wang ◽  
Yuxi Liao ◽  
Qiaosheng Zhang ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Point Process ◽  
Goodness Of Fit ◽  
Point Processes ◽  
Sequential Monte Carlo ◽  
Neuronal Response ◽  
Position Estimation ◽  
Monte Carlo Algorithm ◽  
Sequential Monte Carlo Method ◽  
Proposed Model

Sequential Monte Carlo estimation on point processes has been successfully applied to predict the movement from neural activity. However, there exist some issues along with this method such as the simplified tuning model and the high computational complexity, which may degenerate the decoding performance of motor brain machine interfaces. In this paper, we adopt a general tuning model which takes recent ensemble activity into account. The goodness-of-fit analysis demonstrates that the proposed model can predict the neuronal response more accurately than the one only depending on kinematics. A new sequential Monte Carlo algorithm based on the proposed model is constructed. The algorithm can significantly reduce the root mean square error of decoding results, which decreases 23.6% in position estimation. In addition, we accelerate the decoding speed by implementing the proposed algorithm in a massive parallel manner on GPU. The results demonstrate that the spike trains can be decoded as point process in real time even with 8000 particles or 300 neurons, which is over 10 times faster than the serial implementation. The main contribution of our work is to enable the sequential Monte Carlo algorithm with point process observation to output the movement estimation much faster and more accurately.

On projected thick sections of stationary point processes and Boolean models

1996 ◽  
Vol 28 (2) ◽  
pp. 335-335
Author(s):  
Markus Kiderlen
Keyword(s):  
Point Process ◽  
Stationary Point ◽  
Point Processes ◽  
Linear Subspace ◽  
Isotropic Case ◽  
Thick Section ◽  
Boolean Models ◽  
Dimensional Linear Subspace ◽  
Stationary Point Process ◽  
Stationary Point Processes

For a stationary point process X of convex particles in ℝd the projected thick section process X(L) on a q-dimensional linear subspace L is considered. Formulae connecting geometric functionals, e.g. the quermass densities of X and X(L), are presented. They generalize the classical results of Miles (1976) and Davy (1976) which hold only in the isotropic case.

scholarly journals Power spectra of random spike fields and related processes

2005 ◽  
Vol 37 (4) ◽  
pp. 1116-1146 ◽  
Author(s):  
Pierre Brémaud ◽  
Laurent Massoulié ◽  
Andrea Ridolfi
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Power Spectra ◽  
Sampling Point ◽  
Birth And Death Processes ◽  
Large Classes ◽  
Random Samples ◽  
Branching Point ◽  
Random Times ◽  
Random Impulse

In this article, we review known results and present new ones concerning the power spectra of large classes of signals and random fields driven by an underlying point process, such as spatial shot noises (with random impulse response and arbitrary basic stationary point processes described by their Bartlett spectra) and signals or fields sampled at random times or points (where the sampling point process is again quite general). We also obtain the Bartlett spectrum for the general linear Hawkes spatial branching point process (with random fertility rate and general immigrant process described by its Bartlett spectrum). We then obtain the Bochner spectra of general spatial linear birth and death processes. Finally, we address the issues of random sampling and linear reconstruction of a signal from its random samples, reviewing and extending former results.

Sign in / Sign up

Export Citation Format

Share Document