Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2103.02990

Help | Advanced Search

Physics > Data Analysis, Statistics and Probability

arXiv:2103.02990 (physics)
[Submitted on 4 Mar 2021 ]

Title: Non-parametric estimation of a Langevin model driven by correlated noise

Title: 由相关噪声驱动的Langevin模型的非参数估计

Authors:Clemens Willers, Oliver Kamps
Abstract: Langevin models are frequently used to model various stochastic processes in different fields of natural and social sciences. They are adapted to measured data by estimation techniques such as maximum likelihood estimation, Markov chain Monte Carlo methods, or the non-parametric direct estimation method introduced by Friedrich et al. The latter has the distinction of being very effective in the context of large data sets. Due to their $\delta$-correlated noise, standard Langevin models are limited to Markovian dynamics. A non-Markovian Langevin model can be formulated by introducing a hidden component that realizes correlated noise. For the estimation of such a partially observed diffusion a different version of the direct estimation method was introduced by Lehle et al. However, this procedure includes the limitation that the correlation length of the noise component is small compared to that of the measured component. In this work we propose another version of the direct estimation method that does not include this restriction. Via this method it is possible to deal with large data sets of a wider range of examples in an effective way. We discuss the abilities of the proposed procedure using several synthetic examples.
Abstract: Langevin模型常用于不同自然科学和社会科学领域的各种随机过程建模。 它们通过最大似然估计、马尔可夫链蒙特卡洛方法或Friedrich等人引入的非参数直接估计方法等估计技术来适应测量数据。 后者在大规模数据集的背景下表现出极高的有效性。 由于其$\delta$相关的噪声,标准Langevin模型仅限于马尔可夫动力学。 通过引入一个实现相关噪声的隐藏组件,可以构建非马尔可夫Langevin模型。 对于此类部分观测扩散的估计,Lehle等人引入了直接估计方法的一种不同版本。 然而,此过程存在一个限制,即噪声成分的相关长度相比测量成分的相关长度较小。 在本工作中,我们提出了一种不包含此限制的直接估计方法的另一种版本。 通过这种方法,可以有效地处理更广泛范围内的大型数据集。 我们使用多个合成示例讨论了所提出方法的能力。
Subjects: Data Analysis, Statistics and Probability (physics.data-an)
Cite as: arXiv:2103.02990 [physics.data-an]
  (or arXiv:2103.02990v1 [physics.data-an] for this version)
  https://doi.org/10.48550/arXiv.2103.02990
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1140/epjb/s10051-021-00149-0
DOI(s) linking to related resources

Submission history

From: Clemens Willers [view email]
[v1] Thu, 4 Mar 2021 12:31:20 UTC (727 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
physics.data-an
< prev   |   next >
new | recent | 2021-03
Change to browse by:
physics

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号