Related papers: Upper Bounds For Hitting Times Of Random Walks On …
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…
In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…
Estimating numerically the spectral radius of a random walk on a nonamenable graph is complicated, since the cardinality of balls grows exponentially fast with the radius. We propose an algorithm to get a bound from below for this spectral…
The performance of distributed averaging depends heavily on the underlying topology. In various fields, including compressed sensing, multi-party computation, and abstract graph theory, graphs may be expected to be free of short cycles,…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
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 study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all vertices of the graph. It is known that the cover time of any finite connected $n$-vertex graph is at least…
We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…
The main topic considered is maximizing the number of cycles in a graph with given number of edges. In 2009, Kir\'aly conjectured that there is constant $c$ such that any graph with $m$ edges has at most $(1.4)^m$ cycles. In this paper, it…
Let $X$ be a continuous time random walk on a weighted graph. Given the on-diagonal upper bounds of transition probabilities at two vertices $x_1$ and $x_2$, we use an adapted metric initiated by Davies, and obtain Gaussian upper estimates…
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order…
In this paper, following the paper ``On the average hitting times of the squares of cycles,'' we provide an explicit formula for the average hitting times of a simple random walk on a directed graph with $N$ vertices, where the graph…