Related papers: A camel with a less strict diet
Active cellular transport is a fundamental mechanism for protein and vesicle delivery, cell cycle and molecular degradation. Viruses can hijack the transport system and use it to reach the nucleus. Most transport processes consist of…
In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the Elephant random walk(ERW), which was introduced by Schuetz and Trimper in 2004, the next step always depends on the whole path so far.…
Be $X_t$ a random walk. We study its span $S$, i.e. the size of the domain visited up to time $t$. We want to know the probability that $S$ reaches $1$ for the first time, as well as the density of the span given $t$. Analytical results are…
We analyze the Hunter vs Rabbit game on graph, which is a kind of model of communication in an adhoc mobile network. Let $G$ be a cycle graph with $N$ nodes. The hunter can move from a vertex to another vertex on the graph along an edge.…
We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…
We examine the scaling law $B \propto M^{\alpha}$ which connects organismal metabolic rate $B$ with organismal mass $M$, where $\alpha$ is commonly held to be 3/4. Since simple dimensional analysis suggests $\alpha=2/3$, we consider this to…
We study how conditioning affects the long-term behavior of the Elephant Random Walk, focusing on its first return to the origin, namely, the time it takes to forget the training. When the walker is conditioned to be at position $n$ at time…
We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…
Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…
We study the Bergman determinantal point process from a theoretical point of view motivated by its simulation. We construct restricted and restricted-truncated variants of the Bergman kernel and show optimal transport inequalities involving…
In this paper, we propose a general hidden state random walk model to describe the movement of an animal that takes into account movement taxis with respect to features of the environment. A circular-linear process models the direction and…
A novel algorithm is proposed to solve the sample-based optimal transport problem. An adversarial formulation of the push-forward condition uses a test function built as a convolution between an adaptive kernel and an evolving probability…
Self-activation coupled to a transport mechanism results in traveling waves that describe polymerization reactions, forest fires, tumor growth, and even the spread of epidemics. Diffusion is a simple and commonly used model of particle…
We analyze a model for a walker moving on a ratchet potential. This model is motivated by the properties of transport of motor proteins, like kinesin and myosin. The walker consists of two feet represented as two particles coupled…
We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We study a model of market economics wherein the $(n+1)$-st customer, for each $n\geqslant N$, with $N$ being a prespecified positive integer, draws a sample of (random) size $K_{n}$, either with replacement or without, from the customers…
For any initial configuration of fewer than N/2 cars the BML model will self organize to attain speed one. On the other hand, there is a configuration of size m in which no car can move if and only if m is at least 2N.
The monkey walk is a stochastic process defined as the trajectory of a walker that moves on $\mathbb R^d$ according to a Markovian generator, except at some random "relocation" times at which it jumps back to its position at a time sampled…
Allometric scaling is one of the most pervasive laws in biology. Its origin, however, is still a matter of dispute. Recent studies have established that maximum metabolic rate scales with an exponent larger than that found for basal…