相关论文: Thin times and random times' decomposition

In this paper we study progressive filtration expansions with random times. We show how semimartingale decompositions in the expanded filtration can be obtained using a natural link between progressive and initial expansions. The link is,…

Az\'{e}ma associated with an honest time L the supermartingale $Z_{t}^{L}=\mathbb{P}[L>t|\mathcal{F}_{t}]$ and established some of its important properties. This supermartingale plays a central role in the general theory of stochastic…

This paper quantifies the interplay between the non-arbitrage notion of No-Unbounded-Profit-with-Bounded-Risk (NUPBR hereafter) and additional information generated by a random time. This study complements the one of…

We show that finite physical clocks always have well-behaved signals, namely that every waiting-time distribution generated by a physical process on a system of finite size is guaranteed to be bounded by a decay envelope. Following this…

In this paper, we provide a solution to two problems which have been open in default time modeling in credit risk. We first show that if $\tau$ is an arbitrary random (default) time such that its Az\'ema's supermartingale…

We consider a filtration $\mathbb{G}$ obtained as enlargement of a filtration $\mathbb{F}$ by a filtration $\mathbb{H}$. We assume that all $\mathbb{F}$-local martingales are represented by a martingale $M$ and all $\mathbb{H}$-local…

Consider $\mathbb{G}$ the progressive enlargement of a filtration $\mathbb{F}$ with a random time $\tau$. Assuming that, in $\mathbb{F}$, the martingale representation property holds, we examine conditions under which the martingale…

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

We derive the asymptotic first passage time (FPT) distribution for space-dependent variable-order time-fractional diffusion, where the fractional exponent $\alpha(x)$ varies with position. For any sufficiently smooth $\alpha(x)$ on a finite…

Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…

Motivated by the Generalized Uncertainty Principle, covariance, and a minimum measurable time, we propose a deformation of the Heisenberg algebra and show that this leads to corrections to all quantum mechanical systems. We also demonstrate…

In this article, it is proved that for any cumulative distribution function with compact support and a specified t > 0, there exists a diffusion martingale which has this law at time t. The article proves existence; no claims are made about…

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…

Given two filtrations $\mathbb F \subset \mathbb G$, we study under which conditions the $\mathbb F$-optional projection and the $\mathbb F$-dual optional projection coincide for the class of $\mathbb G$-optional processes with integrable…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

This project is a part of nature language processing and its aims to develop a system of recognition inference text-appointed TIMINF. This type of system can detect, given two portions of text, if a text is semantically deducted from the…

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

We study a natural variant of scheduling that we call \emph{partial scheduling}: In this variant an instance of a scheduling problem along with an integer $k$ is given and one seeks an optimal schedule where not all, but only $k$ jobs, have…

The analysis of the time-frequency content of a signal is a classical problem in signal processing, with a broad number of applications in real life. Many different approaches have been developed over the decades, which provide alternative…

A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $\tau$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly…