Related papers: How long does it take for Internal DLA to forget i…
Adsorption to a surface, reversible-binding, and trapping are all prevalent scenarios where particles exhibit "stickiness". Escape and first-passage times are known to be drastically affected, but detailed understanding of this phenomenon…
Taking a multidimensional time-homogeneous dynamical system and adding a randomly perturbed time-dependent deterministic signal to some of its components gives rise to a high-dimensional system of stochastic differential equations which is…
Stochastic gradient descent (SGD) is a popular algorithm for minimizing objective functions that arise in machine learning. For constant step-sized SGD, the iterates form a Markov chain on a general state space. Focusing on a class of…
This paper proposes a new type of recurrence where we divide the Markov chains into intervals that start when the chain enters into a subset A, then sample another subset B far away from A and end when the chain again return to A. The…
Machine learning (ML) inference is a real-time workload that must comply with strict Service Level Objectives (SLOs), including latency and accuracy targets. Unfortunately, ensuring that SLOs are not violated in inference-serving systems is…
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of…
Strong positional correlations between particles render the diffusion of a tracer particle in a single file anomalous and non-Markovian. While ensemble average observables of tracer particles are nowadays well understood, little is known…
Self-sustained, elevated neuronal activity persisting on time scales of ten seconds or longer is thought to be vital for aspects of working memory, including brain representations of real space. Continuous-attractor neural networks, one of…
Quantum escapes of a particle from an end of a one-dimensional finite region to $N$ number of semi-infinite leads are discussed by a scattering theoretical approach. Depending on a potential barrier amplitude at the junction, the…
The dynamics of classical hard particles in a quasi one-dimensional channel were studied since the 1960s and used for explaining processes in chemistry, physics and biology and in applications. Here we show that in a previously un-described…
Continual learning aims to sequentially learn new tasks without forgetting previous tasks' knowledge (catastrophic forgetting). One factor that can cause forgetting is the interference between the gradients on losses from different tasks.…
The persistence of a stochastic variable is the probability that it does not cross a given level during a fixed time interval. Although persistence is a simple concept to understand, it is in general hard to calculate. Here we consider zero…
We study a large class of reversible Markov chains with discrete state space and transition matrix $P_N$. We define the notion of a set of {\it metastable points} as a subset of the state space $\G_N$ such that (i) this set is reached from…
Discrete time crystals are periodically driven systems characterized by a response with periodicity $nT$, with $T$ the period of the drive and $n>1$. Typically, $n$ is an integer and bounded from above by the dimension of the local (or…
Directional-change Intrinsic Time analysis has long revealed scaling laws in market microstructure, but the origin of their stability remains elusive. This article presents evidence that Intrinsic Time can be modeled as a memoryless…
The $L_{2}$-regularized loss of Deep Linear Networks (DLNs) with more than one hidden layers has multiple local minima, corresponding to matrices with different ranks. In tasks such as matrix completion, the goal is to converge to the local…
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal.…
We show that the probability, P_0(l), that the height of a fluctuating (d+1)-dimensional interface in its steady state stays above its initial value up to a distance l, along any linear cut in the d-dimensional space, decays as P_0(l) \sim…
A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…