English
Related papers

Related papers: Cutoff for the bidirectional East Process

200 papers

A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m=3$, it is not even known if the problem is NP-hard and this is one of the last…

Data Structures and Algorithms · Computer Science 2017-08-16 Shashwat Garg

We develop and analyze a class of maximum bound preserving schemes for approximately solving Allen--Cahn equations. We apply a $k$th-order single-step scheme in time (where the nonlinear term is linearized by multi-step extrapolation), and…

Numerical Analysis · Mathematics 2021-03-01 Jiang Yang , Zhaoming Yuan , Zhi Zhou

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing…

Data Structures and Algorithms · Computer Science 2020-11-12 Lars Rohwedder , Andreas Wiese

The small noise cut-off phenomenon in continuous time and space has been studied in the recent literature for the linear and non-linear stable Langevin dynamics with additive L\'evy drivers - understood as abrupt thermalization of the…

Probability · Mathematics 2025-02-13 Gerardo Barrera , Michael A. Högele , Pauliina Ilmonen , Lauri Viitasaari

For several classes of bounded sets $A$, the limit of a one-dimensional L\'{e}vy process conditioned to avoid $A$ up to a parametrized random time which tends to infinity. For $A$ we take the set of finite points with several clocks and a…

Probability · Mathematics 2025-01-07 Kohki Iba

The Hausdorff distance is a metric commonly used to compute the set similarity of geometric sets. For sets containing a total of $n$ points, the exact distance can be computed na\"{i}vely in $O(n^2)$ time. In this paper, we show how to…

Computational Geometry · Computer Science 2025-05-16 Oliver A. Chubet , Parth M. Parikh , Donald R. Sheehy , Siddharth S. Sheth

We examine the regenerative cutting process by using a single degree of freedom non-smooth model with a friction component and a time delay term. Instead of the standard Lyapunov exponent calculations, we propose a statistical 0-1 test…

Chaotic Dynamics · Physics 2012-01-25 Grzegorz Litak , Sven Schubert , Guenter Radons

Let $\{D(s), s \geq 0\}$ be a non-decreasing L\'evy process. The first-hitting time process $\{E(t) t \geq 0\}$ (which is sometimes referred to as an inverse subordinator) defined by $E(t) = \inf \{s: D(s) > t \}$ is a process which has…

Probability · Mathematics 2009-04-28 Mark S. Veillette , Murad S. Taqqu

In this paper we study the mean of the first exit time from a bounded interval of various L\'evy processes. We establish sharp two-sided estimates of the mean for L\'evy processes under certain condition on their characteristic exponents.…

Probability · Mathematics 2019-11-13 Tomasz Grzywny

We consider an $n$-tuple of independent ergodic Markov processes, each of which converges (in the sense of separation distance) at an exponential rate, and obtain a necessary and sufficient condition for the $n$-tuple to exhibit a…

Probability · Mathematics 2010-03-19 Stephen B. Connor

A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…

Probability · Mathematics 2015-04-10 Anna Ben-Hamou , Justin Salez

We study the connection between PDEs and L\'{e}vy processes running with clocks given by time-changed Poisson processes with stochastic drifts. The random times we deal with are therefore given by time-changed Poissonian jumps related to…

Probability · Mathematics 2014-01-15 Luisa Beghin , Mirko D'Ovidio

Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits with fewer qubits that can be executed independently on a small quantum computer. Classical post-processing then…

Quantum Physics · Physics 2022-11-15 Gideon Uchehara , Tor M. Aamodt , Olivia Di Matteo

We study the subRiemannian cut time and cut locus of a given point in a class of step-2 Carnot groups of Reiter-Heisenberg type. Following the Hamiltonian point of view, we write and analyze extremal curves, getting the cut time of any of…

Optimization and Control · Mathematics 2024-08-22 Annamaria Montanari , Daniele Morbidelli

This paper calculates transient distributions of a special class of Markov processes with continuous state space and in continuous time, up to an explicit error bound. We approximate specific queues on R with one-sided L\'evy input, such as…

Probability · Mathematics 2025-04-03 Fabian Michel , Markus Siegle

This paper provides a multivariate extension of Bertoin's pathwise construction of a L\'evy process conditioned to stay positive/negative. Thus obtained processes conditioned to stay in half-spaces are closely related to the original…

Probability · Mathematics 2021-05-27 Jevgenijs Ivanovs , Jakob D. Thøstesen

It is well known that between all processes with independent increments, essentially only the Brownian motion and the Poisson process possess the chaotic representation property (CRP). Thus, a natural question appears: What is an…

Probability · Mathematics 2016-09-07 E. Lytvynov

This paper presents local and global bifurcation results for radially symmetric solutions of the cubic Helmholtz system \begin{equation*} \begin{cases} -\Delta u - \mu u = \left( u^2 + b \: v^2 \right) u &\text{ on } \mathbb{R}^3, \\…

Analysis of PDEs · Mathematics 2018-11-05 Rainer Mandel , Dominic Scheider

In this article we study the so-called cut-off phenomenon in the total variation distance when $n\to \infty$ for the family of continuous-time stochastic processes indexed by $n\in \mathbb{N}$, \[ \left( \mathcal{Z}^{(n)}_t=…

Probability · Mathematics 2023-05-05 Gerardo Barrera

For one-dimensional symmetric L\'{e}vy processes, which hit every point with positive probability, we give sharp bounds for the tail function of the first hitting time of B which is either a single point or an interval. The estimates are…

Probability · Mathematics 2016-12-02 Tomasz Grzywny , Michał Ryznar
‹ Prev 1 3 4 5 6 7 10 Next ›