Related papers: Self-similarity and random walks
Coalescent theory is the study of random processes where particles may join each other to form clusters as time evolves. These notes provide an introduction to some aspects of the mathematics of coalescent processes and their applications…
A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
We study the sequence entropy for amenable group actions and investigate systematically spectrum and several mixing concepts via sequence entropy both in measure-theoretic dynamical systems and topological dynamical systems. Moreover, we…
We consider a trace theorem for self-similar Dirichlet forms on self-similar sets to self-similar subsets. In particular, we characterize the trace of the domains of Dirichlet forms on the Sierpinski gaskets and the Sierpinski carpets to…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
The one-step replica symmetry breaking cavity method is proposed as a new tool to investigate large deviations in random graph ensembles. The procedure hinges on a general connection between negative complexities and probabilities of rare…
We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…
We calculate the spectral dimension of a wide class of tree-like fractals by solving the random walk problem through a new analytical technique, based on invariance under generalized cutting-decimation transformations. These fractals are…
This celebratory article contains a personal and idiosyncratic selection of a few open problems in discrete probability theory. These include certain well known questions concerning Lorentz scatterers and self-avoiding walks, and also some…
We establish the almost sure validity of the multifractal formalism for R^d-valued branching random walks on the whole relative interior of the natural convex domain of study.
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
We study branching processes in an i.i.d. random environment, where the associated random walk is of the oscillating type. This class of processes generalizes the classical notion of criticality. The main properties of such branching…
We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…
Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…
We analyze a general class of reversible aggregate-reorganization processes. These processes are shown to exhibit globally attracting equilibrium distributions, which are \textit{universal}, i.e. identical for large classes of models.…
We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…