Related papers: A camel with a less strict diet

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

It is well known that martingale transport plans between marginals $\mu\neq\nu$ are never given by Monge maps -- with the understanding that the map is over the first marginal $\mu$, or forward in time. Here, we change the perspective, with…

We consider two natural models of random walks on a module $V$ over a finite commutative ring $R$ driven simultaneously by addition of random elements in $V$, and multiplication by random elements in $R$. In the coin-toss walk, either one…

The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

We study chemotaxis in a porous medium using as a model a biased ("hungry") random walk on a percolating cluster. In close resemblance to the 1980s arcade game Pac-Man, the hungry random walker consumes food, which is initially distributed…

Given a ring $R$ with center $Z(R)$, we say a linear map $f:R\rightarrow R$ is commuting if $[f(x),x]=0$ for all $x\in R$. Such a map has a standard form if there exists $\lambda\in R$ and additive $\mu:R\rightarrow Z(R)$ such that…

We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two bins uniformly at random and place a ball in the least loaded bin. It is…

Let $\{A, B, C\}$ be a partition of a sample space $\Omega$. For a random walk $S_n = x + \sum_{j=1}^n X_j$ starting at $x \in A$, we find estimates for the Green's function $G_{A \cup B}(x,y)$ and the hitting time $E^x(T_C)$ for $x, y \in…

The Lonely Runner Conjecture of Wills and Cusick states that if $k+1$ runners start running at distinct constant speeds around a unit-length circular track, then for each runner there is a time when he/she is at least $1/(k+1)$ away from…

This paper studies a variant of ramified/branched optimal transportation problems. Given the distributions of production capacities and market sizes, a firm looks for an allocation of productions over factories, a distribution of sales…

When studying unconstrained behaviour and allowing mice to leave their cage to navigate a complex labyrinth, the mice exhibit foraging behaviour in the labyrinth searching for rewards, returning to their home cage now and then, e.g. to…

Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…

Thanks to recent technological advances, it is now possible to track with an unprecedented precision and for long periods of time the movement patterns of many living organisms in their habitat. The increasing amount of data available on…

We introduce a basic model for human mobility that accounts for the different dynamics arising from individuals embarking on short trips (and returning to their home locations) and individuals relocating to a new home. The differences…

We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomial time algorithm to compute the divisorial gonality of…

A theoretical calculation is presented to describe the confined motion of transmembrane molecules in cell membranes. The study is analytic, based on Master equations for the probability of the molecules moving as random walkers, and leads…

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

The transport by molecular motors along cytoskeletal filaments is studied theoretically in the presence of static defects. The movements of single motors are described as biased random walks along the filament as well as binding to and…

We describe a mechanical device which can be used as an analog computer to solve the transportation problem. In practice this device is simulated by a numerical algorithm. Tests show that this algorithm is 60 times faster than a current…