Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T18:02:29.567Z Has data issue: false hasContentIssue false

Hawkes processes with variable length memory and an infinite number of components

Published online by Cambridge University Press:  17 March 2017

Pierre Hodara*
Affiliation:
Université de Cergy-Pontoise
Eva Löcherbach*
Affiliation:
Université de Cergy-Pontoise
*
* Postal address: CNRS UMR 8088, Département de Mathématiques, Université de Cergy-Pontoise, 2 avenue Adolphe Chauvin, 95302 Cergy-Pontoise Cedex, France.
* Postal address: CNRS UMR 8088, Département de Mathématiques, Université de Cergy-Pontoise, 2 avenue Adolphe Chauvin, 95302 Cergy-Pontoise Cedex, France.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we propose a model for biological neural nets where the activity of the network is described by Hawkes processes having a variable length memory. The particularity in this paper is that we deal with an infinite number of components. We propose a graphical construction of the process and build, by means of a perfect simulation algorithm, a stationary version of the process. To implement this algorithm, we make use of a Kalikow-type decomposition technique. Two models are described in this paper. In the first model, we associate to each edge of the interaction graph a saturation threshold that controls the influence of a neuron on another. In the second model, we impose a structure on the interaction graph leading to a cascade of spike trains. Such structures, where neurons are divided into layers, can be found in the retina.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2017