SearcharxivSearch

arXiv · 2506.07094

CIR bridge for modeling of fish migration on sub-hourly scale

Abstract

Bridges, which are stochastic processes with pinned initial and terminal conditions, have recently been applied to various problems. We show that a bridge based on the Cox-Ingersoll-Ross process, called a CIR bridge in this paper, reasonably models the intraday number of migrating fish at an observation point in a river. The studied fish migrates between sunrise and sunset each day, which are considered the initial and terminal times, respectively. The CIR bridge is well-defined as a unique pathwise continuous solution to a stochastic differential equation with unbounded drift and diffusion coefficients and potentially represents the on-off intermittency of the fish count data. Our bridge is theoretically novel in that it admits closed-form time-dependent averages and variances, with which the model parameters can be identified efficiently, and is computable by a recently-developed one-step numerical method. The CIR bridge is applied to the sub-hourly migration data of the diadromous fish Plecoglossus altivelis altivelis in the Nagara River, Japan, from February to June.

Explore related subjects

Keep this discovery

BibTeXRIS

Hidekazu Yoshioka. 2025-06-08. CIR bridge for modeling of fish migration on sub-hourly scale. https://doi.org/10.1016/j.chaos.2025.116874

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