Related papers: Generalized solution for the Herman Protocol Conje…
We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent…
A trigonometrically approximated maximum likelihood estimation for $\alpha$-stable laws is proposed. The estimator solves the approximated likelihood equation, which is obtained by projecting a true score function on the space spanned by…
This paper introduces a new algorithm for numerically computing equilibrium (i.e. stationary) distributions for Markov chains and Markov jump processes with either a very large finite state space or a countably infinite state space. The…
We derive an equality for non-equilibrium statistical mechanics in finite-dimensional quantum systems. The equality concerns the worst-case work output of a time-dependent Hamiltonian protocol in the presence of a Markovian heat bath. It…
We present a novel kernel over the space of probability measures based on the dual formulation of optimal regularized transport. We propose an Hilbertian embedding of the space of probabilities using their Sinkhorn potentials, which are…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…
The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be…
We consider the totally asymmetric exclusion process on a ring in discrete time with the backward-ordered sequential update and particle-dependent hopping probabilities. Using a combinatorial treatment of the Bethe ansatz, we derive the…
According to the eigenstate thermalization hypothesis (ETH), the eigenstate-to-eigenstate fluctuations of expectation values of local observables should decrease with increasing system size. In approaching the thermodynamic limit - the…
Population protocols are a model of distributed computing, in which $n$ agents with limited local state interact randomly, and cooperate to collectively compute global predicates. An extensive series of papers, across different communities,…
We elaborate a scheme of trapping-expulsion management (TEM), in the form of the quadratic potential periodically switching between confinement and expulsion, as a means of stabilization of two-dimensional dynamical states against the…
Asking for the optimal protocol of an external control parameter that minimizes the mean work required to drive a nano-scale system from one equilibrium state to another in finite time, Schmiedl and Seifert ({\it Phys. Rev. Lett.} {\bf 98},…
We present an algorithm for the problem of linear distributed estimation of a parameter in a network where a set of agents are successively taking measurements. The approach considers a roaming token in a network that carries the estimate,…
Understanding equilibration times in closed quantum systems is essential for characterising their approach to equilibrium. Chaotic many-body systems are paradigmatic in this context: they are expected to thermalise according to the…
The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth…
A variety of mathematical tools have been developed for predicting the spreading patterns in a number of varied environments including infectious diseases, computer viruses, and urgent messages broadcast to mobile agent (e.g., humans,…
We show that a bounded, isolated quantum system of many particles in a specific initial state will approach thermal equilibrium if the energy eigenfunctions which are superposed to form that state obey {\it Berry's conjecture}. Berry's…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
We study a special inhomogeneous quantum network consisting of a ring of $M$ pseudo-spins (here $M = 4$) sequentially coupled to one and the same central spin under the influence of given pulse sequences (quantum gate operations). This…
We study the following synchronous process that we call "repeated balls-into-bins". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen…