Searcharxiv⌕ Search

arXiv subjects

Zbigniew Palmowski

Publications and source records attributed to Zbigniew Palmowski.

At least 19 recordsLinked to original sources

Steady-state of Lévy process with general resetting: unreflected and reflected cases

We study (unreflected and reflected) Lévy processes that are modified at independent Poisson review epochs by a random state-dependent reset map. The first model is unreflected: between resettings the level evolves as a Lévy process, and at a resetting epoch the new level is $F$ of the level seen just before the resetting. The second model is the reflected Lévy process at $0$, but with reset maps chosen from a wider transform-solvable class. In this work, we give contraction-type ergodicity criteria for the existence of the steady-state. We identify this steady-state of the system as the solution of certain stochastic fixed-point equation. This allows to find the Laplace-transform, moments recursions, and regularly-varying-tail formulae. For non-reflected case, the examples include affine deterministic resets $F(x)=cx+b$, random-coefficient resets $F(x)=Cx+b$ with two-point $C$ for the finite-activity Lévy process, spectrally positive Lévy flight, reflected Brownian process. For the reflected cased we analyse affine resetting mechanism $F(x)=cx$, the alternating resetting $F(x)=(B-x)^+$, and uniform proportional resetting $F(x)=Cx$ with $C$ having uniform distribution.

math.PR↗

Optimal Dividends and Voluntary Liquidation under Omega-Type Regulatory Termination

We study a joint optimal dividend and voluntary liquidation problem for a company whose surplus follows a spectrally negative Lévy process and is subject to Omega-type regulatory termination. Dividend payments are modeled as a singular control, while voluntary liquidation is an optimal stopping decision with a state-dependent liquidation payoff. When the surplus falls below a regulatory solvency threshold, an Omega clock accumulates the time spent in distress and may terminate the firm before voluntary liquidation occurs. Under dynamic programming and continuity assumptions for an auxiliary Markov subproblem, we characterize its value as the smallest controlled stochastic supersolution of the associated quasi-variational inequality. We prove that any regular stochastic solution with a dividend barrier coincides with the value function over all admissible dividend and liquidation policies, and hence is unique within this class. Using $ω$-scale functions, we construct single-band, singleton, and no-liquidation candidates, establish sufficient conditions for global optimality, and give conditions under which these candidates supply the unique regular barrier stochastic solution. Brownian and Cramér--Lundberg examples illustrate how regulatory parameters affect dividend and liquidation boundaries and generate transitions between policy regimes.

math.OC↗

Asymptotic behaviour for escaping an interval by Lévy flights under stochastic resetting

The resetting of stochastic processes has become a key mechanism appearing in many research fields, such as searching for a target, the transmission control protocol, biology, chemistry, finance, insurance, etc., with the main interest concerning the first passage time (FPT) by the process under resetting. In this paper, we focus on the exit time $\mathcal{T}_L$ from the interval $(-L, L)$ of Lévy flights (LF) under resetting, but we also consider spectrally negative Lévy processes (SNLP). As the main result, we find the asymptotics of the mean first passage time (MFPT) as $L$ tends to $+ \infty$. For LF with $α\in (0, 2)$, the scaling behaves as $L^α$ regardless of the reset rate and the asymmetry of the initial condition, a behaviour completely different from that for the known case of Brownian Motion ($α=2$). For the symmetric $α$-stable case with $α\in (0, 2)$, we also found that taking $r \to \infty$ with fixed $L$ yields a finite MFPT, which therefore may be used as a valid approximation. For completely asymmetric stable processes, we show that the scaling is very different from that for LF, and point out a method to obtain the exact distribution of FPT under resetting. The analytical calculations are verified by numerical simulations of the processes under resetting.

math.PR↗

Moments of polynomial processes under affine resetting

We consider polynomial processes, i.e., continuous-time Markov processes that preserve polynomials without increasing degree, and augment them with resetting. Resetting means that at the jump times of an indepen- dent renewal process, the polynomial process is instantaneously reset to a new state, which can be chosen deterministically, randomly or in state-dependent fashion. We show that under certain types of resets ('affine resetting') the moments of the resulting process remain tractable and can be calculated by matrix exponentials (for Poissonian reset times) or by a matrix renewal equa- tion (for more general reset times). Our framework encompasses many models that have been considered in the existing literature, such as growth-collapse processes with deterministic growth or with Lévy inflow, and Brownian motion with resets to the origin, to a fixed distribution or by multiplying by a fixed proportion.

math.PR↗

Exit problems for additive-increase and multiplicative-decrease Markov-modulated processes

We study one-sided, two-sided and reflected exit problems for a finite-state Markov-modulated additive-increase and multiplicative-decrease process. For upward passage, a first-jump decomposition and a spatial Laplace transform lead to a recursion indexed by finite words of phases and to a convergent Green series. For downward passage, the first-jump operator is a strict contraction and the known contribution from $[p_i b,b]$ becomes an explicit boundary forcing term in the same spatial recursion. These allow to derive the corresponding Green representation of the first passage matrix and its finite-dimensional compatibility condition. The derivation of the two-sided exit identity is based on the Markov property, which in this context is equivalent to the cocycle property of the Laplace transform, together with the recursive equation at the upper level. For reflection at the running infimum, a finite $\bar p$-geometric method of steps realizes a certain Picard map that allows to find the exit matrix. As a result, we construct a Doob martingale related to the first passage time of the reflected Markov-modulated AIMD.

math.PR↗

Lévy processes with partially stochastic resetting

In this paper, we solve exit problems for a Lévy process that resets proportionally to its current position at independent Poisson epochs times. This resetting causes an additional (proportional to its current level) downward (upward) jump when the current position of the process is on the positive (negative) domain. Such a process can be expressed as an SDE, whose existence and uniqueness it discussed. All identities are given in terms of new family of scale functions. To obtain the new family of scale functions, we reduce the problem of the LT of the exit times into integral equations that are solve in terms of resolvent series.

math.PR↗

Sensitivity analysis of Stochastic Fluid Models: Stationary and transient quantities with applications

We establish results for the first sensitivity analysis of the stochastic fluid models (SFMs). We derive expressions for the sensitivity analysis of the key stationary and transient (time-dependent) quantities of this class of models. We also construct numerical examples to demonstrate the application potential of our methodology in queueing systems, such as deteriorating systems and insurance risk processes. This work forms foundation for the sensitivity analysis of other Markovian modulated models, which are generalisations of the SFMs, and have widespread applications.

math.PR↗

Hitting the blinking target under stochastic resetting

The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the standard setup by allowing the target to spontaneously switch between two states, either active or inactive, and investigate the distribution of first hitting times accrued while the target is active. For this setup, we provide closed formulas for the distribution of the first hitting time. Additionally, we can introduce stochastic resetting to the underlying process and, utilizing our results, derive the formulas for the first time the active target is hit by the process under stochastic resetting. Interestingly, we show that resetting in this setup still leaves some memory; the system is no longer Markovian, which prevents a straightforward application of standard techniques. The analytical results are accompanied by computer simulations of Langevin dynamics.

cond-mat.stat-mech↗

Early predicting of hospital admission using machine learning algorithms: Priority queues approach

Emergency Department overcrowding is a critical issue that compromises patient safety and operational efficiency, necessitating accurate demand forecasting for effective resource allocation. This study evaluates and compares three distinct predictive models: Seasonal AutoRegressive Integrated Moving Average with eXogenous regressors (SARIMAX), EXtreme Gradient Boosting (XGBoost) and Long Short-Term Memory (LSTM) networks for forecasting daily ED arrivals over a seven-day horizon. Utilizing data from an Australian tertiary referral hospital spanning January 2017 to December 2021, this research distinguishes itself by decomposing demand into eight specific ward categories and stratifying patients by clinical complexity. To address data distortions caused by the COVID-19 pandemic, the study employs the Prophet model to generate synthetic counterfactual values for the anomalous period. Experimental results demonstrate that all three proposed models consistently outperform a seasonal naive baseline. XGBoost demonstrated the highest accuracy for predicting total daily admissions with a Mean Absolute Error of 6.63, while the statistical SARIMAX model proved marginally superior for forecasting major complexity cases with an MAE of 3.77. The study concludes that while these techniques successfully reproduce regular day-to-day patterns, they share a common limitation in underestimating sudden, infrequent surges in patient volume.

cs.LG↗

Pricing American Options Time-Capped by a Drawdown Event

This paper presents a derivation of the explicit price for the perpetual American put option in the Black-Scholes model, time-capped by the first drawdown epoch beyond a predefined level. We demonstrate that the optimal exercise strategy involves executing the option when the asset price first falls below a specified threshold. The proof relies on martingale arguments and the fluctuation theory of Lévy processes. To complement the theoretical findings, we provide numerical analysis.

q-fin.MF↗

Pricing American options time-capped by a drawdown event in a Lévy market

This paper presents a derivation of the explicit price for the perpetual American put option time-capped by the first drawdown epoch beyond a predefined level. We consider the market in which an asset price is described by geometric Lévy process with downward exponential jumps. We show that the optimal stopping rule is the first time when the asset price gets below a special value. The proof relies on martingale arguments and the fluctuation theory of Lévy processes. We also provide a numerical analysis.

math.PR↗

Finite-Time Ruin for the Compound Markov Binomial Risk Model

In this paper, we study finite-time ruin probabilities for the compound Markov binomial risk model - a discrete-time model where claim sizes are modulated by a finite-state ergodic Markov chain. In the classic (non-modulated) case, the risk process has interchangeable increments and consequently, its finite-time ruin probability can be obtained in terms of Takács' famous Ballot Theorem results. Unfortunately, due to the dependency of our process on the state(s) of the modulating chain these do not necessarily extend to the modulated setting. We show that a general form of the Ballot Theorem remains valid under the stationary distribution of the modulating chain, yielding a Takács-type expression for the finite-time ruin probability which holds only when the initial surplus is equal to zero. For the case of arbitrary initial surplus, we develop an approach based on multivariate Lagrangian inversion, from which we derive distributional results for various hitting times of the risk process, including a Seal-type formula for the finite-time ruin probability.

math.PR↗

Fluctuations of Omega-killed level-dependent spectrally negative Lévy processes

In this paper, we solve exit problems for a level-dependent Lévy process which is exponentially killed with a killing intensity that depends on the present state of the process. Moreover, we analyse the respective resolvents. All identities are given in terms of new generalisations of scale functions (counterparts of the scale function from the theory of Lévy processes), which are solutions of Volterra integral equations. Furthermore, we obtain similar results for the reflected level-dependent Lévy processes. The existence of the solution of the stochastic differential equation for reflected level-dependent Lévy processes is also discussed. Finally, to illustrate our result, the probability of bankruptcy is obtained for an insurance risk process.

math.PR↗

Pricing time-capped American options using Least Squares Monte Carlo method

In this paper, we adopt the least squares Monte Carlo (LSMC) method to price time-capped American options. The aforementioned cap can be an independent random variable or dependent on asset price at random time. We allow various time caps. In particular, we give an algorithm for pricing the American options capped by the first drawdown epoch. We focus on the geometric Lévy market. We prove that our estimator converges to the true price as one takes the discretisation step tending to zero and the number of trajectories going to infinity.

q-fin.MF↗

Partial versus total resetting for Lévy flights in d dimensions: similarities and discrepancies

While stochastic resetting (or total resetting) is less young and more established concept in stochastic processes, partial stochastic resetting (PSR) is a relatively new field. PSR means that, at random moments in time, a stochastic process gets multiplied by a factor between 0 and 1, thus approaching but not reaching the resetting position. In this paper, we present new results on PSR highlighting the main similarities and discrepancies with total resetting. Specifically, we consider both symmetric $α$-stable Lévy processes (Lévy flights) and Brownian motion with PSR in arbitrary d dimensions. We derive explicit expressions for the propagator and its stationary measure, and discuss in detail their asymptotic behavior. Interestingly, while approaching to stationarity, a dynamical phase transition occurs for the Brownian motion, but not for Lévy flights. We also analyze the behavior of the process around the resetting position and find significant differences between PSR and total resetting.

cond-mat.stat-mech↗

Stationary states for stable processes with partial resetting

We study a $d$-dimensional stochastic process $\mathbf{X}$ which arises from a Lévy process $\mathbf{Y}$ by partial resetting, that is the position of the process $\mathbf{X}$ at a Poisson moment equals $c$ times its position right before the moment, and it develops as $\mathbf{Y}$ between these two consecutive moments, $c \in (0, 1)$. We focus on $\mathbf{Y}$ being a strictly $α$-stable process with $α\in (0,2]$ having a transition density: We analyze properties of the transition density $p$ of the process $\mathbf{X}$. We establish a series representation of $p$. We prove its convergence as time goes to infinity (ergodicity), and we show that the limit $ρ_{\mathbf{Y}}$ (density of the ergodic measure) can be expressed by means of the transition density of the process $\mathbf{Y}$ starting from zero, which results in closed concise formulae for its moments. We show that the process $\mathbf{X}$ reaches a non-equilibrium stationary state. Furthermore, we check that $p$ satisfies the Fokker--Planck equation, and we confirm the harmonicity of $ρ_{\mathbf{Y}}$ with respect to the adjoint generator. In detail, we discuss the following cases: Brownian motion, isotropic and $d$-cylindrical $α$-stable processes for $α\in (0,2)$, and $α$-stable subordinator for $α\in (0,1)$. We find the asymptotic behavior of $p(t;x,y)$ as $t\to +\infty$ while $(t,y)$ stays in a certain space-time region. For Brownian motion, we discover a phase transition, that is a change of the asymptotic behavior of $p(t;0,y)$ with respect to $ρ_{\mathbf{Y}}(y)$.

math.PR↗

Maxima over random time intervals for heavy-tailed compound renewal and Lévy processes

We derive subexponential tail asymptotics for the distribution of the maximum of a compound renewal process with linear component and of a Lévy process, both with negative drift, over random time horizon $τ$ that does not depend on the future increments of the process. Our asymptotic results are uniform over the whole class of such random times. Particular examples are given by stopping times and by $τ$ independent of the processes. We link our results with random walk theory.

math.PR↗

Stable random walks in cones

In this paper we consider a multidimensional random walk killed on leaving a right circular cone with a distribution of increments belonging to the normal domain of attraction of an $α$-stable and rotationally-invariant law with $α\in (0,2)\setminus \{1\}$. Based on Bogdan et al. (2018) describing the tail behaviour of the exit time of $α$-stable process from a cone and using some properties of Martin kernel of the isotropic $α$-stable process, in this paper we construct a positive harmonic function of the discrete time random walk under consideration. Then we find the asymptotic tail of the distribution of the exit time of this random walk from the cone. We also prove the corresponding conditional functional limit theorem.

math.PR↗