相关论文: Long hitting time, slow decay of correlations and …

Invariance times are stopping times $\tau$ such that local martingales with respect to some reduced filtration and an equivalently changed probability measure, stopped before $\tau$ , are local martingales with respect to the original model…

Time-parallel algorithms, such as Parareal, are well-understood for linear problems, but their convergence analysis for nonlinear, chaotic systems remains limited. This paper introduces a new theoretical framework for analysing…

We consider toral extensions of hyperbolic dynamical systems. We prove that its quantitative recurrence (also with respect to given observables) and hitting time scale behavior depend on the arithmetical properties of the extension. By this…

We consider inf-sup stable mixed methods for the time-dependent incompressible Stokes and Navier--Stokes equations, extending earlier work on the steady (Navier-)Stokes Problem. A locking phenomenon is identified for classical inf-sup…

Consider the process where the $n$ vertices of a square $2$-dimensional torus appear consecutively in a random order. We show that typically the size of the $3$-core of the corresponding induced unit-distance graph transitions from $0$ to…

We show here how, using Euler's integration method and an associated function bounding the error in function of time, one can generate structures closely surrounding the invariant tori of dynamical systems. Such structures are constructed…

Let $A$ be a $2\times 2$ integral matrix with an eigenvalue of modulus strictly less than 1. Let $T$ be the natural endomorphism on the torus $\mathbb{T}^2=\mathbb{R}^2/\mathbb{Z}^2$, induced by $A$. Given $\tau>0$, let \[ R_\tau =\{\, x\in…

We identify the integrable stopping time $\tau_*$ with minimal $L^1$-distance to the last-passage time $\gamma_z$ to a given level $z>0$, for an arbitrary non-negative time-homogeneous transient diffusion $X$. We demonstrate that $\tau_*$…

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…

A formalism using a double Laplace Fourier transform of the transport equation yields the return probabilities of the vacancy in the vicinity of the tracer atom in the presence of solute-vacancy interactions of arbitrary extension. Studying…

The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…

In this paper, we consider co-existing two different types of devices in machine-type communication (MTC), namely type-1 and type-2 devices, where type-1 devices need short access delay for low-latency requirements, while type-2 devices are…

We consider a billiard in the plane with periodic configuration of convex scatterers. This system is recurrent, in the sense that almost every orbit comes back arbitrarily close to the initial point. In this paper we study the time needed…

Engineered injection and extraction systems that create chaotic advection are promising procedures for enhancing mixing between two species. Mixing efficiencies vary considerably, so carefully selecting the design parameters, like pumping…

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation.…

Most black hole candidate X-ray binaries show Fourier time lags between softer and harder X-rays. The hard photons seem to arrive up to a few ms after the soft for a given Fourier frequency of the perturbation. The energy dependence of the…

A lattice model of critical dense polymers is solved exactly for arbitrary system size on the torus. More generally, an infinite family of lattice loop models is studied on the torus and related to the corresponding Fortuin-Kasteleyn random…

We consider the following balls-into-bins process with $n$ bins and $m$ balls: each ball is equipped with a mutually independent exponential clock of rate 1. Whenever a ball's clock rings, the ball samples a random bin and moves there if…

Motivated by emerging applications in online matching platforms and marketplaces, we study a matching queue. Customers and servers that arrive in a matching queue depart as soon as they are matched. While state-dependent control is an…

This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…