Related papers: Carries, Shuffling and An Amazing Matrix

In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…

The concepts of probability, statistics and stochastic theory are being successfully used in structural engineering. Markov Chain modelling is a simple stochastic process model that has found its application in both describing stochastic…

We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…

Building on previous work by four of us (ABCN), we consider further generalizations of Warrington's juggling Markov chains. We first introduce "multispecies" juggling, which consist in having balls of different weights: when a ball is…

We demonstrate the connection between an operator's matrix element distribution and entangling power via numerical simulations of random, pseudo-random, and quantum chaotic operators. Creating operators with a random distribution of matrix…

In networking applications, one often wishes to obtain estimates about the number of objects at different parts of the network (e.g., the number of cars at an intersection of a road network or the number of packets expected to reach a node…

Sampling uniform simple graphs with power-law degree distributions with degree exponent $\tau\in(2,3)$ is a non-trivial problem. We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model…

The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the…

Markov chain Monte Carlo algorithms are invaluable tools for exploring stationary properties of physical systems, especially in situations where direct sampling is unfeasible. Common implementations of Monte Carlo algorithms employ…

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…

We test a Markov chain approximation to the segment description (Li, 2007) of chaos (and turbulence) on a tent map, the Minea system, the H\'enon map, and the Lorenz system. For the tent map, we compute the probability transition matrix of…

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…

Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

A multiplicative cascade can be thought of as a randomization of a measure on the boundary of a tree, constructed from an iid collection of random variables attached to the tree vertices. Given an initial measure with certain regularity…

We present a closed-form, computable expression for the expected number of times any transition event occurs during the transient phase of a reducible Markov chain. Examples of events include time to absorption, number of visits to a state,…

Motility is characteristic of life, but a common basis for movement has remained to be identified. Diverse systems in motion shift between two states depending on interactions that turnover at the rate of an applied cycle of force. Although…