Carsten Jentsch
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
Carsten Jentsch has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Christian H. Weiß
Department of Mathematics and Statistics Helmut Schmidt University Hamburg Germany
8 shared publications - Jonas Rieger
Department of Statistics, Dortmund Center for Data-Based Media Analysis, TU Dortmund University, Dortmund, Germany
5 shared publications - Maxime Faymonville
Department of Statistics TU Dortmund University D-44221 Dortmund Germany
4 shared publications - Efstathios Paparoditis
Department of Mathematics and Statistics University of Cyprus P.O.Box 20537 CY-1678 Nicosia Cyprus
3 shared publications - Jonathan Flossdorf
Department of Statistics TU Dortmund University Dortmund Germany
3 shared publications - Kai-Robin Lange
Department of Statistics TU Dortmund University 44221 Dortmund Germany
3 shared publications
Latest Publications
- Open Access
- 20 August 2026
- Published by Springer Nature in Empirical Economics
- Vol. 71 (3) , 30
Changing inflation perception and the propagation of news shocks
Based on a previously established text data-based indicator, the Inflation Perception Indicator (IPI), we analyze the information content of inflation-related media coverage. It is argued that media do not report on inflation in a constant or systematic manner but instead react to specific events, which means that reporting is state-dependent. Using a dynamic extension of the Latent Dirichlet Allocation (LDA) topic modeling approach we examine the salience and framing of inflation in a corpus of 50,000 articles published by major German newspapers between 2001 and 2024. This approach allows to decompose the IPI into dynamic topic-specific subindicators. To analyze the information content of these newly constructed indicators, we estimate a threshold Bayesian Vector AutoRegressive (BVAR) model for variables from a New Keynesian macroeconomic model with two inflation regimes. Our results suggest that the topic-specific IPI subindicators contain different information about price developments. Moreover, we find some evidence that households make different use of this information in high- and low-inflation regimes when adjusting their inflation expectations.
- 20 August 2026
- Published by Springer Nature in Empirical Economics
- Vol. 71 (3) , 30
Open AccessChanging inflation perception and the propagation of news shocks
Based on a previously established text data-based indicator, the Inflation Perception Indicator (IPI), we analyze the information content of inflation-related media coverage. It is argued that media do not report on inflation in a constant or systematic manner but instead react to specific events, which means that reporting is state-dependent. Using a dynamic extension of the Latent Dirichlet Allocation (LDA) topic modeling approach we examine the salience and framing of inflation in a corpus of 50,000 articles published by major German newspapers between 2001 and 2024. This approach allows to decompose the IPI into dynamic topic-specific subindicators. To analyze the information content of these newly constructed indicators, we estimate a threshold Bayesian Vector AutoRegressive (BVAR) model for variables from a New Keynesian macroeconomic model with two inflation regimes. Our results suggest that the topic-specific IPI subindicators contain different information about price developments. Moreover, we find some evidence that households make different use of this information in high- and low-inflation regimes when adjusting their inflation expectations.
- Open Access
Word-Centered Semantic Graphs for Interpretable Diachronic Sense Tracking
We propose an interpretable, graph-based framework for analyzing semantic shift in diachronic corpora. For each target word and time slice, we induce a word-centered semantic network that integrates distributional similarity from diachronic Skip-gram embeddings with lexical substitutability from time-specific masked language models. We identify sense-related structure by clustering the peripheral graph, align clusters across time via node overlap, and track change through cluster composition and normalized cluster mass. In an application study on a corpus of New York Times Magazine articles (1980 - 2017), we show that graph connectivity reflects polysemy dynamics and that the induced communities capture contrasting trajectories: event-driven sense replacement (trump), semantic stability with cluster over-segmentation effects (god), and gradual association shifts tied to digital communication (post). Overall, word-centered semantic graphs offer a compact and transparent representation for exploring sense evolution without relying on predefined sense inventories.
Open AccessWord-Centered Semantic Graphs for Interpretable Diachronic Sense Tracking
We propose an interpretable, graph-based framework for analyzing semantic shift in diachronic corpora. For each target word and time slice, we induce a word-centered semantic network that integrates distributional similarity from diachronic Skip-gram embeddings with lexical substitutability from time-specific masked language models. We identify sense-related structure by clustering the peripheral graph, align clusters across time via node overlap, and track change through cluster composition and normalized cluster mass. In an application study on a corpus of New York Times Magazine articles (1980 - 2017), we show that graph connectivity reflects polysemy dynamics and that the induced communities capture contrasting trajectories: event-driven sense replacement (trump), semantic stability with cluster over-segmentation effects (god), and gradual association shifts tied to digital communication (post). Overall, word-centered semantic graphs offer a compact and transparent representation for exploring sense evolution without relying on predefined sense inventories.
- Open Access
- 3 January 2026
- Published by Springer Nature in Computational Statistics
- Vol. 41 (1) , 25
The impact of random tree depth—a novel randomization process for ensemble methods
The induction of additional randomness in parallel and sequential ensemble methods has proven to be worthwhile in many aspects. In this manuscript, we propose a novel random tree depth approach for sequential and parallel tree-based approaches. In particular, we apply the concept of a random tree depth for the representative methods of Boosting (MART) and Random Forests. Both approaches are then investigated with respect to their runtime and prediction performance. We call the resulting methods Random Depth Boosting and Random Depth Forest . Initially, an exemplary experiment on a simple data set indicates that combining Random Depth with MART can enhance prediction performance, while the impact on Random Forests remains limited. This observation aligns with a heuristically intuitive understanding of how randomizing tree depth interacts with bagging and boosting dynamics. Though a full theoretical analysis lies beyond the scope of this work, the underlying mechanisms can be well-motivated and heuristically explained. Building on these insights, a Monte Carlo simulation study investigates the effects on both artificial tree-shaped data sets with varying numbers of final partitions and on a selection of real-world classification and regression datasets. The results show that Random Depth Boosting offers relevant improvements for MART-based models. Additionally, the randomization of tree depth can reduce computation time by up to $$40\%$$ , making the approach an attractive option in time-sensitive applications.- 3 January 2026
- Published by Springer Nature in Computational Statistics
- Vol. 41 (1) , 25
Open AccessThe impact of random tree depth—a novel randomization process for ensemble methods
The induction of additional randomness in parallel and sequential ensemble methods has proven to be worthwhile in many aspects. In this manuscript, we propose a novel random tree depth approach for sequential and parallel tree-based approaches. In particular, we apply the concept of a random tree depth for the representative methods of Boosting (MART) and Random Forests. Both approaches are then investigated with respect to their runtime and prediction performance. We call the resulting methods Random Depth Boosting and Random Depth Forest . Initially, an exemplary experiment on a simple data set indicates that combining Random Depth with MART can enhance prediction performance, while the impact on Random Forests remains limited. This observation aligns with a heuristically intuitive understanding of how randomizing tree depth interacts with bagging and boosting dynamics. Though a full theoretical analysis lies beyond the scope of this work, the underlying mechanisms can be well-motivated and heuristically explained. Building on these insights, a Monte Carlo simulation study investigates the effects on both artificial tree-shaped data sets with varying numbers of final partitions and on a selection of real-world classification and regression datasets. The results show that Random Depth Boosting offers relevant improvements for MART-based models. Additionally, the randomization of tree depth can reduce computation time by up to $$40\%$$ , making the approach an attractive option in time-sensitive applications. - 1 November 2025
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 31 (4) , 3213-3234
Semi-parametric goodness-of-fit testing for INAR models
Among the various models designed for dependent count data, integer-valued autoregressive (INAR) processes enjoy great popularity. Typically, statistical inference for INAR models uses asymptotic theory that relies on rather stringent (parametric) assumptions on the innovations such as Poisson or negative binomial distributions. In this paper, we present a novel semi-parametric goodness-of-fit test tailored for the INAR model class. Relying on the INAR-specific shape of the joint probability generating function, our approach allows for model validation of INAR models without specifying the (family of the) innovation distribution. We derive the limiting null distribution of our proposed test statistic, prove consistency under fixed alternatives and discuss its asymptotic behavior under local alternatives. By manifold Monte Carlo simulations, we illustrate the overall good performance of our testing procedure in terms of power and size properties. In particular, it turns out that the power can be considerably improved by using higher-order test statistics. In supplementary material, we provide an application to three real-world economic data sets.
- 1 November 2025
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 31 (4) , 3213-3234
Semi-parametric goodness-of-fit testing for INAR models
Among the various models designed for dependent count data, integer-valued autoregressive (INAR) processes enjoy great popularity. Typically, statistical inference for INAR models uses asymptotic theory that relies on rather stringent (parametric) assumptions on the innovations such as Poisson or negative binomial distributions. In this paper, we present a novel semi-parametric goodness-of-fit test tailored for the INAR model class. Relying on the INAR-specific shape of the joint probability generating function, our approach allows for model validation of INAR models without specifying the (family of the) innovation distribution. We derive the limiting null distribution of our proposed test statistic, prove consistency under fixed alternatives and discuss its asymptotic behavior under local alternatives. By manifold Monte Carlo simulations, we illustrate the overall good performance of our testing procedure in terms of power and size properties. In particular, it turns out that the power can be considerably improved by using higher-order test statistics. In supplementary material, we provide an application to three real-world economic data sets.
- Open Access
- 18 September 2025
- Published by Elsevier in Journal of Econometrics
- Vol. 252
Structural periodic vector autoregressions
- 18 September 2025
- Published by Elsevier in Journal of Econometrics
- Vol. 252
Open AccessStructural periodic vector autoregressions
- Open Access
Predictive inference for discrete-valued time series
For discrete-valued time series, predictive inference cannot be implemented through the construction of prediction intervals to some predetermined coverage level, as this is the case for real-valued time series. To address this problem, we propose to reverse the construction principle by considering preselected sets of interest and estimating the probability that a future observation of the process falls into these sets. The accuracy of the prediction is then evaluated by quantifying the uncertainty associated with estimation of these predictive probabilities. We consider parametric and non-parametric approaches and derive asymptotic theory for the estimators involved. Suitable bootstrap approaches to evaluate the distribution of the estimators considered also are introduced. They have the advantage to imitate the distributions of interest under different possible settings, including the practical important case where uncertainty holds true about the correctness of a parametric model used for prediction. Theoretical justification of the bootstrap is given, which also requires investigation of asymptotic properties of parameter estimators under model misspecification. We elaborate on bootstrap implementations under different scenarios and focus on parametric prediction using INAR and INARCH models and (conditional) maximum likelihood estimators. Simulations investigate the finite sample performance of the predictive method developed and applications to real life data sets are presented.
Open AccessPredictive inference for discrete-valued time series
For discrete-valued time series, predictive inference cannot be implemented through the construction of prediction intervals to some predetermined coverage level, as this is the case for real-valued time series. To address this problem, we propose to reverse the construction principle by considering preselected sets of interest and estimating the probability that a future observation of the process falls into these sets. The accuracy of the prediction is then evaluated by quantifying the uncertainty associated with estimation of these predictive probabilities. We consider parametric and non-parametric approaches and derive asymptotic theory for the estimators involved. Suitable bootstrap approaches to evaluate the distribution of the estimators considered also are introduced. They have the advantage to imitate the distributions of interest under different possible settings, including the practical important case where uncertainty holds true about the correctness of a parametric model used for prediction. Theoretical justification of the bootstrap is given, which also requires investigation of asymptotic properties of parameter estimators under model misspecification. We elaborate on bootstrap implementations under different scenarios and focus on parametric prediction using INAR and INARCH models and (conditional) maximum likelihood estimators. Simulations investigate the finite sample performance of the predictive method developed and applications to real life data sets are presented.
- Open Access
Joint semi-parametric INAR bootstrap inference for model coefficients and innovation distribution
For modeling the serial dependence in time series of counts, various approaches have been proposed in the literature. In particular, models based on a recursive, autoregressive-type structure such as the well-known integer-valued autoregressive (INAR) models are very popular in practice. The distribution of such INAR models is fully determined by a vector of autoregressive binomial thinning coefficients and the discrete innovation distribution. While fully parametric estimation techniques for these models are mostly covered in the literature, a semi-parametric approach allows for consistent and efficient joint estimation of the model coefficients and the innovation distribution without imposing any parametric assumptions. Although the limiting distribution of this estimator is known, which, in principle, enables asymptotic inference and INAR model diagnostics on the innovations, it is cumbersome to apply in practice. In this paper, we consider a corresponding semi-parametric INAR bootstrap procedure and show its joint consistency for the estimation of the INAR coefficients and for the estimation of the innovation distribution. We discuss different application scenarios that include goodness-of-fit testing, predictive inference and joint dispersion index analysis for count time series. In simulations, we illustrate the finite sample performance of the semi-parametric INAR bootstrap using several innovation distributions and provide real-data applications.
Open AccessJoint semi-parametric INAR bootstrap inference for model coefficients and innovation distribution
For modeling the serial dependence in time series of counts, various approaches have been proposed in the literature. In particular, models based on a recursive, autoregressive-type structure such as the well-known integer-valued autoregressive (INAR) models are very popular in practice. The distribution of such INAR models is fully determined by a vector of autoregressive binomial thinning coefficients and the discrete innovation distribution. While fully parametric estimation techniques for these models are mostly covered in the literature, a semi-parametric approach allows for consistent and efficient joint estimation of the model coefficients and the innovation distribution without imposing any parametric assumptions. Although the limiting distribution of this estimator is known, which, in principle, enables asymptotic inference and INAR model diagnostics on the innovations, it is cumbersome to apply in practice. In this paper, we consider a corresponding semi-parametric INAR bootstrap procedure and show its joint consistency for the estimation of the INAR coefficients and for the estimation of the innovation distribution. We discuss different application scenarios that include goodness-of-fit testing, predictive inference and joint dispersion index analysis for count time series. In simulations, we illustrate the finite sample performance of the semi-parametric INAR bootstrap using several innovation distributions and provide real-data applications.
- Open Access
Narrative Shift Detection: A Hybrid Approach of Dynamic Topic Models and Large Language Models
With rapidly evolving media narratives, it has become increasingly critical to not just extract narratives from a given corpus but rather investigate, how they develop over time. While popular narrative extraction methods such as Large Language Models do well in capturing typical narrative elements or even the complex structure of a narrative, applying them to an entire corpus comes with obstacles, such as a high financial or computational cost. We propose a combination of the language understanding capabilities of Large Language Models with the large scale applicability of topic models to dynamically model narrative shifts across time using the Narrative Policy Framework. We apply a topic model and a corresponding change point detection method to find changes that concern a specific topic of interest. Using this model, we filter our corpus for documents that are particularly representative of that change and feed them into a Large Language Model that interprets the change that happened in an automated fashion and distinguishes between content and narrative shifts. We employ our pipeline on a corpus of The Wall Street Journal news paper articles from 2009 to 2023. Our findings indicate that a Large Language Model can efficiently extract a narrative shift if one exists at a given point in time, but does not perform as well when having to decide whether a shift in content or a narrative shift took place.
Open AccessNarrative Shift Detection: A Hybrid Approach of Dynamic Topic Models and Large Language Models
With rapidly evolving media narratives, it has become increasingly critical to not just extract narratives from a given corpus but rather investigate, how they develop over time. While popular narrative extraction methods such as Large Language Models do well in capturing typical narrative elements or even the complex structure of a narrative, applying them to an entire corpus comes with obstacles, such as a high financial or computational cost. We propose a combination of the language understanding capabilities of Large Language Models with the large scale applicability of topic models to dynamically model narrative shifts across time using the Narrative Policy Framework. We apply a topic model and a corresponding change point detection method to find changes that concern a specific topic of interest. Using this model, we filter our corpus for documents that are particularly representative of that change and feed them into a Large Language Model that interprets the change that happened in an automated fashion and distinguishes between content and narrative shifts. We employ our pipeline on a corpus of The Wall Street Journal news paper articles from 2009 to 2023. Our findings indicate that a Large Language Model can efficiently extract a narrative shift if one exists at a given point in time, but does not perform as well when having to decide whether a shift in content or a narrative shift took place.
- Open Access
Zeitenwenden: Detecting changes in the German political discourse
From a monarchy to a democracy, to a dictatorship and back to a democracy -- the German political landscape has been constantly changing ever since the first German national state was formed in 1871. After World War II, the Federal Republic of Germany was formed in 1949. Since then every plenary session of the German Bundestag was logged and even has been digitized over the course of the last few years. We analyze these texts using a time series variant of the topic model LDA to investigate which events had a lasting effect on the political discourse and how the political topics changed over time. This allows us to detect changes in word frequency (and thus key discussion points) in political discourse.
Open AccessZeitenwenden: Detecting changes in the German political discourse
From a monarchy to a democracy, to a dictatorship and back to a democracy -- the German political landscape has been constantly changing ever since the first German national state was formed in 1871. After World War II, the Federal Republic of Germany was formed in 1949. Since then every plenary session of the German Bundestag was logged and even has been digitized over the course of the last few years. We analyze these texts using a time series variant of the topic model LDA to investigate which events had a lasting effect on the political discourse and how the political topics changed over time. This allows us to detect changes in word frequency (and thus key discussion points) in political discourse.
- Open Access
SpeakGer: A meta-data enriched speech corpus of German state and federal parliaments
The application of natural language processing on political texts as well as speeches has become increasingly relevant in political sciences due to the ability to analyze large text corpora which cannot be read by a single person. But such text corpora often lack critical meta information, detailing for instance the party, age or constituency of the speaker, that can be used to provide an analysis tailored to more fine-grained research questions. To enable researchers to answer such questions with quantitative approaches such as natural language processing, we provide the SpeakGer data set, consisting of German parliament debates from all 16 federal states of Germany as well as the German Bundestag from 1947-2023, split into a total of 10,806,105 speeches. This data set includes rich meta data in form of information on both reactions from the audience towards the speech as well as information about the speaker's party, their age, their constituency and their party's political alignment, which enables a deeper analysis. We further provide three exploratory analyses, detailing topic shares of different parties throughout time, a descriptive analysis of the development of the age of an average speaker as well as a sentiment analysis of speeches of different parties with regards to the COVID-19 pandemic.
Open AccessSpeakGer: A meta-data enriched speech corpus of German state and federal parliaments
The application of natural language processing on political texts as well as speeches has become increasingly relevant in political sciences due to the ability to analyze large text corpora which cannot be read by a single person. But such text corpora often lack critical meta information, detailing for instance the party, age or constituency of the speaker, that can be used to provide an analysis tailored to more fine-grained research questions. To enable researchers to answer such questions with quantitative approaches such as natural language processing, we provide the SpeakGer data set, consisting of German parliament debates from all 16 federal states of Germany as well as the German Bundestag from 1947-2023, split into a total of 10,806,105 speeches. This data set includes rich meta data in form of information on both reactions from the audience towards the speech as well as information about the speaker's party, their age, their constituency and their party's political alignment, which enables a deeper analysis. We further provide three exploratory analyses, detailing topic shares of different parties throughout time, a descriptive analysis of the development of the age of an average speaker as well as a sentiment analysis of speeches of different parties with regards to the COVID-19 pandemic.