相关论文: Thin times and random times' decomposition
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale…
In this work, we introduce a filtration on temporal graphs based on $\delta$-temporal motifs (recurrent subgraphs), yielding a multi-scale representation of temporal structure. Our temporal filtration allows tools developed for filtered…
This paper considers a natural fault-tolerant shortest paths problem: for some constant integer $f$, given a directed weighted graph with no negative cycles and two fixed vertices $s$ and $t$, compute (either explicitly or implicitly) for…
Let $\mathbb{F}$ be a filtration and $\tau$ be a random time. Let $\mathbb{G}$ be the progressive enlargement of $\mathbb{F}$ with $\tau$. We study the validity of the following formula, called optional splitting formula : For any…
Motivated by entropic optimal transport, time reversal of diffusion processes is revisited. An integration by parts formula is derived for the carr\'e du champ of a Markov process in an abstract space. It leads to a time reversal formula…
In this paper we study time-inhomogeneous affine processes beyond the common assumption of stochastic continuity. In this setting times of jumps can be both inaccessible and predictable. To this end we develop a general theory of finite…
We show how minimal elements of a stopping time $\sigma$-algebra can be expressed in terms of the minimal elements of the $\sigma$-algebra of the underlying filtration. This facilitates an intuitive interpretation of stopping time…
In this review, we present some fundamental classical and quantum phenomena in view of time fractional formalism. Time fractional formalism is a very useful tool in describing systems with memory and delay. We hope that this study can…
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are…
Temporal graphs represent graph evolution over time, and have been receiving considerable research attention. Work on expressing temporal graph patterns or discovering temporal motifs typically assumes relatively simple temporal…
The authors present empirical distributions for the halting time (measured by the number of iterations to reach a given accuracy) of optimization algorithms applied to two random systems: spin glasses and deep learning. Given an algorithm,…
We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of $\mathsf{BPTIME}$: proving hierarchy theorems and showing the existence of complete problems. Our main contributions can be…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
For any time bound f, let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to some b generates an infinite hierarchy of proper subclasses DTIME_b(f) \subset…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
As a model problem for the study of chaotic Hamiltonian systems, we look for the effects of a long-tail distribution of recurrence times on a fixed Hamiltonian dynamics. We follow Stanislavsky's approach of Hamiltonian formalism for…
We present a derivation of the structure and dynamics of a ticking clock by showing that for finite systems a single natural principle serves to distinguish what we understand as ticking clocks from time-keeping systems in general. As a…
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…
We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $\tau(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than…
We introduce the idea of temporal graphs, a representation that encodes temporal data into graphs while fully retaining the temporal information of the original data. This representation lets us explore the dynamic temporal properties of…