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 PST in a quantum information-theoretic ...

Given an irreducible stochastic matrix T, Kemeny's constant k(T) measures the expected number of steps from any initial state to a randomly chosen final state, and is thus regarded as an indicator of the overall transit ...

We consider Laplacian fractional revival between two vertices of a graph $X$. Assume that it occurs at time $\tau$ between vertices 1 and 2. We prove that for the spectral decomposition $L = \sum_{r=0}^q \theta_rE_r$ of ...

A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain – that is, a path on n vertices. Unweighted paths are of limited use, and so a natural generalization is to consider ...

Random walk centrality (equivalently, the accessibility index) for the states of a time-homogeneous irreducible Markov chain on a finite state space is considered. It is known that the accessibility index for a particular ...

We consider a simple metapopulation model with explicit movement of individuals between patches, in which each patch is either a source or a sink. We prove that similarly to the case of patch occupancy metapopulations with ...