Are Declustered Earthquake Catalogs Poisson?

Similar documents
Earthquake Clustering and Declustering

Testing for Poisson Behavior

Declustering and Poisson Tests

Ontology of Earthquake Probability: Metaphor

Shaking Down Earthquake Predictions

Earthquake prediction: Simple methods for complex phenomena. Bradley Luen

Gutenberg-Richter Relationship: Magnitude vs. frequency of occurrence

Quantifying the effect of declustering on probabilistic seismic hazard

Theory of earthquake recurrence times

The above-average rate of earthquakes of magnitude 8 and

A GLOBAL MODEL FOR AFTERSHOCK BEHAVIOUR

Multiple Sample Categorical Data

Limitations of Earthquake Triggering Models*

Chapte The McGraw-Hill Companies, Inc. All rights reserved.

H 2 : otherwise. that is simply the proportion of the sample points below level x. For any fixed point x the law of large numbers gives that

Standardized Tests of RELM ERF s Against Observed Seismicity

The goodness-of-fit test Having discussed how to make comparisons between two proportions, we now consider comparisons of multiple proportions.

Chapter 10. Chapter 10. Multinomial Experiments and. Multinomial Experiments and Contingency Tables. Contingency Tables.

Southern California Earthquake Center Collaboratory for the Study of Earthquake Predictability (CSEP) Thomas H. Jordan

" M A #M B. Standard deviation of the population (Greek lowercase letter sigma) σ 2

A nonparametric test for path dependence in discrete panel data

Quantitative Introduction ro Risk and Uncertainty in Business Module 5: Hypothesis Testing

Small-world structure of earthquake network

Statistical Data Analysis Stat 3: p-values, parameter estimation

Earthquake catalogues and preparation of input data for PSHA science or art?

11-2 Multinomial Experiment

Proximity to Past Earthquakes as a Least-Astonishing Hypothesis for Forecasting Locations of Future Earthquakes

Comparison of short-term and long-term earthquake forecast models for southern California

large number of i.i.d. observations from P. For concreteness, suppose

Earthquake Likelihood Model Testing

The Multinomial Model

14.30 Introduction to Statistical Methods in Economics Spring 2009

Lecture 21: October 19

Short-Term Properties of Earthquake Catalogs and Models of Earthquake Source

Asymptotic Statistics-VI. Changliang Zou

Psych Jan. 5, 2005

Testing Hypothesis. Maura Mezzetti. Department of Economics and Finance Università Tor Vergata

Earthquake clusters in southern California I: Identification and stability

TUTORIAL 8 SOLUTIONS #

One-Sample Numerical Data

Comparison of Short-Term and Time-Independent Earthquake Forecast Models for Southern California

Space-time clustering of seismicity in California and the distance dependence of earthquake triggering

Self-similar earthquake triggering, Båth s law, and foreshock/aftershock magnitudes: Simulations, theory, and results for southern California

High-resolution Time-independent Grid-based Forecast for M >= 5 Earthquakes in California

A Bayesian Change Point Model To Detect Changes In Event Occurrence Rates, With Application To Induced Seismicity

Chapter 11. Hypothesis Testing (II)

Loglikelihood and Confidence Intervals

Threshold estimation in marginal modelling of spatially-dependent non-stationary extremes

arxiv:physics/ v1 6 Aug 2006

Ling 289 Contingency Table Statistics

Module 6: Model Diagnostics

Section 4.6 Simple Linear Regression

Because of its reputation of validity over a wide range of

Hypothesis testing:power, test statistic CMS:

Modeling Aftershocks as a Stretched Exponential Relaxation

Horse Kick Example: Chi-Squared Test for Goodness of Fit with Unknown Parameters

Aftershock From Wikipedia, the free encyclopedia

STAT 135 Lab 6 Duality of Hypothesis Testing and Confidence Intervals, GLRT, Pearson χ 2 Tests and Q-Q plots. March 8, 2015

SUPPLEMENTARY INFORMATION

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama

CHAPTER 17 CHI-SQUARE AND OTHER NONPARAMETRIC TESTS FROM: PAGANO, R. R. (2007)

STAT 461/561- Assignments, Year 2015

10: Crosstabs & Independent Proportions

Optimal exact tests for complex alternative hypotheses on cross tabulated data

arxiv:physics/ v2 [physics.geo-ph] 18 Aug 2003

Assessing the dependency between the magnitudes of earthquakes and the magnitudes of their aftershocks

Recall the Basics of Hypothesis Testing

10.2: The Chi Square Test for Goodness of Fit

5 Introduction to the Theory of Order Statistics and Rank Statistics

Random Number Generation. CS1538: Introduction to simulations

Using ArcGIS to Analyze Earthquake Patterns in Java Island, Indonesia

Part 1.) We know that the probability of any specific x only given p ij = p i p j is just multinomial(n, p) where p k1 k 2

Solution to Tutorial 7

Chapter 26: Comparing Counts (Chi Square)

Review. Timothy Hanson. Department of Statistics, University of South Carolina. Stat 770: Categorical Data Analysis

Y. Y. Kagan and L. Knopoff Institute of Geophysics and Planetary Physics, University of California, Los Angeles, California 90024, USA

Earthquake. What is it? Can we predict it?

Review of One-way Tables and SAS

Seismicity of Northern California

Statistical Inference: Estimation and Confidence Intervals Hypothesis Testing

Using SPSS for One Way Analysis of Variance

STAT 328 (Statistical Packages)

DESAIN EKSPERIMEN Analysis of Variances (ANOVA) Semester Genap 2017/2018 Jurusan Teknik Industri Universitas Brawijaya

ST495: Survival Analysis: Hypothesis testing and confidence intervals

Residuals for spatial point processes based on Voronoi tessellations

Earthquake predictability measurement: information score and error diagram

Psych 230. Psychological Measurement and Statistics

UNIVERSITY OF CALGARY. Nontrivial Decay of Aftershock Density With Distance in Southern California. Javad Moradpour Taleshi A THESIS

Chi Square Analysis M&M Statistics. Name Period Date

A hidden Markov model for earthquake declustering

FORESHOCK PROBABILITIES IN THE WESTERN GREAT-BASIN EASTERN SIERRA NEVADA BY M. K. SAVAGE AND D. M. DEPOLO

Extreme Value Analysis and Spatial Extremes

Ornstein-Uhlenbeck processes for geophysical data analysis

Statistical Tests for Parameterized Multinomial Models: Power Approximation and Optimization. Edgar Erdfelder University of Mannheim Germany

Statistical Inference

:the actual population proportion are equal to the hypothesized sample proportions 2. H a

Stat 5101 Lecture Notes

One-Way Tables and Goodness of Fit

Geographical distributions of prospective foreshock probabilities in New Zealand

Performance of national scale smoothed seismicity estimates of earthquake activity rates. Abstract

Transcription:

Are Declustered Earthquake Catalogs Poisson? Philip B. Stark Department of Statistics, UC Berkeley Brad Luen Department of Mathematics, Reed College 14 October 2010 Department of Statistics, Penn State University

Outline Intro Abstract Quake Phenomenology and Physics Declustering Temporal Poisson Chi-square tests for temporal Poisson behavior Chi-square and KS test Tests on simulated data and declustered catalogs Spatiotemporal exchangeability Exchangable times Testing for exchangeable times Discussion Seismology versus Statistics

Abstract Claims that the times of events in declustered catalogs of Southern California seismicity fit Poisson process models have used tests that ignore earthquake locations. They divide time into intervals, count the events in the intervals, and then apply a chi-square test to those counts, calculating the expected number of intervals with each count from a Poisson distribution. The chi-square statistic does is insensitive to the order of the counts. Other tests give strong evidence that declustered Southern California catalogs do not follow a homogeneous temporal Poisson process. Spatial information is also telling: For declustered Southern California Earthquake Center catalogs for 1932 1971 and 2009, an abstract permutation test gives evidence that event times and locations are not conditionally exchangeable, a necessary condition for them to follow a spatially heterogeneous, temporally homogeneous Poisson process.

Phenomenology Earthquakes destroy and kill. Studied since ancient times. Prediction is an old goal: save lives and property. Phenomenology good. Physics not well understood.

Phenomenology Earthquakes destroy and kill. Studied since ancient times. Prediction is an old goal: save lives and property. Phenomenology good. Physics not well understood.

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Quake Physics versus Quake Statistics Distribution in space, clustering in time, distribution of sizes (Gutenberg-Richter law: N 10 a bm ) Foreshocks, aftershocks, swarms no physics-based definitions Clustering makes some prediction easy: If there s a big quake, predict that there will be another, close and soon. Not very useful. Physics hard: Quakes are gnat s whiskers on Earth s tectonic energy budget Spatiotemporal Poisson model doesn t fit More complex models motivated by physics

Why decluster? Online FAQ for USGS Earthquake Probability Mapping Application: Q: Ok, so why do you decluster the catalog? A: to get the best possible estimate for the rate of mainshocks the methodology requires a catalog of independent events (Poisson model), and declustering helps to achieve independence. What s a mainshock? Aren t foreshocks and aftershocks potentially destructive?

Why decluster? Online FAQ for USGS Earthquake Probability Mapping Application: Q: Ok, so why do you decluster the catalog? A: to get the best possible estimate for the rate of mainshocks the methodology requires a catalog of independent events (Poisson model), and declustering helps to achieve independence. What s a mainshock? Aren t foreshocks and aftershocks potentially destructive?

Why decluster? Online FAQ for USGS Earthquake Probability Mapping Application: Q: Ok, so why do you decluster the catalog? A: to get the best possible estimate for the rate of mainshocks the methodology requires a catalog of independent events (Poisson model), and declustering helps to achieve independence. What s a mainshock? Aren t foreshocks and aftershocks potentially destructive?

Why decluster? Online FAQ for USGS Earthquake Probability Mapping Application: Q: Ok, so why do you decluster the catalog? A: to get the best possible estimate for the rate of mainshocks the methodology requires a catalog of independent events (Poisson model), and declustering helps to achieve independence. What s a mainshock? Aren t foreshocks and aftershocks potentially destructive?

Main events, foreshocks, and aftershocks An event that the declustering method does not remove is a main shock. An event that the declustering method removes is a foreshock or an aftershock.... profound shrug... Where s the physics?

Declustering Methods Window-based methods Main-shock window: punch hole in catalog near each main shock Linked window: every event has a window. Clusters are maximal sets of events such that each is in the window of some other event in the group. Replace cluster by single event: first, largest, equivalent Generally, larger events have larger space-time windows Stochastic methods: use chance to decide which events to keep Other methods (e.g., waveform similarity)

Declustering Methods Window-based methods Main-shock window: punch hole in catalog near each main shock Linked window: every event has a window. Clusters are maximal sets of events such that each is in the window of some other event in the group. Replace cluster by single event: first, largest, equivalent Generally, larger events have larger space-time windows Stochastic methods: use chance to decide which events to keep Other methods (e.g., waveform similarity)

Declustering Methods Window-based methods Main-shock window: punch hole in catalog near each main shock Linked window: every event has a window. Clusters are maximal sets of events such that each is in the window of some other event in the group. Replace cluster by single event: first, largest, equivalent Generally, larger events have larger space-time windows Stochastic methods: use chance to decide which events to keep Other methods (e.g., waveform similarity)

Are main events Poisson in time? Gardner & Knopoff, 1974: Is the sequence of earthquakes in Southern California, with aftershocks removed, Poissonian? Abstract: Yes. Aftershocks: defined as above Statistical test: chi-square using counts of events in intervals Easy to make declustered catalogs indistinguishable from Poisson by deleting enough shocks or by using a weak test. Shrug.

Are main events Poisson in time? Gardner & Knopoff, 1974: Is the sequence of earthquakes in Southern California, with aftershocks removed, Poissonian? Abstract: Yes. Aftershocks: defined as above Statistical test: chi-square using counts of events in intervals Easy to make declustered catalogs indistinguishable from Poisson by deleting enough shocks or by using a weak test. Shrug.

Are main events Poisson in time? Gardner & Knopoff, 1974: Is the sequence of earthquakes in Southern California, with aftershocks removed, Poissonian? Abstract: Yes. Aftershocks: defined as above Statistical test: chi-square using counts of events in intervals Easy to make declustered catalogs indistinguishable from Poisson by deleting enough shocks or by using a weak test. Shrug.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Chi-square test Pick K. Partition the study period into K time intervals. n: total number of events. N k : events in interval k. Pick B 2, the number of bins. For b {0,..., B 2}, O b is the number of intervals that contain b events. O B 1 is the number of intervals with B 1 or more events. Estimate the rate of events by ˆλ = n/k. b Set E b Ke ˆλ ˆλ b! for b = 0,..., B 2, and set E B 1 K B 2 b=0 E b. Chi-square statistic: χ 2 B 1 b=0 (O b E b ) 2 E b. Nominal P-value: tail area of chi-square distribution, d.f. = d. Depends on K, B, d, and method of estimating λ.

Gardner-Knopoff, 1974 Chi-square test on a number of declustered catalogs, including a catalog of earthquakes with M 3.8 in the Southern California, 1932 1971. Raw: 1,751 events. Close to SCEC catalog for 1932 1971, but not an exact match (1,556 events w/ M 3.8; see below) Declustered catalog: 503 events. 10-day intervals. d = 2 degrees of freedom. Don t give B; don t explain how they estimated λ.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square approximation Null for simple chi-square test: data are multinomial with known category probabilities. Here, requires (i) Pr{N k = b} B b=1 known and don t depend on k (ii) {N k } K k=1 are iid. Neither is true. Bin probabilities are estimated. (Asymptotic justification for MLE based on category frequencies; apparently not what is done.) Trial corresponds to an interval. Category based the number of shocks in the interval. Condition on total number of shocks to estimate the rate: dependence among trials. Joint distribution not multinomial.

Chi-square test limitations Relies on approximation that can be poor. Ignores ignores spatial distribution. Ignores order of the K intervals: invariant under permutations. For instance, the chi-square statistic would have the same value for counts (N k ) = (3, 1, 0, 2, 0, 4, 1, 0) as for counts (N k ) = (0, 0, 0, 1, 1, 2, 3, 4). The latter hardly looks Poisson. Hence, chi-square has low power against some alternatives.

Chi-square test limitations Relies on approximation that can be poor. Ignores ignores spatial distribution. Ignores order of the K intervals: invariant under permutations. For instance, the chi-square statistic would have the same value for counts (N k ) = (3, 1, 0, 2, 0, 4, 1, 0) as for counts (N k ) = (0, 0, 0, 1, 1, 2, 3, 4). The latter hardly looks Poisson. Hence, chi-square has low power against some alternatives.

Chi-square test limitations Relies on approximation that can be poor. Ignores ignores spatial distribution. Ignores order of the K intervals: invariant under permutations. For instance, the chi-square statistic would have the same value for counts (N k ) = (3, 1, 0, 2, 0, 4, 1, 0) as for counts (N k ) = (0, 0, 0, 1, 1, 2, 3, 4). The latter hardly looks Poisson. Hence, chi-square has low power against some alternatives.

Chi-square test limitations Relies on approximation that can be poor. Ignores ignores spatial distribution. Ignores order of the K intervals: invariant under permutations. For instance, the chi-square statistic would have the same value for counts (N k ) = (3, 1, 0, 2, 0, 4, 1, 0) as for counts (N k ) = (0, 0, 0, 1, 1, 2, 3, 4). The latter hardly looks Poisson. Hence, chi-square has low power against some alternatives.

KS Test Kolmogorov-Smirnov (KS) test better against some alternatives. Test whether, conditional on the number of events, re-scaled times are iid U[0, 1]. KS statistic (U[0, 1] null): D n = sup t 1 n n 1(t i t) t. (1) i=1 Doesn t require estimating parameters or ad hoc K, B, d, ˆλ. Massart-Dvoretzky-Kiefer-Wolfowitz: If null is true, P(D n > x) 2 exp ( 2nx 2 ). (2) Conservative P-values.

KS Test Kolmogorov-Smirnov (KS) test better against some alternatives. Test whether, conditional on the number of events, re-scaled times are iid U[0, 1]. KS statistic (U[0, 1] null): D n = sup t 1 n n 1(t i t) t. (1) i=1 Doesn t require estimating parameters or ad hoc K, B, d, ˆλ. Massart-Dvoretzky-Kiefer-Wolfowitz: If null is true, P(D n > x) 2 exp ( 2nx 2 ). (2) Conservative P-values.

KS Test Kolmogorov-Smirnov (KS) test better against some alternatives. Test whether, conditional on the number of events, re-scaled times are iid U[0, 1]. KS statistic (U[0, 1] null): D n = sup t 1 n n 1(t i t) t. (1) i=1 Doesn t require estimating parameters or ad hoc K, B, d, ˆλ. Massart-Dvoretzky-Kiefer-Wolfowitz: If null is true, P(D n > x) 2 exp ( 2nx 2 ). (2) Conservative P-values.

Tests on simulated data Process KS power Chi-square test power Heterogeneous Poisson 1 0.1658 Gamma renewal 0.0009 1 Estimated power of level-0.05 tests of homogeneous Poisson null hypothesis from 10,000 simulations. Chi-square test uses 10-day intervals, B = 4 bins, and d = B 2 = 2 degrees of freedom. Heterogeneous Poisson : rate 0.25 per ten days for 20 years, then at rate 0.5 per ten days for 20 years. Gamma renewal : inter-event times iid gamma with shape 2 and rate 1.

Methods tested on SCEC data Method 1: Remove every event in the window of some other event. Method 2: Divide the catalog into clusters: include an event in a cluster if and only if it occurred within the window of at least one other event in the cluster. In every cluster, remove all events except the largest. Method 3: Consider the events in chronological order. If the ith event falls within the window of a preceding larger shock that has not already been deleted, delete it. If a larger shock falls within the window of the ith event, delete the ith event. Otherwise, retain the ith event. Methods 1 and 2 are linked-window methods; Method 3 is main shock method.

Methods tested on SCEC data Method 1: Remove every event in the window of some other event. Method 2: Divide the catalog into clusters: include an event in a cluster if and only if it occurred within the window of at least one other event in the cluster. In every cluster, remove all events except the largest. Method 3: Consider the events in chronological order. If the ith event falls within the window of a preceding larger shock that has not already been deleted, delete it. If a larger shock falls within the window of the ith event, delete the ith event. Otherwise, retain the ith event. Methods 1 and 2 are linked-window methods; Method 3 is main shock method.

Methods tested on SCEC data Method 1: Remove every event in the window of some other event. Method 2: Divide the catalog into clusters: include an event in a cluster if and only if it occurred within the window of at least one other event in the cluster. In every cluster, remove all events except the largest. Method 3: Consider the events in chronological order. If the ith event falls within the window of a preceding larger shock that has not already been deleted, delete it. If a larger shock falls within the window of the ith event, delete the ith event. Otherwise, retain the ith event. Methods 1 and 2 are linked-window methods; Method 3 is main shock method.

SCEC Catalog of Southern California Seismicity M 3.8, 1932 1971 Figure 1: Raw, 1,556 events Figure 2: GK linked windows, 424 events Figure 3: GK main-shock windows, 544 events

Comparison with GK: SCEC Catalog 1932 1971, M 3.8 GK used Method 1 but found similar results using Method 2. Tested using using a variety of bin widths. None of their tests rejected. Some difference between their catalog and SCEC. C.f. KS test plus chi-square test, B = 4 and d = 2. Reject if either test gave a P-value of less than 0.025; Bonferroni gives level 0.05. Method KS P-value Chi-square P-value MLE chi-square P-value Reject? 1 0.012 0.087 0.087 Yes 2 0.0064 0.297 0.295 Yes 3 0.022 6 10 6 4 10 6 Yes Distribution of times (after declustering) doesn t seem Poisson.

Exchangeability of times Spatially heterogeneous, temporally homogeneous Poisson process (SHTHPP): marginal distribution of times is Poisson, so previous tests reject. For SHTHPPs, two events can be arbitrarily close. Window declustering imposes minimum spacing, so can t be SHTHPP. For SHTHPPs, conditional on the number of events, the events are iid with probability density proportional to the space-time rate. Conditional on the locations, the marginal distribution of times is iid, hence exchangeable.

Exchangeability of times Spatially heterogeneous, temporally homogeneous Poisson process (SHTHPP): marginal distribution of times is Poisson, so previous tests reject. For SHTHPPs, two events can be arbitrarily close. Window declustering imposes minimum spacing, so can t be SHTHPP. For SHTHPPs, conditional on the number of events, the events are iid with probability density proportional to the space-time rate. Conditional on the locations, the marginal distribution of times is iid, hence exchangeable.

Exchangeability of times Spatially heterogeneous, temporally homogeneous Poisson process (SHTHPP): marginal distribution of times is Poisson, so previous tests reject. For SHTHPPs, two events can be arbitrarily close. Window declustering imposes minimum spacing, so can t be SHTHPP. For SHTHPPs, conditional on the number of events, the events are iid with probability density proportional to the space-time rate. Conditional on the locations, the marginal distribution of times is iid, hence exchangeable.

Exchangeability, contd. Location of the ith event is (x i, y i ), i = 1,..., n. x i is longitude, y i is latitude. T i : Time of the event at (x i, y i ). Π: Set of all n! permutations of {1,..., n}. Process has exchangeable times if, conditional on the locations, {T 1,..., T n } d = {T π(1),..., T π(n) } (3) for all permutations π Π.

Exchangeability, contd. Location of the ith event is (x i, y i ), i = 1,..., n. x i is longitude, y i is latitude. T i : Time of the event at (x i, y i ). Π: Set of all n! permutations of {1,..., n}. Process has exchangeable times if, conditional on the locations, {T 1,..., T n } d = {T π(1),..., T π(n) } (3) for all permutations π Π.

Exchangeability, contd. Location of the ith event is (x i, y i ), i = 1,..., n. x i is longitude, y i is latitude. T i : Time of the event at (x i, y i ). Π: Set of all n! permutations of {1,..., n}. Process has exchangeable times if, conditional on the locations, {T 1,..., T n } d = {T π(1),..., T π(n) } (3) for all permutations π Π.

Exchangeability, contd. Location of the ith event is (x i, y i ), i = 1,..., n. x i is longitude, y i is latitude. T i : Time of the event at (x i, y i ). Π: Set of all n! permutations of {1,..., n}. Process has exchangeable times if, conditional on the locations, {T 1,..., T n } d = {T π(1),..., T π(n) } (3) for all permutations π Π.

Exchangeability, contd. SHTHPP has exchangeable times. If events close in space tend to be close in time the kind of clustering real seismicity exhibits times not exchangeable. If events close in space tend to be distant in time e.g., from window methods for declustering times not exchangeable.

Exchangeability, contd. SHTHPP has exchangeable times. If events close in space tend to be close in time the kind of clustering real seismicity exhibits times not exchangeable. If events close in space tend to be distant in time e.g., from window methods for declustering times not exchangeable.

Exchangeability, contd. SHTHPP has exchangeable times. If events close in space tend to be close in time the kind of clustering real seismicity exhibits times not exchangeable. If events close in space tend to be distant in time e.g., from window methods for declustering times not exchangeable.

Permutation test set up ˆPn : empirical distribution of the times and locations of the n observed events. τ(ˆpn ): projection of ˆPn onto the set of distributions with exchangeable times τ puts equal mass at every element of the orbit of data under the permutation group on times. V R 3 is a lower-left quadrant if: V{x = (x, y, t) R 3 : x x 0 and y y 0 and t t 0 }. (4) V: the set of all lower-left quadrants.

Permutation test set up ˆPn : empirical distribution of the times and locations of the n observed events. τ(ˆpn ): projection of ˆPn onto the set of distributions with exchangeable times τ puts equal mass at every element of the orbit of data under the permutation group on times. V R 3 is a lower-left quadrant if: V{x = (x, y, t) R 3 : x x 0 and y y 0 and t t 0 }. (4) V: the set of all lower-left quadrants.

Permutation test set up ˆPn : empirical distribution of the times and locations of the n observed events. τ(ˆpn ): projection of ˆPn onto the set of distributions with exchangeable times τ puts equal mass at every element of the orbit of data under the permutation group on times. V R 3 is a lower-left quadrant if: V{x = (x, y, t) R 3 : x x 0 and y y 0 and t t 0 }. (4) V: the set of all lower-left quadrants.

Permutation test set up ˆPn : empirical distribution of the times and locations of the n observed events. τ(ˆpn ): projection of ˆPn onto the set of distributions with exchangeable times τ puts equal mass at every element of the orbit of data under the permutation group on times. V R 3 is a lower-left quadrant if: V{x = (x, y, t) R 3 : x x 0 and y y 0 and t t 0 }. (4) V: the set of all lower-left quadrants.

Test statistic sup ˆPn (V) τ(ˆpn )(V) (5) V V Generalization of the KS statistic to three dimensions. Suffices to search a finite subset of V. Can sample at random from that finite subset for efficiency. Calibrate by simulating from τ(ˆpn ) permuting the times (Romano)

Test statistic sup ˆPn (V) τ(ˆpn )(V) (5) V V Generalization of the KS statistic to three dimensions. Suffices to search a finite subset of V. Can sample at random from that finite subset for efficiency. Calibrate by simulating from τ(ˆpn ) permuting the times (Romano)

Test statistic sup ˆPn (V) τ(ˆpn )(V) (5) V V Generalization of the KS statistic to three dimensions. Suffices to search a finite subset of V. Can sample at random from that finite subset for efficiency. Calibrate by simulating from τ(ˆpn ) permuting the times (Romano)

Results of exchangeability test: 2009 SCEC data M 2.5 Test statistics for permuted 2009 SoCal catalog Density 0 20 40 60 0.025 0.030 0.035 0.040 0.045 0.050 0.055 S n Figure 4: Reasenberg declustering: 475 events. 1-tailed P-value 0.003 (99% CI [0.0003, 0.011]). For raw catalog of 753 events, test statistic is larger than any of the statistics for 1,000 permuted catalogs: P < 0.001 (99% CI [0, 0.007]).

Discussion: Seismology Declustered catalogs don t look Poisson in time. Declustered catalogs can t be Poisson in space-time. Declustered catalogs don t seem to have exchangeable times, necessary condition for Poisson. No clear definition of foreshock, main shock, aftershock. All big shocks can cause damage and death. Physics doesn t distinguish main shocks from others. So why decluster?

Discussion: Seismology Declustered catalogs don t look Poisson in time. Declustered catalogs can t be Poisson in space-time. Declustered catalogs don t seem to have exchangeable times, necessary condition for Poisson. No clear definition of foreshock, main shock, aftershock. All big shocks can cause damage and death. Physics doesn t distinguish main shocks from others. So why decluster?

Discussion: Seismology Declustered catalogs don t look Poisson in time. Declustered catalogs can t be Poisson in space-time. Declustered catalogs don t seem to have exchangeable times, necessary condition for Poisson. No clear definition of foreshock, main shock, aftershock. All big shocks can cause damage and death. Physics doesn t distinguish main shocks from others. So why decluster?

Discussion: Seismology Declustered catalogs don t look Poisson in time. Declustered catalogs can t be Poisson in space-time. Declustered catalogs don t seem to have exchangeable times, necessary condition for Poisson. No clear definition of foreshock, main shock, aftershock. All big shocks can cause damage and death. Physics doesn t distinguish main shocks from others. So why decluster?

Discussion: Seismology Declustered catalogs don t look Poisson in time. Declustered catalogs can t be Poisson in space-time. Declustered catalogs don t seem to have exchangeable times, necessary condition for Poisson. No clear definition of foreshock, main shock, aftershock. All big shocks can cause damage and death. Physics doesn t distinguish main shocks from others. So why decluster?

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.

Discussion: Statistics The test matters. What s the scientific question? Trivial to make declustering method pass test: Delete most of the events. Suggests optimization problem: remove fewest events to pass test. Combinatorially complex in general. For test statistic like sup V V ˆPn (V) τ(ˆpn )(V), relaxation is linear program. Interesting? No obvious practical import.