SearcharxivSearch

arXiv · 2508.01891

Time multidimensional Markov Renewal chains -- An algebraic approach

Abstract

In this study, a new extension of the Markov Renewal theory is introduced by allowing time to evolve in multiple dimensions. The resulting chains are referred to as multi-time Markov Renewal chains and since this extension is new, the state space is assumed to be finite to cover the theoretical framework of applications, where the possible number of states of a physical system is finite. The flexibility of Markov renewal theory is still present in multiple time dimensions by allowing the sojourn times in the different states of the system to be arbitrarily selected from a multidimensional distribution. The convolution product of multidimensional matrix sequences plays a particular role in the development of the theory and some of its algebraic properties are given and explored, paying particular attention to the existence, the representation and the computation of the convolutional inverse. Some basic definitions and properties of this new class are given as well as the multi-time Markov renewal equations associated to the resulting processes. The practical implementation is achieved very efficiently through a novel adaptation of the Gauss-Jordan algorithm for multidimensional matrix sequences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonidas Kordalis, Samis Trevezas. 2025-08-03. Time multidimensional Markov Renewal chains -- An algebraic approach. https://arxiv.org/abs/2508.01891

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