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

In this paper, we show that slow feature analysis (SFA), a common time series decomposition method, naturally fits into the flow-based models (FBM) framework, a type of invertible neural latent variable models. Building upon recent advances…

This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and…

Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of…

Temporal networks are essential for modeling and understanding systems whose behavior varies in time, from social interactions to biological systems. Often, however, real-world data are prohibitively expensive to collect in a large scale or…

We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is…

For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a permutation finite group can be computed in a polynomial time. Moreover, if in the previous case $\mathfrak{F}$ is hereditary, then an…

Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth…

We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomial time the vertices of $G$ into $p$ sets $Z_1,\dots,Z_p$…

Out of equilibrium states in glasses and crystals have been a major topic of research in condensed-matter physics for many years, and the idea of time crystals has triggered a flurry of new research. Here, we provide the first description…

Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are…

We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art inference algorithms on discrete probabilistic graphical models…

On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $F^k(\mathbf{r})$ falls…

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

Based on the analysis of probability flow, where the First Passage (FP) is realised as the sink of probability, we summarise the protocol to find the distribution of the First Passage Time (FTP). We also describe the corresponding formula…

We show how different random thin sets of integers may have different behaviour. First, using a recent deviation inequality of Boucheron, Lugosi and Massart, we give a simpler proof of one of our results in {\sl Some new thin sets of…

In this paper, we study two variations of the time discrete Taylor schemes for rough differential equations and for stochastic differential equations driven by fractional Brownian motions. One is the incomplete Taylor scheme which excludes…

The Fluctuation Relation (FR) is an asymptotic result on the distribution of certain observables averaged over time intervals T as T goes to infinity and it is a generalization of the fluctuation--dissipation theorem to far from equilibrium…

We investigate the notion of finite time stability for tempered fractional systems (TFSs) with time delays and variable coefficients. Then, we examine some sufficient conditions that allow concluding the TFSs stability in a finite time…

We consider particle filters with weakly informative observations (or `potentials') relative to the latent state dynamics. The particular focus of this work is on particle filters to approximate time-discretisations of continuous-time…

The local time in an ensemble of particles measures the amount of time the particles spend in the vicinity of a given point in space. Here we study fluctuations of the empirical time average $R= T^{-1}\int_{0}^{T}\rho\left(x=0,t\right)\,dt$…