Related papers: How not to scramble a Rubik's cube
The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularised by adding a…
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…
We establish a general perturbative method to prove entropic Ricci curvature bounds for interacting stochastic particle systems. We apply this method to obtain curvature bounds in several examples, namely: Glauber dynamics for a class of…
In this paper we consider a telegraph equation with time-dependent coefficients, governing the persistent random walk of a particle moving on the line with a time-varying velocity $c(t)$ and changing direction at instants distributed…
Let $(X_n \colon n\in\Z)$ be a two-sided recurrent Markov chain with fixed initial state $X_0$ and let $\nu$ be a probability measure on its state space. We give a necessary and sufficient criterion for the existence of a non-randomized…
We present experimental observations and numerical simulations of a wrinkling instability that occurs at sufficiently high strain rates in the trembling regime of vesicle dynamics in steady linear flow. Spectral and statistical analysis of…
In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick and place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up. This…
We consider symmetric trap models in the d-dimensional hypercube whose ordered mean waiting times, seen as weights of a measure in the natural numbers, converge to a finite measure as d diverges, and show that the models suitably…
A dynamical model is proposed for isotropic turbulence driven by steady forcing that yields a viscosity independent dynamics for the small-scale (inertial) regime. This reproduces the Kolmogorov spectrum for the two-point velocity…
Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the…
Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantum scrambling, is the key to resolving various conundrums in…
We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well…
The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is…
How quantum information is scrambled in the global degrees of freedom of non-equilibrium many-body systems is a key question to understand local thermalization. Here we propose that the scaling of the mutual information between two…
We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…
We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…
The Transmission Control Protocol (TCP) utilizes congestion avoidance and control mechanisms as a preventive measure against congestive collapse and as an adaptive measure in the presence of changing network conditions. The set of available…
We explore the complexity of computing the optimal pebbling number and pebbling number of a graph. We show that deciding whether the optimal pebbling number of G is at most k is NP-complete and deciding whether the pebbling number of G is…
The tripartite information is an observable-independent measure for scrambling and delocalization of information. Therefore one can expect that the tripartite information is a good observable-independent indicator for distinguishing between…
We propose and analyze a versatile and efficient multiparameter quantum sensing protocol, which simultaneously estimates many non-commuting and time-dependent signals that are coherently or incoherently coupled to sensing particles. Even in…