SearcharxivSearch

arXiv · 2401.11457

A Generalization of Bivariate Lack-of-Memory Properties

Abstract

In this paper, we propose an extension of the standard strong and weak lack-of-memory properties. We say that the survival function $\bar{F}$ of the vector $(X,Y)$ satisfies pseudo lack-of-memory property in strong version if \begin{equation} \label{strong}\bar F_{X,Y}(s_1+t_1,s_2+t_2)=\bar F_{X,Y}(s_1,s_2)\otimes_h\bar F_{X,Y}(t_1,t_2), \ t_1,t_2,s_1,s_2 \geq 0 \end{equation} and in weak version if \begin{equation}\label{weak}\bar F_{X,Y}(s_1+t,s_2+t)=\bar F_{X,Y}(s_1,s_2)\otimes_h\bar F_{X,Y}(t,t), \ s_1,s_2,t \geq 0\end{equation} with $a\otimes_hb=h\left (h^{-1}(a)\cdot h^{-1}(b)\right )$, where $h$ is an increasing bijection of $[0,1]$, called generator. After finding sufficient conditions under which the solutions of the above functional equations are bivariate survival functions, we focus on distributions satisfying the latter: we study specific properties in comparison with standard lack-of-memory property and we give a characterization in terms of the random variables $\min(X,Y)$ and $ X -Y$. Finally, we investigate the induced dependence structure, determining their singularity in full generality and studying the upper and lower dependence coefficients for some specific choices of the marginal survival functions and of the generator $h$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Massimo Ricci. 2024-01-21. A Generalization of Bivariate Lack-of-Memory Properties. https://arxiv.org/abs/2401.11457

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