Pith. Sign in

RECORD

Parametric estimation for the standard and geometric telegraph process observed at discrete times

Statistics Theory · Submitted 25 Jul 2006

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We propose different estimators of the parameters and we investigate their performance under the high frequency asymptotics, i.e. $\Delta_n \to 0$, $n\Delta = T<\infty$ as $n \to \infty$, with $T>0$ fixed.

how it is stated · asserted 0.92 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDmath/0607633 (version 1)
Pith IDECMFIGQS, Pith's permanent record of this paper and its review
CitationAlessandro De Gregorio, Stefano M. Iacus. "Parametric estimation for the standard and geometric telegraph process observed at discrete times." arXiv:math/0607633 (2006). https://pith.science/paper/ECMFIGQS
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,814 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.96 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.08 · compares with prior results 0.09 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

The telegraph process $X(t)$, $t>0$, (Goldstein, 1951) and the geometric telegraph process $S(t) = s_0 \exp\{(\mu -\frac12\sigma^2)t + \sigma X(t)\}$ with $\mu$ a known constant and $\sigma>0$ a parameter are supposed to be observed at $n+1$ equidistant time points $t_i=i\Delta_n,i=0,1,..., n$. For both models $\lambda$, the underlying rate of the Poisson process, is a parameter to be estimated. In the geometric case, also $\sigma>0$ has to be estimated. We propose different estimators of the parameters and we investigate their performance under the high frequency asymptotics, i.e. $\Delta_n \to 0$, $n\Delta = T<\infty$ as $n \to \infty$, with $T>0$ fixed. The process $X(t)$ in non markovian, non stationary and not ergodic thus we use approximation arguments to derive estimators. Given the complexity of the equations involved only estimators on the first model can be studied analytically. Therefore, we run an extensive Monte Carlo analysis to study the performance of the proposed estimators also for small sample size $n$.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 The telegraph process $X(t)$, $t>0$, (Goldstein, 1951) and the geometric telegraph process $S(t) = s_0 \exp\{(\mu -\frac12\sigma^2)t + \sigma X(t)\}$ with $\mu$ a known constant and $\sigma>0$ a parameter are supposed to be observed at $n+1$ equidistant time points $t_i=i\Delta_n,i=0,1,..., n$. background 0.80 0.14 0.02 asserted 0.90
s1 For both models $\lambda$, the underlying rate of the Poisson process, is a parameter to be estimated. background 0.79 0.17 0.04 asserted 1.00
s2 In the geometric case, also $\sigma>0$ has to be estimated. background 0.74 0.20 0.03 asserted 1.00
s3 We propose different estimators of the parameters and we investigate their performance under the high frequency asymptotics, i.e. $\Delta_n \to 0$, $n\Delta = T<\infty$ as $n \to \infty$, with $T>0$ fixed. contribution 0.70 0.88 0.10 asserted 0.92
s4 The process $X(t)$ in non markovian, non stationary and not ergodic thus we use approximation arguments to derive estimators. method 0.79 0.43 0.04 asserted 1.00
s5 Given the complexity of the equations involved only estimators on the first model can be studied analytically. limitation 0.99 0.49 0.05 asserted 1.00
s6 Therefore, we run an extensive Monte Carlo analysis to study the performance of the proposed estimators also for small sample size $n$. method 0.83 0.95 0.09 asserted 0.98

What kind of paper the classifier reports this is: method or tool 0.80 · evidence from simulation or computation 0.88.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

The telegraph process $X(t)$, $t>0$, (Goldstein, 1951) and the geometric telegraph process $S(t) = s_0 \exp\{(\mu -\frac12\sigma^2)t + \sigma X(t)\}$ with $\mu$ a known constant and $\sigma>0$ a parameter are supposed to be observed at $n+1$ equidistant time points $t_i=i\Delta_n,i=0,1,..., n$. For both models $\lambda$, the underlying rate of the Poisson process, is a parameter to be estimated. In the geometric case, also $\sigma>0$ has to be estimated. We propose different estimators of the parameters and we investigate their performance under the high frequency asymptotics, i.e. $\Delta_n \to 0$, $n\Delta = T<\infty$ as $n \to \infty$, with $T>0$ fixed. The process $X(t)$ in non markovian, non stationary and not ergodic thus we use approximation arguments to derive estimators. Given the complexity of the equations involved only estimators on the first model can be studied analytically. Therefore, we run an extensive Monte Carlo analysis to study the performance of the proposed estimators also for small sample size $n$.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.