Related papers: On the number of walks on a regular Cayley tree
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
We continue the enumeration of plane lattice walks with small steps avoiding the negative quadrant, initiated by the first author in 2016. We solve in detail a new case, namely the king model where all eight nearest neighbour steps are…
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
In this paper, we first form a method to calculate the probability generating function of the total progeny of multitype branching process. As examples, we calculate probability generating function of the total progeny of the multitype…
Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically $C4^n/n^{3/4}$ many unordered sequences that occur as degree sequences of graphs. Combining limit theory for infinitely divisible…
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…
Let $G$ be a finitely generated group equipped with a finite symmetric generating set and the associated word length function $|\cdot |$. We study the behavior of the probability of return for random walks driven by symmetric measures $\mu$…
The set of random walks with different step sets (of short steps) in the quarter plane has provided a rich set of models that have profoundly different integrability properties. In particular, 23 of the 79 effectively different models can…
In the present paper, we introduce a new approach, relying on the Galois theory of difference equations, to study the nature of the generating series of walks in the quarter plane. Using this approach, we are not only able to recover many…
Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold…
We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…
A widely studied model for generating sequences is to ``evolve'' them on a tree according to a symmetric Markov process. We prove that model trees tend to be maximally ``far apart'' in terms of variational distance.
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…
We compute the cone types of the Cayley graph of the modular group $\mathrm{PSL}(2,\mathbf{Z})$ associated with the standard system of generators ${\small\left\{\left(\begin{smallmatrix} 0 & -1 \\ 1 & 0…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…