相关论文: Almost Sure Recurrence of the Simple Random Walk P…

We investigate the paramater of the average range of $M$-Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…

In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.

A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…

Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

Given a discrete random walk on a finite graph $G$, the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step $t$.%These sets induce subgraphs of the underlying graph.…

Inspired by Benjamini et al (Ann. Inst. H. Poincar\'{e} Probab. Stat. 2010) and Windisch (Electron. J. Probab. 2010), we consider the entropy of the random walk range formed by a simple random walk on a discrete group. It is shown in this…

Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…

We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…

Let $c\in (0, 1]$ be a real number and let $n$ be a sufficiently large integer. We prove that every $n$-vertex $c n$-regular graph $G$ contains a collection of $\lfloor 1/c \rfloor$ paths whose union covers all but at most $o(n)$ vertices…

Analyzing social graphs with limited data access is challenging for third-party researchers. To address this challenge, a number of algorithms that estimate structural properties via a random walk have been developed. However, most existing…

We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…

Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random walks on dynamic graphs also have been investigated actively in…

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…

Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we…

We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. We prove that any such graph is virtually an expander and has no small separator. This answers a question of Pak [SODA,…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Graph sampling is a technique to pick a subset of vertices and/ or edges from original graph. Among various graph sampling approaches, Traversal Based Sampling (TBS) are widely used due to low cost and feasibility for many cases, in which…