New splitting-scheme-based pseudo-likelihood estimators for SDEs with Hölder multiplicative noise that achieve strong convergence, state-space preservation, consistency, and asymptotic normality.
Undecidability of state comp lexity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
citing papers explorer
-
Splitting schemes and estimators for stochastic differential equations with H\"older multiplicative noise
New splitting-scheme-based pseudo-likelihood estimators for SDEs with Hölder multiplicative noise that achieve strong convergence, state-space preservation, consistency, and asymptotic normality.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.