13 citations · 13 across the 8 of their papers we have counts for
9 papers
On the use of Markov chains for epidemic modeling on networks
Sooyeong Kim, Jane Breen, Ekaterina Dudkina +2
We discuss various models for epidemics on networks that rely on Markov chains. Random walks on graphs are often used to predict epidemic spread and to investigate possible control…
Kemeny's constant for a graph with bridges
Jane Breen, Emanuele Crisostomi, Sooyeong Kim
In this paper, we determine a formula for Kemeny's constant for a graph with multiple bridges, in terms of quantities that are inherent to the subgraphs obtained upon removal of al…
Kemeny's constant for non-backtracking random walks
Jane Breen, Nolan Faught, Cory Glover +3
Kemeny's constant for a connected graph is the expected time for a random walk to reach a randomly-chosen vertex , regardless of the choice of the initial vertex. We extend…
Constructions of cospectral graphs with different zero forcing numbers
Aida Abiad, Boris Brimkov, Jane Breen +3
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show t…
Maximum spread of graphs and bipartite graphs
Jane Breen, Alex W. N. Riasanovsky, Michael Tait +1
Given any graph , the (adjacency) spread of is the maximum absolute difference between any two eigenvalues of the adjacency matrix of . In this paper, we resolve a pair o…
On node ranking in graphs
Ekaterina Dudkina, Michelangelo Bin, Jane Breen +9
The ranking of nodes in a network according to their ``importance'' is a classic problem that has attracted the interest of different scientific communities in the last decades. Th…