相关论文: Thin times and random times' decomposition
We introduce probabilistic frames to study finite frames whose elements are chosen at random. While finite tight frames generalize orthonormal bases by allowing redundancy, independent, uniformly distributed points on the sphere…
The scattering of electromagnetic waves from obstacles with wave-material interaction in thin layers on the surface is described by generalized impedance boundary conditions, which provide effective approximate models. In particular, this…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of $r$ vertices. We provide a first…
This work considers to numerically solve a subdiffusion equation involving constant time delay $\tau$ and Riemann-Liouville fractional derivative. First, a fully discrete finite element scheme is developed for the considered problem under…
We develop theory and applications of forward characteristic processes in discrete time following a seminal paper of Jan Kallsen and Paul Kr\"uhner. Particular emphasis is placed on the dynamics of volatility surfaces which can be easily…
By proposing a paradox between the impossibility of superluminal signal transfer and the normalization condition of wavefunctions, we predict that when a change happens to the conditions that determining the status of a quantum system, the…
Time-resolved analysis of periodically excited luminescence decays by the phasor method in the presence of time-gating or binning is revisited. Analytical expressions for discrete configurations of square gates are derived and the locus of…
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…
We study a classical reparametrization-invariant system, in which ``time'' is not a priori defined. It consists of a nonrelativistic particle moving in five dimensions, two of which are compactified to form a torus. There, assuming a…
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model…
Consider the standard hospitals/residents problem, or the two-sided many-to-one stable matching problem, and assume that the true preference lists of both sides are complete and strict. The lists actually submitted, however, are truncated.…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Define the map $T_1$ on $\mathbb{F}_2[x]$ by $T_1(f)=\frac{f}{x}$ if $f(0)=0$ and $T_1(f)=\frac{(x+1)f+1}{x}$ if $f(0)=1$. For a non-zero polynomial $f$ let $\tau_1(f)$ denote the least natural $k$ number for which $T_1^{k}(f)=1$. Define…
Shrinkage of large particles, either through depolymerisation (i.e. progressive shortening) or through fragmentation (breakage into smaller pieces) may be modelled by discrete equations, of Becker-D\''oring type, or by continuous ones. In…
In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the…
Time-resolved analysis of periodically excited luminescence decays by the phasor method in the presence of time-gating or binning is revisited. Analytical expressions for discrete configurations of square gates are derived and the locus of…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the discrete moments in time at which the edge is available. We…