Related papers: Local time penalizations with various clocks for o…
The quantization of time-reparametrization invariant systems such as general relativity is plagued by an ambiguity relating to the role of time in the theory. If one parametrizes observables by the (unobservable) time, and then relies on…
We consider the inverse problem of determining different type of information about a diffusion process, described by ordinary or fractional diffusion equations stated on a bounded domain, like the density of the medium or the velocity field…
For noncorrelated random variables, we study a concentration property of the family of distributions of normalized sums formed by sequences of times of a given large length.
We discuss the emergence of time dilation as a normal feature expected of any system where a central processor may have to wait one or more clock cycles before concluding a local calculation. We show how the process of causal implication in…
In this paper we study a storage process or a liquid queue in which the input process is the local time of a positively recurrent stationary diffusion in stationary state and the potential output takes place with a constant deterministic…
The diffusion equation and its time-fractional counterpart can be obtained via the diffusion limit of continuous-time random walks with exponential and heavy-tailed waiting time distributions. The space dependent variable-order…
We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of…
We investigate the question, "how does time flow?" and show that time may change by inversions as well. We discuss its implications to a simple class of linear systems. Instead of introducing any unphysical behaviour, inversions can lead to…
A proper time observable for a quantum clock is introduced and it is found that the proper time read by one clock conditioned on another clock reading a different proper time obeys classical time dilation in accordance with special…
We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…
Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…
We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete…
We study classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a probability distribution to the physical time, which is assumed to be discrete. In this way, a physical clock with discrete…
We establish general conditions under which there exists uniform in time convergence between a stochastic process and its approximated system. These standardised conditions consist of a local in time estimate between the original and the…
Time is a parameter playing a central role in our most fundamental modelling of natural laws. Relativity theory shows that the comparison of times measured by different clocks depends on their relative motion and on the strength of the…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
This paper studies particle propagation in a one-dimensional inhomogeneous medium where the laws of motion are generated by chaotic and deterministic local maps. Assuming that the particle's initial location is random and uniformly…
Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…
We study the problem of computing the value function from a discretely-observed trajectory of a continuous-time diffusion process. We develop a new class of algorithms based on easily implementable numerical schemes that are compatible with…
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…