Victor Rivero

Victor Rivero

Auto-generated profile, based on publicly available information

Victor Rivero

Centro de Investigación en Matemáticas, Guanajuato, México

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 July 2020 in Transactions of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
AKAndreas Kyprianou
Andreas Kyprianou
VRVictor Rivero
Victor Rivero
BŞBatı Şengül
Batı Şengül
TYTing Yang
Ting Yang
In this paper we consider the problem of finding entrance laws at the origin for self-similar Markov processes in R d \mathbb {R}^d , killed upon hitting the origin. Under suitable assumptions, we show the existence of an entrance law and the convergence to this law when the process is started close to the origin. We obtain an explicit description of the process started from the origin as the time reversal of the original self-similar Markov process conditioned to hit the origin.

1 September 2012 in Probability Theory and Related Fields
Verified
Journal Article
Closed access
PDF file
RDR. A. Doney
R. A. Doney
VRV. Rivero
V. Rivero

12 July 2019 in Potential Analysis
Verified
Journal Article
Closed access
PDF file
HPH. Pantí
H. Pantí
JPJ. C. Pardo
J. C. Pardo
VRV. M. Rivero
V. M. Rivero

19 January 2026 in Queueing Systems
Verified
Journal Article
Open access
PDF file
AKA. E. Kyprianou
A. E. Kyprianou
VRV. Rivero
V. Rivero
In this note, we revisit the fundamental question of the strong law of large numbers and central limit theorem for processes in continuous time with conditional stationary and independent increments. For convenience, we refer to them as Markov additive processes, or MAPs for short. Historically used in the setting of queuing theory, MAPs have often been written about when the underlying modulating process is an ergodic Markov chain on a finite state space, cf. (Asmussen in Applied probability and queues, Springer-Verlag, New York, 2003; Asmussen and Albrecher in Ruin probabilities, Hackensack, 2010), not to mention the classical contributions of Pacheco and Prabhu (Markov additive processes of arrivals, CRC, Boca Raton, 1995), Prabhu (Stochastic storage processes, Springer-Verlag, New York, 1998). Recent works have addressed the strong law of large numbers when the underlying modulating process is a general Markov processes; cf. as reported (Kyprianou et al. Entrance laws at the origin of self-similar Markov processes in high dimensions, 2019; Yaran and Çağlar in ALEA Lat Am J Probab Math Stat 22:991–1010, 2025) . We add to the latter with a different approach based on an ergodic theorem for additive functionals and on the semimartingale structure of the additive part. This approach also allows us to deal with the setting that the modulator of the MAP is either positive or null-recurrent. The methodology additionally inspires a CLT-type result.

1 January 2024 in Electronic Journal of Probability
Verified
Journal Article
Open access
PDF file
AKA. E. Kyprianou
A. E. Kyprianou
MMM. Motala
M. Motala
VRV. Rivero
V. Rivero
The classical result of Williams [27] states that a Brownian motion with positive drift μ and issued from the origin is equal in law to a Brownian motion with unit negative drift, −μ, run until it hits a negative threshold, whose depth below the origin is independently and exponentially distributed with parameter 2μ, after which it behaves like a Brownian motion conditioned never to go below the aforesaid threshold (i.e. a Bessel-3 process, or equivalently a Brownian motion conditioned to stay positive, relative to the threshold). In this article we consider the analogue of Williams’ path decomposition for a general self-similar Markov process (ssMp) on Rd. Roughly speaking, we will prove that the law of a ssMp, say X, in Rd is equivalent in law to the concatenation of paths described as follows: suppose that we sample the point x∗ according to the law of the point of closest reach to the origin; given x∗, we build X↓ having the law of X conditioned to hit x∗ continuously without entering the ball of radius |x∗|; then, we construct X↑ to have the law of X issued from x∗ conditioned never to enter the ball of radius |x∗|; glueing the path of X↑ end-to-end with X↓ via the point x∗ produces a process which is equal in law to our original ssMp X. In essence, Williams’ path decomposition in the setting of a ssMp follows directly from an analogous decomposition for Markov additive processes (MAPs). The latter class are intimately related to the former via a space-time transform known as the Lamperti–Kiu transform. As a key feature of our proof of Williams’ path decomposition, will prove the analogue of Silverstein’s duality identity for the excursion occupation measure, cf. [26], for general Markov additive processes (MAPs).

30 September 2015 in Probability Theory and Related Fields
Verified
Journal Article
Closed access
PDF file
RDR. A. Doney
R. A. Doney
VRV. Rivero
V. Rivero