SearcharxivSearch

arXiv · 2411.12272

Superposition of interacting stochastic processes with memory and its application to migrating fish counts

Abstract

Stochastic processes with long memories, known as long memory processes, are ubiquitous in various science and engineering problems. Superposing Markovian stochastic processes generates a non-Markovian long memory process serving as powerful tools in several research fields, including physics, mathematical economics, and environmental engineering. We formulate two novel mathematical models of long memory process based on a superposition of interacting processes driven by jumps. The mutual excitation among the processes to be superposed is assumed to be of the mean field or aggregation form, where the former yields a more analytically tractable model. The statistics of the proposed long memory processes are investigated using their moment-generating function, autocorrelation, and associated generalized Riccati equations. Finally, the proposed models are applied to time series data of migrating fish counts at river observation points. The results of this study suggest that an exponential memory or a long memory model is insufficient; however, a unified method that can cover both is necessary to analyze fish migration, and our model is exactly the case.

Explore related subjects

Keep this discovery

BibTeXRIS

Hidekazu Yoshioka. 2024-11-19. Superposition of interacting stochastic processes with memory and its application to migrating fish counts. https://doi.org/10.1016/j.chaos.2024.115911

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR