arXiv subjects

Vladimír Švígler

Publications and source records attributed to Vladimír Švígler.

10 recordsLinked to original sources

arXiv2026

Optimal allocation in combat models with multiple battlefields

We study the allocation of a force of a fixed size across independent battlefields against a known distribution of opposing forces. Formulating battlefield outcomes through loss and survival functions allows us to establish allocation results without assuming a specific system of combat equations. For convex enemy loss functions, an optimal allocation exists with at most one partially saturated battlefield. We prove NP-hardness for every prescribed family of strictly convex, strictly increasing loss functions satisfying an endpoint normalization, and give an exact pseudopolynomial algorithm for the special case when the total force size and saturation thresholds are integers. We also derive allocation rules for maximizing successful engagements, maximizing own survivors, and maximizing the ratio of enemy losses to own losses. Applications include a power-law family containing the classical Lanchester, guerrilla, and mixed combat models, as well as models with implicitly defined outcomes.

math.OC↗

arXiv2024

Perfect stationary solutions of reaction-diffusion equations on lattices and regular graphs

Reaction-diffusion equations on infinite graphs can have an infinite number of stationary solutions. These solutions are generally described as roots of a countable system of algebraic equations. As a generalization of periodic stationary solutions we present perfect stationary solutions, a special class of solutions with finite range in which the neighborhood values are determined precisely by the value of the central vertex. The focus on the solutions which attain a finite number of values enables us to rewrite the countable algebraic system to a finite one. In this work, we define the notion of perfect stationary solutions and show its elementary properties. We further present results from the theory of perfect colorings in order to prove the existence of the solutions in the square, triangular and hexagonal grids; as a byproduct, the existence of uncountable number of two-valued stationary solutions on these grids is shown. These two-valued solutions can form highly aperiodic and highly irregular patterns. Finally, an application to a bistable reaction-diffusion equation on a square grid is presented.

math.DS↗

arXiv2023

Monotone iteration scheme for nonlinear PDEs in risk models

In this paper we study nonlinear partial differential equations (PDEs) that are used to model different value adjustments denoted generally as xVA. These adjustments are nowadays commonly added to the risk-free financial derivative values and the PDE approach allows their easy incorporation. The aim of this paper is to apply the method of monotone iterations with sub- and supersolutions to the nonlinear Black-Scholes-type equation that occurs especially in the counterparty risk models. We introduce a monotone iteration scheme with semi-explicit solution formulas for each iteration step. Moreover, we show that the problem greatly simplifies for contracts with non-negative payoffs. To show the viability of the approach we apply our method to the call option, the forward, and the gap option.

math.AP↗

arXiv2022

Propagation reversal for bistable differential equations on trees

We study traveling wave solutions to bistable differential equations on infinite $k$-ary trees. These graphs generalize the notion of classical square infinite lattices and our results complement those for bistable lattice equations on $\mathbb{Z}$. Using comparison principles and explicit lower and upper solutions, we show that wave-solutions are pinned for small diffusion parameters. Upon increasing the diffusion, the wave starts to travel with non-zero speed, in a direction that depends on the detuning parameter. However, once the diffusion is sufficiently strong, the wave propagates in a single direction up the tree irrespective of the detuning parameter. In particular, our results imply that changes to the diffusion parameter can lead to a reversal of the propagation direction.

math.DS↗

arXiv2021

A note on a PDE approach to option pricing under xVA

In this paper we study partial differential equations (PDEs) that can be used to model value adjustments. Different value adjustments denoted generally as xVA are nowadays added to the risk-free financial derivative values and the PDE approach allows their easy incorporation. The aim of this paper is to show how to solve the PDE analytically in the Black-Scholes setting to get new semi-closed formulas that we compare to the widely used Monte-Carlo simulations and to the numerical solutions of the PDE. Particular example of collateral taken as the values from the past will be of interest.

q-fin.RM↗

arXiv2021

Periodic stationary solutions of the Nagumo lattice differential equation: existence regions and their number

The Nagumo lattice differential equation admits stationary solutions with arbitrary spatial period for sufficiently small diffusion rate. The continuation from the stationary solutions of the decoupled system (a system of isolated nodes) is used to determine their types; the solutions are labelled by words from a three-letter alphabet. Each stationary solution type can be assigned a parameter region in which the solution can be uniquely identified. Numerous symmetries present in the equation cause some of the regions to have identical or similar shape. With the help of combinatorial enumeration, we derive formulas determining the number of qualitatively different existence regions. We also discuss possible extensions to other systems with more general nonlinear terms and/or spatial structure.

math.DS↗

arXiv2019

Isogeometric analysis in option pricing

Isogeometric analysis is a recently developed computational approach that integrates finite element analysis directly into design described by non-uniform rational B-splines (NURBS). In this paper we show that price surfaces that occur in option pricing can be easily described by NURBS surfaces. For a class of stochastic volatility models, we develop a methodology for solving corresponding pricing partial integro-differential equations numerically by isogeometric analysis tools and show that a very small number of space discretization steps can be used to obtain sufficiently accurate results. Presented solution by finite element method is especially useful for practitioners dealing with derivatives where closed-form solution is not available.

q-fin.CP↗

arXiv2019

Counting and ordering periodic stationary solutions of lattice Nagumo equations

We study the rich structure of periodic stationary solutions of Nagumo reaction diffusion equation on lattices. By exploring the relationship with Nagumo equations on cyclic graphs we are able to divide these periodic solutions into equivalence classes that can be partially ordered and counted. In order to accomplish this, we use combinatorial concepts such as necklaces, bracelets and Lyndon words.

math.DS↗

arXiv2019

Multichromatic travelling waves for lattice Nagumo equations

We discuss multichromatic front solutions to the bistable Nagumo lattice differential equation. Such fronts connect the stable spatially homogeneous equilibria with spatially heterogeneous $n$-periodic equilibria and hence are not monotonic like the standard monochromatic fronts. In contrast to the bichromatic case, our results show that these multichromatic fronts can disappear and reappear as the diffusion coefficient is increased. In addition, these multichromatic waves can travel in parameter regimes where the monochromatic fronts are also free to travel. This leads to intricate collision processes where an incoming multichromatic wave can reverse its direction and turn into a monochromatic wave.

math.DS↗

arXiv2018

On Arbitrarily Long Periodic Orbits of Evolutionary Games on Graphs

A periodic behavior is a well observed phenomena in biological and economical systems. We show that evolutionary games on graphs with imitation dynamics can display periodic behavior for an arbitrary choice of game theoretical parameters describing social-dilemma games. We construct graphs and corresponding initial conditions whose trajectories are periodic with an arbitrary minimal period length. We also examine a periodic behavior of evolutionary games on graphs with the underlying graph being an acyclic (tree) graph. Astonishingly, even this acyclic structure allows for arbitrary long periodic behavior.

math.DS↗