In this topical review we consider stochastic processes under resetting, which have attracted
a lot of attention in recent years. We begin with the simple example of a diffusive particle …

The study of diffusion with preferential returns to places visited in the past has attracted
increased attention in recent years. In these highly non-Markov processes, a standard …

We study two models of growing recursive trees. For both models, the tree initially contains a
single vertex u 1 and at each time n≥ 2 a new vertex un is added to the tree and its parent is …

This paper deals with different models of random walks with a reinforced memory of
preferential attachment type. We consider extensions of the Elephant Random Walk …

Weighted recursive trees are built by adding successively vertices with predetermined
weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to …

We study the relaxation of a diffusive particle confined in an arbitrary external potential and
subject to a non-Markovian resetting protocol. With a constant rate r, a previous time τ …

We study a generalisation of the random recursive tree (RRT) model and its multigraph
counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a …

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" …

In a step reinforced random walk, at each integer time and with a fixed probability p∈(0,1),
the walker repeats one of his previous steps chosen uniformly at random, and with …

In this paper we prove a scaling limit result for the component of the root in the Wired
Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the …