Related papers: How long does it take for Internal DLA to forget i…
Stochastic chains represent a wide and key variety of phenomena in many branches of science within the context of Information Theory and Thermodynamics. They are typically approached by a sequence of independent events or by a memoryless…
We consider the simple random walk conditioned to stay forever in a finite domain $D_N \subset \mathbb{Z}^d, d \geq 3$ of typical size $N$. This confined walk is a random walk on the conductances given by the first eigenvector of the…
For a class of typical states, the real-time and real-space dynamics of non-equilibrium density profiles has been recently studied for integrable models, i.e. the spin-1/2 XXZ chain [PRB 95, 035155 (2017)] and the Fermi-Hubbard chain [PRE…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Continual learning (CL) enables animals to learn new tasks without erasing prior knowledge. CL in artificial neural networks (NNs) is challenging due to catastrophic forgetting, where new learning degrades performance on older tasks. While…
We investigate the first passage properties of a Brownian particle diffusing freely inside a $d$-dimensional sphere with absorbing spherical surface subject to stochastic resetting. We derive the mean time to absorption (MTA) as functions…
The main problem about replacing LTP as a memory mechanism has been to find other highly abstract, easily understandable principles for induced plasticity. In this paper we attempt to lay out such a basic mechanism, namely intrinsic…
We develop dynamic data structures for maintaining a hierarchical k-center clustering when the points come from a discrete space $\{1,\ldots,\Delta\}^d$. Our first data structure is for the low dimensional setting, i.e., d is a constant,…
Based on a coarse-grained model, we carry out molecular dynamics simulations to analyze the diffusion of a small tracer particle inside a cylindrical channel whose inner wall is covered with randomly grafted short polymeric chains. We…
We study spontaneous symmetry breaking in a one-dimensional driven two-species stochastic cellular automaton with parallel sublattice update and open boundaries. The dynamics are symmetric with respect to interchange of particles. Starting…
We address the question of the time needed by $N$ particles, initially located on the first sites of a finite 1D lattice of size $L$, to exit that lattice when they move according to a TASEP transport model. Using analytical calculations…
We investigate the disconnection time of a simple random walk in a discrete cylinder with a large finite connected base. In a recent article of A. Dembo and the author it was found that for large $N$ the disconnection time of…
Deep Learning architectures, and in particular Transformers, are conventionally viewed as a composition of layers. These layers are actually often obtained as the sum of two contributions: a residual path that copies the input and the…
In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output. Hence, this…
Cylindrical lattice diffusion limited aggregation (DLA), with a narrow width N, is solved for site-sticking conditions using a Markovian matrix method (which was previously developed for the bond-sticking case). This matrix contains the…
We study particle transport in a class of open channels of finite length, made of identical cells of connected open polygonal billiards with parallel boundaries. In these systems the Mean Square Displacement (MSD) grows in time faster than…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
A dynamical system is considered, which comprises an $n$-dimensional lattice $N_1 \times N_2 \times \dots \times N_n$ with periodic boundary conditions. Particles traverse this lattice following a variant of the Biham--Middleton--Levine…
Qubit lattice algorithm (QLA) simulations are performed for a two-dimensional (2D) spatially bounded pulse propagating onto a plane interface between two dielectric slabs. QLA is an initial value scheme that consists of a sequence of…
If a one-dimensional quantum lattice system is subject to one step of a reversible discrete-time dynamics, it is intuitive that as much "quantum information" as moves into any given block of cells from the left, has to exit that block to…