Related papers: Counting Paths in Graphs
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
Let $G$ be a graph on $n$ vertices, with complement $\overline{G}$. The spectral gap of the transition probability matrix of a random walk on $G$ is used to estimate how fast the random walk becomes stationary. We prove that the larger…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
The traditional complex network approach considers only the shortest paths from one node to another, not taking into account several other possible paths. This limitation is significant, for example, in urban mobility studies. In this short…
In this paper, we derive the large deviations principle for the Potts model on the complete bipartite graph $K_{n,n}$ as $n$ increases to infinity. Next, for the Potts model on $K_{n,n}$, we provide an extension of the method of aggregate…
We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the labeling occurs increasingly whenever an unlabeled vertex is…
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
Recently, Mansour and Shattuck related the total number of humps in all of the $(k, a)$-paths of order $n$ to the number of super $(k, a)$-paths, which generalized previous results concerning the cases when $k = 1$ and $a = 1$ or $a =…
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
We introduce a notion of the \emph{crux} of a graph $G$, measuring the order of a smallest dense subgraph in $G$. This simple-looking notion leads to some generalisations of known results about cycles, offering an interesting paradigm of…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
With the recent rise in the amount of structured data available, there has been considerable interest in methods for machine learning with graphs. Many of these approaches have been kernel methods, which focus on measuring the similarity…