arXiv research

We provide a general Doob-Meyer decomposition for $g$-supermartingale systems, which does not require any right-continuity on the system. In particular, it generalizes the Doob-Meyer decomposition of Mertens (1972) for classical supermartingales, as well as Peng's (1999) version for right-continuous $g$-supermartingale…

In this paper, we study a type of reflected BSDE with a constraint and introduce a new kind of nonlinear expectation via BSDE with a constraint and prove the Doob-Meyer decomposition with respect to the super(sub)martingale introduced by this nonlinear expectation. We then apply the results to the pricing of American o…

The study examines how market completeness is lost when filtering down the information set.

We build a general model for pricing defaultable claims. In addition to the usual absence of arbitrage assumption, we assume that one defaultable asset (at least) looses value when the default occurs. We prove that under this assumption, in some standard market filtrations, default times are totally inaccessible stoppi…

We extend Kyle's model to include stochastic liquidity and multiple assets.

We give an elementary proof of the celebrated Bichteler-Dellacherie Theorem which states that the class of stochastic processes $S$ allowing for a useful integration theory consists precisely of those processes which can be written in the form $S=M+A$, where $M$ is a local martingale and $A$ is a finite variation proce…

The target of this paper is to establish the bid-ask pricing frame work for the American contingent claims against risky assets with G-asset price systems (see \cite{Chen2013b}) on the financial market under Knight uncertainty. First, we prove G-Dooby-Meyer decomposition for G-supermartingale. Furthermore, we consider …

We consider filtration consistent nonlinear expectations in probability spaces satisfying only the usual conditions and separability. Under a domination assumption, we demonstrate that these nonlinear expectations can be expressed as the solutions to Backward Stochastic Differential Equations with Lipschitz continuous …

Paper defines saddle points in asymmetric Dynkin games using martingale theory.

In this article, we follow the study of quadratic backward SDEs with jumps,that is to say for which the generator has quadratic growth in the variables (z; u), started in our accompanying paper [15]. Relying on the existence and uniqueness result of [15], we define the corresponding g-expectations and study some of the…

We propose a new definition for tameness within the model of security prices as Itô processes that is risk-aware. We give a new definition for arbitrage and characterize it. We then prove a theorem that can be seen as an extension of the second fundamental theorem of asset pricing, and a theorem for valuation of contin…

Paper develops a new probabilistic method for American options using entropy regularization.

A new method uses deep learning for optimal stopping problems.

The present paper introduces a jump-diffusion extension of the classical diffusion default intensity model by means of subordination in the sense of Bochner. We start from the bi-variate process $(X,D)$ of a diffusion state variable $X$ driving default intensity and a default indicator process $D$ and time change it wi…

Researchers describe and compare decompositions of Poincaré duality pairs.

The paper proposes and discusses semiorthogonal decompositions for moduli spaces of vector bundles.

The paper classifies decompositions of 3-sphere and lens spaces with handlebodies.

We combine aspects of the notions of finite decomposition complexity and asymptotic property C into a notion that we call finite APC-decomposition complexity. Any space with finite decomposition complexity has finite APC-decomposition complexity and any space with asymptotic property C has finite APC-decomposition comp…

This paper generalizes octahedral decomposition to links in thickened surfaces.

Researchers compute Goeritz groups for all (1,1)-link decompositions.

Study concordance of decompositions from defining sequences in 3-sphere.

Given a Delaunay decomposition of a compact hyperbolic surface, one may record the topological data of the decomposition, together with the intersection angles between the `empty disks' circumscribing the regions of the decomposition. The main result of this paper is a characterization of when a given topological decom…

Study shows OAT decomposition generates unexplained profit and loss, while SU decompositions depend on risk factor order.

A new algorithm speeds up CP decomposition for large tensors.

Paper characterizes optimization landscape of Tucker decomposition.

A double pants decomposition of a 2-dimensional surface is a collection of two pants decomposition of this surface introduced in arXiv:1005.0073v2. There are two natural operations acting on double pants decompositions: flips and handle twists. It is shown in arXiv:1005.0073v2 that the groupoid generated by flips and h…

Smooth 4-manifolds have simple horizontal decompositions.

Let $\mathcal{J}^1$ be the real form of a complex simple Jordan algebra such that the automorphism group is $\mathrm{F}_{4(-20)}$. By using some orbit types of $\mathrm{F}_{4(-20)}$ on $\mathcal{J}^1$, for $\mathrm{F}_{4(-20)}$, explicitly, we give the Iwasawa decomposition, the Oshima--Sekiguchi's $K_ε-$Iwasawa decomp…

We study the topological types of pants decompositions of a surface by associating to any pants decomposition $P,$ in a natural way its pants decomposition graph, $Γ(P).$ This perspective provides a convenient way to analyze the maximum distance in the pants complex of any pants decomposition to a pants decomposition c…

New method uses random decompositions for high-dimensional Bayesian optimization.

New varifold example shows decomposition failure.

Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.

Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to be $k$-manifolds $(k = 1, 2)$, which generalize characterizations in the codimens…

Short proof for ideal polygons with near optimal orthogeodesic decomposition.

Paper introduces a new principle for fair redistribution of insurance surplus.

The paper defines and proves the existence of decompositions of integral varifolds.

We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented groups and the canonical JSJ decomposition," Ann. of Math. 146 (1997), 53-109. On th…

We consider a union of two pants decompositions of the same orientable 2-dimensional surface of any genus g. Each pants decomposition corresponds to some handlebody bounded by this surface, so two pants decompositions correspond to a Heegaard splitting of a 3-manifold. We introduce a groupoid FT acting on double pants …

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

Handles decompositions reveal new open book structures.

The aim of this paper is to provide some new tools to aid the study of decomposition complexity, a notion introduced by Guentner, Tessera and Yu. In this paper, three equivalent definitions for decomposition complexity are established. We prove that metric spaces with finite hyperbolic dimension have finite (weak) deco…

Unified algorithm for tensor decomposition supports multiple loss functions and models.

The paper defines and proves stabilization for 3-manifold decompositions with multibranched surface intersections.

To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictiona…

Analyzes canonical reductive decomposition of extrinsic homogeneous submanifolds.

Tensor decomposition methods are widely used for model compression and fast inference in convolutional neural networks (CNNs). Although many decompositions are conceivable, only CP decomposition and a few others have been applied in practice, and no extensive comparisons have been made between available methods. Previo…

Examines respectful decompositions of Lie algebras.

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition…