Related papers: Conditionings to avoid points with various clocks …
We derive a Hamiltonian for the external and internal dynamics of an electromagnetically bound, charged two-particle system in external electromagnetic and gravitational fields, including leading-order relativistic corrections. We apply…
A standard approach to analyzing tunneling processes in various physical contexts is to use instanton or imaginary time path techniques. For systems in which the tunneling takes place in a time dependent setting, the standard methods are…
In this paper we study the problem of model reduction by moment matching for stochastic systems. We characterize the mathematical object which generalizes the notion of moment to stochastic differential equations and we find a class of…
We study a continuous pathwise local time of order p for continuous functions with finite p-th variation along a sequence of time partitions, for even integers p >= 2. With this notion, we establish a Tanaka-type change of variable formula,…
The ability to know in advance the trend of running process instances, with respect to different features, such as the expected completion time, would allow business managers to timely counteract to undesired situations, in order to prevent…
We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete…
The recent study by B. De Bruyne, S. N. Majumdar, H. Orland and G. Schehr [arXiv:2110.07573], concerning the conditioning of the Brownian motion and of random walks on global dynamical constraints over a finite time-window $T$, is…
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.…
We study the obstacle problem for the Evolutionary p-Laplace Equation when the obstacle is discontinuous and without regularity in the time variable. Two quite different procedures yield the same solution.
We define renormalized intersection local times for random interlacements of L\'evy processes in R^{d} and prove an isomorphism theorem relating renormalized intersection local times with associated Wick polynomials.
In this work, we investigate the existence of positive solutions for a multi-point boundary value problem for a second order delay differential equation. Under certain growth conditions on the nonlinearity, and by the mean of Leray-Schauder…
The subject of time in quantum mechanics is of perennial interest especially because there is no observable for the time taken by a particle to transmit (or reflect) from a particular region. Several methods have been proposed based on…
In this paper, we study the notion of local time and Tanaka formula for the G-Brownian motion. Moreover, the joint continuity of the local time of the G-Brownian motion is obtained and its quadratic variation is proven. As an application,…
We consider a 1-machine scheduling problem where the temperature of a job rises during processing, and cools down when not being processed according to given linear heating and cooling rates. No job's temperature is allowed to rise above a…
In statistical research there usually exists a choice between structurally simpler or more complex models. We argue that, even if a more complex, locally stationary time series model were true, then a simple, stationary time series model…
We study the optimal stopping of an American call option in a random time-horizon under exponential spectrally negative L\'evy models. The random time-horizon is modeled as the so-called Omega default clock in insurance, which is the first…
Several results regarding the stability and the stabilization of linear impulsive positive systems under arbitrary, constant, minimum, maximum and range dwell-time are obtained. The proposed stability conditions characterize the pointwise…
What time does a clock tell after quantum tunneling? Predictions and indirect measurements range from superluminal or instantaneous tunneling to finite durations, depending on the specific experiment and the precise definition of the…
We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence…
Given a spectrally negative L\'evy process and independent Poisson observation times, we consider a periodic barrier strategy that pushes the process down to a certain level whenever it is above it. We also consider the versions with…