Related papers: Walks and the spectral radius of graphs
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic…
We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the inverse spectral radius of the appropriate Hashimoto matrix…
A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…
We prove that the spectral gap of a finite planar graph $X$ is bounded by $\lambda_1(X)\le C(\frac{\log(\diam X)}{\diam X})^2$ where $C$ depends only on the degree of $X$. We then give a sequence of such graphs showing the the above…
We define the co-spectral radius of inclusions $\mathcal{S}\leq \mathcal{R}$ of discrete, probability measure-preserving equivalence relations, as the sampling exponent of a generating random walk on the ambient relation. The co-spectral…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
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…
The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let $\mathcal{C}_{n, e}$ be the set of all the connected simple graphs with $n$ vertices and $n - 1 + e$ edges. Here, we solve the spectral…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…
Let G be a graph of n vertices and m edges, and let G has no cycles of length 4. We give upper bounds on the adjacency spectral radius of G in terms of n and m.
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…
In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
The spectral radius and rank of a graph are defined to be the spectral radius and rank of its adjacency matrix, respectively. It is an important problem in spectral extremal graph theory to determine the extremal graph that has the maximum…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…