1 citations · 1 across the 2 of their papers we have counts for
6 papers
Clusters in Markov Chains via Singular Vectors of Laplacian Matrices
Sam Cole, Steve Kirkland
Suppose that is a stochastic matrix. We propose an algorithm for identifying clusters in the Markov chain associated with . The algorithm is recursive in nature, and in orde…
The Karpelevič Region Revisited
Stephen Kirkland, Thomas Laffey, Helena Smigoc
We consider the Karpelevič region consisting of all eigenvalues of all stochastic matrices of order . We provide an alternative characterisation of $Θ_n…
On Kemeny's constant for trees with fixed order and diameter
Lorenzo Ciardo, Geir Dahl, Steve Kirkland
Kemeny's constant of a connected graph is a measure of the expected transit time for the random walk associated with . In the current work, we consider the case when…
Complex Hadamard Diagonalisable Graphs
Ada Chan, Shaun Fallat, Steve Kirkland +3
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex…
The Complexity of Power Graphs Associated With Finite Groups
S. Kirkland, A. R. Moghaddamfar, S. Navid Salehy +2
The power graph of a finite group is the graph whose vertex set is , and two elements in are adjacent if one of them is a power of the other. The purpos…
Switching and partially switching the hypercube while maintaining perfect state transfer
Steve Kirkland, Sarah Plosker, Xiaohong Zhang
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to P…