EUVIMEDEUVIMED entdecken
Crossref

Learning Network-Structured Dependence From Non-Stationary Multivariate Point Process Data

Muhong Gao, Chunming Zhang, Jie Zhou

IEEE Transactions on Information Theory · 2024-08 · 70 (8) · 5935-5968

DOI: 10.1109/tit.2024.3396778 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2024-08. Verfasst von Muhong Gao und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 51 Literaturangaben. Gefördert von: China Postdoctoral Science Foundation, National Science Foundation, University of Wisconsin–Madison Office of the Vice Chancellor for Research and Graduate Education with funding from Wisconsin Alumni Research Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Learning the sparse network-structured dependence among nodes from multivariate point process data $\{{ {T}}_{i}\}_{i\in \mathcal {V} }$ has wide applications in information transmission, social science, and computational neuroscience. This paper develops new continuous-time stochastic models of the conditional intensity functions $\{\lambda _{i}(t | \mathscr {F} _{t}): t\ge 0\}_{i\in \mathcal {V} }$ , dependent on past event counts of parent nodes, to uncover the network structure within an array of non-stationary multivariate counting processes $\{\boldsymbol {N}(t): t\ge 0\}$ for $\{{ {T}}_{i}\}_{i\in \mathcal {V} }$ . The stochastic mechanism is crucial for statistical inference of graph parameters relevant to structure recovery but does not satisfy the key assumptions of commonly used processes like the Poisson process, Cox process, Hawkes process, queuing model, and piecewise deterministic Markov process. We introduce a new marked point process for intensity discontinuities, derive compact representations of their conditional distributions, and demonstrate the cyclicity property of ${N}(t)$ driven by recurrence time points. These new theoretical properties enable us to establish statistical consistency and convergence properties of the proposed penalized M-estimators for graph parameters under mild regularity conditions. Simulation evaluations demonstrate computational simplicity and increased estimation accuracy compared to existing methods. Real multiple neuron spike train recordings are analyzed to infer connectivity in neuronal networks.

Förderung

  • China Postdoctoral Science Foundation
  • National Science Foundation
  • University of Wisconsin–Madison Office of the Vice Chancellor for Research and Graduate Education with funding from Wisconsin Alumni Research Foundation
  • National Natural Science Foundation of China

Zitieren

APA

Gao, M., Zhang, C., & Zhou, J. (2024). Learning Network-Structured Dependence From Non-Stationary Multivariate Point Process Data. IEEE Transactions on Information Theory, 70(8), 5935-5968. https://doi.org/10.1109/tit.2024.3396778

Vancouver

Gao M, Zhang C, Zhou J. Learning Network-Structured Dependence From Non-Stationary Multivariate Point Process Data. IEEE Transactions on Information Theory. 2024;70(8):5935-5968. doi:10.1109/tit.2024.3396778

BibTeX
@article{Gao2024,
  author = {Gao, Muhong and Zhang, Chunming and Zhou, Jie},
  title = {Learning Network-Structured Dependence From Non-Stationary Multivariate Point Process Data},
  journal = {IEEE Transactions on Information Theory},
  year = {2024},
  volume = {70},
  number = {8},
  pages = {5935--5968},
  doi = {10.1109/tit.2024.3396778}
}
Kostenlos starten →