Metraipolis › archive › dc_8f429fef9eba

Network inference for SDEs with diverging dimension under small noise — arXiv:2610.04847

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.04847
License (as archived)
CC0-1.0
Archived
2026-10-06T13:39:55.704Z
SHA-256 of the archived text
c6eb6c68bb399168f4e5b76ac76fdb3a5a6a2d6ac85b87bdf07ece698db67962
Stable URL of this page
https://metraipolis.com/documento/dc_8f429fef9eba

How to cite

Network inference for SDEs with diverging dimension under small noise — arXiv:2610.04847 — arXiv (en), https://arxiv.org/abs/2610.04847 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8f429fef9eba (Metraipolis archive dc_8f429fef9eba, sha256 c6eb6c68bb399168f4e5b76ac76fdb3a5a6a2d6ac85b87bdf07ece698db67962)
BibTeX
@misc{dc8f429fef9eba,
  title = {Network inference for SDEs with diverging dimension under small noise — arXiv:2610.04847},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.04847},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8f429fef9eba; sha256 c6eb6c68bb399168f4e5b76ac76fdb3a5a6a2d6ac85b87bdf07ece698db67962},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04847. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider inference for network stochastic differential equations in a small-noise, high-dimensional regime, where the diffusion coefficient vanishes with $\ep\to0$ while the network size and parameter dimension may diverge. We develop a minimum-distance estimation framework based on a deterministic measurement model that may omit nuisance terms in the drift, and derive a non-asymptotic error bound decomposing the estimation error into stochastic fluctuation, nuisance discrepancy, and identifiability terms. For a linearly parametrized interaction model under repeated measurements, we obtain explicit non-asymptotic bounds on the nuisance discrepancy and the identifiability gap in terms of graph connectivity and noise level. Under suitable mixing and balance conditions, this yields consistency and convergence rates for the estimator. We further study graph recovery via adaptive Lasso. The penalized estimator is shown to inherit the rate of the preliminary estimator and to recover the true interaction graph consistently. These results provide a theoretical basis for parameter estimation and edge selection in high-dimensional network SDEs with nuisance drift components.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2610.04847 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:56:32.027Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).