Christine H. Müller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Christine H. Müller has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
Liesa Denecke
Technische Universität Dortmund
27 shared publicationsIvan Mizera
4 shared publications- Christoph P. Kustosz
Technische Universität Dortmund, Fakultät Statistik, Vogelpothsweg 87, 44221 Dortmund, Germany
3 shared publications Katja Ickstadt
3 shared publications- Melanie Horn
TU Dortmund University, Statistics, Dortmund, Germany
3 shared publications Reinhard Maurer
Faculty of Architecture and Civil Engineering TU Dortmund University Dortmund Germany
3 shared publications
Latest Publications
- Open Access
- 6 July 2026
- Published by Springer Nature in Metrika
- p. 1-31
Bivariate and multivariate sign depth and related distribution-free tests for model fit
For testing a model fit for univariate data, tests based on the K -sign depth introduced by Malcherczyk et al. (2021) are distribution-free, outlier robust and very powerful for $$K > 2$$ . Here, we propose two extensions of the K -sign depth to p -dimensional data, namely the L -simplex depth based on L simplices spanned by $$p + 1$$ residuals and component L -depth, which is the componentwise application of the K -sign depth with $$K=L+1$$ . The simplex depth as well as the component depth can be used in a full version and in a simplified version. We derive some properties of the two simplex depth versions for bivariate data which show in particular that tests based on these depth versions are distribution-free. Then, we compare the four depth versions with $$L = 1$$ and $$L = 2$$ by simulations. We also provide a simple algorithm to calculate all component depths in linear time and efficient algorithms for the simplex depths.- 6 July 2026
- Published by Springer Nature in Metrika
- p. 1-31
Open AccessBivariate and multivariate sign depth and related distribution-free tests for model fit
For testing a model fit for univariate data, tests based on the K -sign depth introduced by Malcherczyk et al. (2021) are distribution-free, outlier robust and very powerful for $$K > 2$$ . Here, we propose two extensions of the K -sign depth to p -dimensional data, namely the L -simplex depth based on L simplices spanned by $$p + 1$$ residuals and component L -depth, which is the componentwise application of the K -sign depth with $$K=L+1$$ . The simplex depth as well as the component depth can be used in a full version and in a simplified version. We derive some properties of the two simplex depth versions for bivariate data which show in particular that tests based on these depth versions are distribution-free. Then, we compare the four depth versions with $$L = 1$$ and $$L = 2$$ by simulations. We also provide a simple algorithm to calculate all component depths in linear time and efficient algorithms for the simplex depths. - Open Access
- 21 April 2026
- Published by Springer Nature in Statistical Papers
- Vol. 67 (3) , 55
Asymptotics of minimum distance estimation for self-exciting load sharing point processes
The cumulative intensity of a self-exciting point process allows us to translate complex dynamics such as load sharing effects and the accumulation of damage into a parametric model. Kopperschmidt and Stute (Stat Sin 23:1273–1298, 2013) proposed a minimum Cramér–von Mises distance estimator for semi-parametric cumulative intensity models. However, their proof of the asymptotic normality of the estimator is based on an invalid extension of Kolmogorov’s tightness criterion to arbitrary dimensions. In this paper, we correct the proof of the asymptotic normality of the minimum distance estimator for self-exciting point processes. We show that our slightly stronger assumptions are satisfied for load sharing processes with damage accumulation, an important class of self-exciting point processes in engineering sciences. Moreover, Wald-type confidence regions can be derived from the asymptotic normal distribution of the minimum distance estimator. We apply the corresponding tests to a real data set to confirm that the effects of load sharing and damage accumulation are statistically significant. We also compare them to the likelihood-ratio test in a simulation study, and assess the robustness of the minimum distance estimator claimed by Kopperschmidt and Stute (2013) by applying both methods to a contaminated data set.
- 21 April 2026
- Published by Springer Nature in Statistical Papers
- Vol. 67 (3) , 55
Open AccessAsymptotics of minimum distance estimation for self-exciting load sharing point processes
The cumulative intensity of a self-exciting point process allows us to translate complex dynamics such as load sharing effects and the accumulation of damage into a parametric model. Kopperschmidt and Stute (Stat Sin 23:1273–1298, 2013) proposed a minimum Cramér–von Mises distance estimator for semi-parametric cumulative intensity models. However, their proof of the asymptotic normality of the estimator is based on an invalid extension of Kolmogorov’s tightness criterion to arbitrary dimensions. In this paper, we correct the proof of the asymptotic normality of the minimum distance estimator for self-exciting point processes. We show that our slightly stronger assumptions are satisfied for load sharing processes with damage accumulation, an important class of self-exciting point processes in engineering sciences. Moreover, Wald-type confidence regions can be derived from the asymptotic normal distribution of the minimum distance estimator. We apply the corresponding tests to a real data set to confirm that the effects of load sharing and damage accumulation are statistically significant. We also compare them to the likelihood-ratio test in a simulation study, and assess the robustness of the minimum distance estimator claimed by Kopperschmidt and Stute (2013) by applying both methods to a contaminated data set.
- 27 June 2024
- Published by Springer Nature
- p. 163-169
Statistics and Reliability of Technical Products
- 15 October 2023
- Published by Elsevier in Econometrics and Statistics
- Vol. 40, 24-38
On the consistency of K -sign depth tests
- 15 October 2023
- Published by Elsevier in Econometrics and Statistics
- Vol. 40, 24-38
On the consistency of K -sign depth tests
- Open Access
- 24 March 2023
- Published by Springer Nature in Statistical Papers
- Vol. 64 (4) , 1159-1186
A-optimal designs for state estimation in networks
We consider two models for estimating the expected states of nodes in networks where the observations at nodes are given by random states and measurement errors. In the first model, we assume independent successive observations at the nodes and the design question is how often the nodes should be observed to obtain a precise estimation of the expected states. In the second model, all nodes are observed simultaneously and the design question is to determine the nodes which need larger precision of the measurements than other nodes. Both models lead to the same design problem. We derive explicitly A-optimal designs for the most simple network with star configuration. Moreover, we consider the network with wheel configuration and derive some conditions which simplify the numerical calculation of the corresponding A-optimal designs.
- 24 March 2023
- Published by Springer Nature in Statistical Papers
- Vol. 64 (4) , 1159-1186
Open AccessA-optimal designs for state estimation in networks
We consider two models for estimating the expected states of nodes in networks where the observations at nodes are given by random states and measurement errors. In the first model, we assume independent successive observations at the nodes and the design question is how often the nodes should be observed to obtain a precise estimation of the expected states. In the second model, all nodes are observed simultaneously and the design question is to determine the nodes which need larger precision of the measurements than other nodes. Both models lead to the same design problem. We derive explicitly A-optimal designs for the most simple network with star configuration. Moreover, we consider the network with wheel configuration and derive some conditions which simplify the numerical calculation of the corresponding A-optimal designs.
- 15 November 2022
- Published by Springer Nature
- p. 283-300
Detecting Diamond Breakouts of Diamond Impregnated Tools for Core Drilling of Concrete by Force Measurements
- 15 November 2022
- Published by Springer Nature
- p. 283-300
Detecting Diamond Breakouts of Diamond Impregnated Tools for Core Drilling of Concrete by Force Measurements
- 10 October 2022
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 93 (7) , 1169-1191
Sign depth tests in multiple regression
The recently proposed simple but powerful sign depth tests depend on the order of the residuals. While one-dimensional explanatory variables provide a natural order, there exists no canonical order for multidimensional explanatory variables. For this scenario, we present different approaches for ordering multidimensional explanatory variables and compare them regarding their performance with respect to the stability of the ordering, the usability for non-metric explanatory variables, the computational time complexity, and in the context of testing in linear models including high-dimensional multiple regression. It is shown that the sign depth tests based on orderings given by pairwise distances perform best. They are much more powerful than the classical sign test and also than the F-test when not having normally distributed errors. They are competitive to the much more complicated robust Wald test based on efficient MM-estimation. Additionally, the sign depth tests are more appropriate for outlier robust model checks.
- 10 October 2022
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 93 (7) , 1169-1191
Sign depth tests in multiple regression
The recently proposed simple but powerful sign depth tests depend on the order of the residuals. While one-dimensional explanatory variables provide a natural order, there exists no canonical order for multidimensional explanatory variables. For this scenario, we present different approaches for ordering multidimensional explanatory variables and compare them regarding their performance with respect to the stability of the ordering, the usability for non-metric explanatory variables, the computational time complexity, and in the context of testing in linear models including high-dimensional multiple regression. It is shown that the sign depth tests based on orderings given by pairwise distances perform best. They are much more powerful than the classical sign test and also than the F-test when not having normally distributed errors. They are competitive to the much more complicated robust Wald test based on efficient MM-estimation. Additionally, the sign depth tests are more appropriate for outlier robust model checks.
- Open Access
- 30 July 2022
- Published by Springer Nature in Statistical Papers
- Vol. 64 (3) , 857-882
Simple powerful robust tests based on sign depth
Up to now, powerful outlier robust tests for linear models are based on M-estimators and are quite complicated. On the other hand, the simple robust classical sign test usually provides very bad power for certain alternatives. We present a generalization of the sign test which is similarly easy to comprehend but much more powerful. It is based on K-sign depth, shortly denoted by K-depth. These so-called K-depth tests are motivated by simplicial regression depth, but are not restricted to regression problems. They can be applied as soon as the true model leads to independent residuals with median equal to zero. Moreover, general hypotheses on the unknown parameter vector can be tested. While the 2-depth test, i.e. the K-depth test for $$K = 2$$ , is equivalent to the classical sign test, K-depth test with $$K\ge 3$$ turn out to be much more powerful in many applications. A drawback of the K-depth test is its fairly high computational effort when implemented naively. However, we show how this inherent computational complexity can be reduced. In order to see why K-depth tests with $$K\ge 3$$ are more powerful than the classical sign test, we discuss the asymptotic behavior of its test statistic for residual vectors with only few sign changes, which is in particular the case for some alternatives the classical sign test cannot reject. In contrast, we also consider residual vectors with alternating signs, representing models that fit the data very well. Finally, we demonstrate the good power of the K-depth tests for some examples including high-dimensional multiple regression.- 30 July 2022
- Published by Springer Nature in Statistical Papers
- Vol. 64 (3) , 857-882
Open AccessSimple powerful robust tests based on sign depth
Up to now, powerful outlier robust tests for linear models are based on M-estimators and are quite complicated. On the other hand, the simple robust classical sign test usually provides very bad power for certain alternatives. We present a generalization of the sign test which is similarly easy to comprehend but much more powerful. It is based on K-sign depth, shortly denoted by K-depth. These so-called K-depth tests are motivated by simplicial regression depth, but are not restricted to regression problems. They can be applied as soon as the true model leads to independent residuals with median equal to zero. Moreover, general hypotheses on the unknown parameter vector can be tested. While the 2-depth test, i.e. the K-depth test for $$K = 2$$ , is equivalent to the classical sign test, K-depth test with $$K\ge 3$$ turn out to be much more powerful in many applications. A drawback of the K-depth test is its fairly high computational effort when implemented naively. However, we show how this inherent computational complexity can be reduced. In order to see why K-depth tests with $$K\ge 3$$ are more powerful than the classical sign test, we discuss the asymptotic behavior of its test statistic for residual vectors with only few sign changes, which is in particular the case for some alternatives the classical sign test cannot reject. In contrast, we also consider residual vectors with alternating signs, representing models that fit the data very well. Finally, we demonstrate the good power of the K-depth tests for some examples including high-dimensional multiple regression. - 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 71 (2) , 539-554
Inference of Intensity-Based Models for Load-Sharing Systems With Damage Accumulation
To model damage accumulation for load-sharing systems, two models given by intensity functions of self-exciting point processes are proposed: a model with additive damage accumulation and a model with multiplicative damage accumulation. Both models include the model without damage accumulation as a special case. For both models, the likelihood functions are derived and maximum likelihood estimators and likelihood ratio tests are given in a scale-invariant version and a scale-dependent version. Furthermore, a Bayesian approach using Markov chain Monte Carlo methods for posterior computation is provided. The frequentist and Bayesian methods are applied to a data set of failures of tension wires of concrete beams where a significant damage accumulation effect is confirmed by both additive and multiplicative damage accumulation models. This is all the more remarkable as a simulation study indicates that the tests for an existing damage accumulation effect are rather conservative. Moreover, prediction intervals for the failure times of the tension wires in a new experiment are given, which improve former prediction intervals derived without damage accumulation. The simulation study considers a scenario with a fixed time horizon and one with fixed numbers of failed components of the systems.
- 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 71 (2) , 539-554
Inference of Intensity-Based Models for Load-Sharing Systems With Damage Accumulation
To model damage accumulation for load-sharing systems, two models given by intensity functions of self-exciting point processes are proposed: a model with additive damage accumulation and a model with multiplicative damage accumulation. Both models include the model without damage accumulation as a special case. For both models, the likelihood functions are derived and maximum likelihood estimators and likelihood ratio tests are given in a scale-invariant version and a scale-dependent version. Furthermore, a Bayesian approach using Markov chain Monte Carlo methods for posterior computation is provided. The frequentist and Bayesian methods are applied to a data set of failures of tension wires of concrete beams where a significant damage accumulation effect is confirmed by both additive and multiplicative damage accumulation models. This is all the more remarkable as a simulation study indicates that the tests for an existing damage accumulation effect are rather conservative. Moreover, prediction intervals for the failure times of the tension wires in a new experiment are given, which improve former prediction intervals derived without damage accumulation. The simulation study considers a scenario with a fixed time horizon and one with fixed numbers of failed components of the systems.
- Open Access
- 6 July 2020
- Published by Wiley in Quality and Reliability Engineering International
- Vol. 36 (8) , 2639-2659
Detection of circlelike overlapping objects in thermal spray images
- 6 July 2020
- Published by Wiley in Quality and Reliability Engineering International
- Vol. 36 (8) , 2639-2659
Open AccessDetection of circlelike overlapping objects in thermal spray images