Related papers: Directed random walks on hierarchic trees with con…
In this work, we employ a field-theoretic renormalization group approach to study a paradigmatic model of directed percolation. We focus on the perturbative calculation of the equation of state, extending the analysis to the three-loop…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.
We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
We formulate the generalized master equation for a class of continuous time random walks in the presence of a prescribed deterministic evolution between successive transitions. This formulation is exemplified by means of an…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…
In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is…
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder,…
We apply Feshbach-Krein-Schur renormalization techniques in the hierarchical Anderson model to establish a criterion on the single-site distribution which ensures exponential dynamical localization as well as positive inverse participation…
A directed percolation process with two symmetric particle species exhibiting exclusion in one dimension is investigated numerically. It is shown that if the species are coupled by branching ($A\to AB$, $B\to BA$) a continuous phase…
We consider the mutation--selection differential equation with pairwise interaction (or, equivalently, the diploid mutation--selection equation) and establish the corresponding ancestral process, which is a random tree and a variant of the…