Conditioning properties of the stationary distribution for a Markov chain.
Kirkland, Steve (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Displaying similar documents to “A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain.”
Conditioning properties of the stationary distribution for a Markov chain.
Digraphs with large exponent.
Kirkland, S., Olesky, D.D., van den Driessche, P. (2000)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
An upper bound on algebraic connectivity of graphs with many cutpoints.
Kirkland, S. (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On the nullity of graphs.
Cheng, Bo, Liu, Bolian (2007)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
A variant on the graph parameters of Colin de Verdière: implications to the minimum rank of graphs.
Barioli, Francesco, Fallat, Shaun, Hogben, Leslie (2005)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On the identification of vertices using cycles.
Rosendahl, Petri (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An upper bound of the reachability index for a special class of positive 2-D systems.
Bailo, Esteban, Gelonch, Josep, Romero-Vivo, Sergio (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Extremizing algebraic connectivity subject to graph theoretic constraints.
Fallat, Shaun, Kirkland, Steve (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The maximal spectral radius of a digraph with edges.
Snellman, Jan (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Hall exponents of matrices, tournaments and their line digraphs
Richard A. Brualdi, Kathleen P. Kiernan (2011)
Czechoslovak Mathematical Journal
Similarity:
Let be a square -matrix. Then is a Hall matrix provided it has a nonzero permanent. The Hall exponent of is the smallest positive integer , if such exists, such that is a Hall matrix. The Hall exponent has received considerable attention, and we both review and expand on some of its properties. Viewing as the adjacency matrix of a digraph, we prove several properties of the Hall exponents of line digraphs with some emphasis on line digraphs of tournament (matrices). ...
A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.
Shen, Jian, Yuster, Raphael (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: