In the current study we examined the effects of training in adult rats with a cervical spinal cord injury (SCI). One group of rats received 6 weeks of training in a single pellet reaching taskâ€¦ (More)

For an irreducible stochastic matrix T , the Kemeny constant K(T ) measures the expected time to mixing of the Markov chain corresponding to T . Given a strongly connected directed graph D, weâ€¦ (More)

For a primitive stochastic matrix S, upper bounds on the second largest modulus of an eigenvalue of S are very important, because they determine the asymptotic rate of convergence of the sequence ofâ€¦ (More)

The main problem of interest is to investigate how the algebraic connectivity o f a weighted connected graph behaves when the graph is perturbed by removing one or more connected components at a xedâ€¦ (More)

The PageRank updating algorithm proposed by Langville and Meyer is a special case of an iterative aggregation/disaggregation (SIAD) method for computing stationary distributions of very large Markovâ€¦ (More)

The spread s(M) of an n Ã— n complex matrix M is s(M) = maxij |Î»i âˆ’ Î»j |, where the maximum is taken over all pairs of eigenvalues of M , Î»i, 1 â‰¤ i â‰¤ n, [9] and [11]. Based on this concept, Gregory etâ€¦ (More)

The iterative aggregation/disaggregation (IAD) method is an improvement of the PageRank algorithm used by the search engine Google to compute stationary probabilities of very large Markov chains. Inâ€¦ (More)