相关论文: A note on random walks in a hypercube

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…

We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…

We analyze hitting times of simple random walk on realizations of the stochastic block model. We show that under some natural assumptions the hitting time averaged over the target vertex asymptotically almost surely given by $N(1+o(1))$. On…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…

We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

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

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…

We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…