activity
20212026
most citedAsymptotics for densities of exponential functionals of subordinators

5 citations · 5 across the 9 of their papers we have counts for

collaborators

9 papers

math.PR2026

Asymptotics for Beta-Splitting Trees via Homogeneous Fragmentations and Meromorphic Potential Theory

Yoana R. Chorbadzhiyska, Martin Minchev, Mladen Savov

Inspired by recent work of Aldous, Janson, and Pittel on the critical beta-splitting model, we study the full beta-splitting family for beta greater than minus two through a canoni…

math.PR2026

On a moment determinacy conjecture of Bertoin and Yor

Martin Minchev

Let be an unkilled real-valued Lévy process which drifts to and has positive exponential moments of all orders, and define , and its re…

math.PR2026

Preferential relocations enhance survival for Markov chains with killing

Jean Bertoin, Martin Minchev

We investigate the impact on survival of a modification of the evolution of a sub-stochastic Markov chain that involves random relocations at previously visited states. Our central…

math.PR2025

Recent developments in exponential functionals of Lévy processes

Martin Minchev, Mladen Savov

This survey aims to review two decades of progress on exponential functionals of (possibly killed) real-valued Lévy processes. Since the publication of the seminal survey by Bertoi…

math.PR2025

On the probability of n equidistant points in high-dimensional lattices

Stefan Gerdjikov, Martin Minchev, Mladen Savov

Consider -dimensional vectors with iid entries from a lattice distribution . We show that the probability that all distances between them are equal is asymptotically \[ C…

math.PR2024

Multi-type branching processes with immigration generated by point processes

Martin Minchev, Maroussia Slavtchova-Bojkova

Following the pivotal work of Sevastyanov, who considered branching processes with homogeneous Poisson immigration, much has been done to understand the behaviour of such processes…

cs.DS2024

BFS versus DFS for fixed-level targets in ordered trees

Stoyan Dimitrov, Martin Minchev, Yan Zhuang

We find the average time complexity of the breadth-first search (BFS) and the depth-first search (DFS) algorithms, when one searches for a target node selected uniformly at random…

math.PR2023

Bivariate Bernstein-gamma functions, potential measures, and asymptotics of exponential functionals of Lévy processes

Martin Minchev, Mladen Savov

Let be a Lévy process and , be the exponential functional of Lévy processes on deterministic horizon. Given that $\lim_{t\to…

math.PR2021★ 5 cited

Asymptotics for densities of exponential functionals of subordinators

Martin Minchev, Mladen Savov

In this paper we derive non-classical Tauberian asymptotic at infinity for the tail, the density and the derivatives thereof of a large class of exponential functionals of subordin…