基于生存理论的线性微分博弈系统识别域的判别

利用生存性理论, 研究线性微分博弈系统的一个有界识别域问题. 采用生存性理论来研究线性微分博弈系统的有界多面体\,(有限点集的凸包)\,的识别域问题, 给定的方法只需要检验该多面体在极点处是否满足生存性条件. 进而, 利用生存性与识别域的关系, 即可判断此多面体是否是系统的识别域, 简便易行.     

高等代数中具有基域不变性的概念与性质

全面细致地梳理了高等代数中具有基域不变性的概念与性质,并分析得出这些概念或性质的基域不变性主要源于欧氏算法与行列式的基域不变性.     

任意随机变量序列泛函及其随机变换的一类极限定理

采用鞅方法研究对任意随机变量序列普遍成立的强极限定理.并作为推论得到了m阶马氏过程,鞅序列,鞅差序列,独立随机变量序列的一类强极限定理.并把赌博系统的随机变换概念推广到任意随机变量序列的情况,得到任意随机变量序列随机选择与公平比的若干极限定理.     

一类随机系统的有限时间镇定

讨论随机系统的有限时间镇定问题.首先提出了随机系统有限时间稳定的概念;其次证明了随机系统有限时间稳定的Lyapunov定理;然后,讨论了一类随机系统的镇定问题.     

二重非齐次马氏链及其随机变换的若干强极限定理

利用鞅方法,给出二重非齐次马尔可夫链三元函数的几个强极限定理.作为特例,将赌博系统的随机变换概念推广到二重马氏链情形,得到二重马氏链随机选择与随机公平比的若干极限定理.     

一类分形结构上的非对称随机游动

本研究一类分形结构上的随机游动,得到了它的进位不变性,进位时间的生成函数表达式并得到一个极限定理。     

任意随机序列关于二重非齐次马氏链的随机和的一类随机选择系统的随机逼近定理

本文引进任意随机变量序列随机极限对数似然比的概念,通过测度$\pr$下任意相依随机序列联合分布与测度$\qr$下二重非齐次马氏分布相比较,利用母函数与尾概率母函数工具研究任意受控随机序列之随机和在随机选择系统中的一类随机逼近定理.     

更一般与年龄相关随机时滞种群方程的全局稳定性

讨论更一般的与年龄相关随机时滞种群方程的全局稳定性.如果传统假设(Lipschitz条件)缺失,与年龄相关随机时滞种群方程可能有多于一个弱解.然而,大量文献研究结果是在此类方程有唯一强解前提下获得.因此,有必要对更一般的有多于一个弱解情况进行相关概念推广.对更一般的与年龄相关随机时滞种群方程,随机稳定性概念被提出,一般的Barbashin-Krasovskii定理和Lasalle定理被建立,涵盖了多于一个弱解的情况.显然,这两个定理给出随机时滞种群方程稳定性的判定标准,并且通过实例说明定理的有效性.     

Hilbert空间中的一类随机算子方程

本文提出了随机强制算子与随机强单调算子的新概念。研究了在Hilbert空问中一类随机算子方程的随机解。同时推广了著名的Krasnoselkii定理。     

N值随机序列的随机选择的强极限定理

将赌博系统的随机选择理论扩展到N值随机序列,利用似然比概念及分析技术,得到一个随机选择下有序数偶相对频率的强极限定理     

Stochastic Invariance for Differential Inclusions

The aim of this paper is to combine two ways for representing uncertainty through stochastic differential inclusions: a 'stochastic uncertainty", driven by a Wiener process, and a 'contingent uncertainty", driven by a set-valued map. The paper is also devoted to the invariance of closed under stochastic differential inclusions with a Lipschitz right-hand side, characterized in terms of stochastic tangent sets to closed subsets.     

A non-standard-Euler–Maruyama scheme

We construct a non-standard finite difference numerical scheme to approximate stochastic differential equations (SDEs) using the idea of weighed step introduced by R.E. Mickens. We prove the strong convergence of our scheme under locally Lipschitz conditions of a SDE and linear growth condition. We prove the preservation of domain invariance by our scheme under a minimal condition depending on a discretization parameter and unconditionally for the expectation of the approximate solution. The results are illustrated through the geometric Brownian motion. The new scheme shows a greater behaviour compared with the Euler–Maruyama scheme and balanced implicit methods which are widely used in the literature and applications.     

Bilateral Fixed-Points and Algebraic Properties of Viability Kernels and Capture Basins of Sets

Many concepts of viability theory such as viability or invariance kernels and capture or absorption basins under discrete multivalued systems, differential inclusions and dynamical games share algebraic properties that provide simple – yet powerful – characterizations as either largest or smallest fixed points or unique minimax (or bilateral fixed-point) of adequate maps defined on pairs of subsets. Further, important algorithms such as the Saint-Pierre viability kernel algorithm for computing viability kernels under discrete system and the Cardaliaguet algorithm for characterizing discriminating kernels under dynamical games are algebraic in nature. The Matheron Theorem as well as the Galois transform find applications in the field of control and dynamical games allowing us to clarify concepts and simplify proofs.     

A Geometric Characterization of Viable Sets for Controlled Degenerate Diffusions

For a general controlled diffusion process and an arbitrary closed set K we study the viability, or weak invariance, or controlled invariance, of K, that is, the existence of a control for each initial point in K keeping the trajectory forever in K. By viscosity solutions methods we prove a simple necessary and sufficient condition involving only a deterministic second-order normal cone to K and the data of the diffusion process. We also give an extension to stochastic differential games.     

Controllability Properties of Linear Mean-Field Stochastic Systems

We study some controllability properties for linear stochastic systems of mean-field type. First, we give necessary and sufficient criteria for exact terminal-controllability. Second, we characterize the approximate and approximate null-controllability via duality techniques. Using Riccati equations associated to linear quadratic problems in the control of mean-field systems, we provide a (conditional) viability criterion for approximate null-controllability. In the classical diffusion framework, approximate and approximate null-controllability are equivalent. This is no longer the case for mean-field systems. We provide sufficient (algebraic) invariance conditions implying approximate null-controllability. We also present a general class of systems for which our criterion is equivalent to approximate null-controllability property. We also introduce some rank conditions under which approximate and approximate null-controllability are equivalent. Several examples and counter-examples as well as a partial algorithm are provided.     

Characterization of Stochastic Viability of Any Nonsmooth Set Involving Its Generalized Contingent Curvature

Abstract

Thanks to the Stroock and Varadhan “Support Theorem” and under convenient regularity assumptions, stochastic viability problems are equivalent to invariance problems for control systems (also called tychastic viability), as it has been singled out by Doss in 1977 for instance. By the way, it is in this framework of invariance under control systems that problems of stochastic viability in mathematical finance are studied. The Invariance Theorem for control systems characterizes invariance through first‐order tangential and/or normal conditions whereas the stochastic invariance theorem characterizes invariance under second‐order tangential conditions. Doss's Theorem states that these first‐order normal conditions are equivalent to second‐order normal conditions that we expect for invariance under stochastic differential equations for smooth subsets. We extend this result to any subset by defining in an adequate way the concept of contingent curvature of a set and contingent epi‐Hessian of a function, related to the contingent curvature of its epigraph. This allows us to go one step further by characterizing functions the epigraphs of which are invariant under systems of stochastic differential equations. We shall show that they are (generalized) solutions to either a system of first‐order Hamilton‐Jacobi equations or to an equivalent system of second‐order Hamilton‐Jacobi equations.     

Weak pullback attractors of setvalued processes

Weak pullback attractors are defined for nonautonomous setvalued processes and their existence and upper semicontinuous convergence under perturbation is established. Unlike strong pullback attractors, invariance and pullback attraction here are required only for at least one trajectory rather than all trajectories at each starting point. The concept is useful in, for example, continuous time control systems and is related to that of viability.     

Stochastic approximation and the final value theorem

The aim here is to show how to obtain many of the well-known limit results (i.e., central limit theorem, law of the iterated logarithm, invariance principle) of stochastic approximation (SA) by a shorter argument and under weaker conditions. The idea is to introduce an artificial sequence, related to the SA scheme, and which clearly obeys the limit law. This sequence is subtracted from the SA scheme and then simple deterministic limit theory is used to show the remainder is negligible. As a consequence of this approach proofs are shorter and the meaning of conditions becomes clearer. Because the difference equations are not summed up it is simple to state results for general a_n, c_n sequences.     

On the domain invariance of countably condensing vector fields

Using homotopy theory, we give the domain invariance theorem for countably condensing vector fields, where the notion of countably condensing maps is due to Väth. A starting point of this investigation is that there is a symmetric characteristic set for a countably condensing map.