Found 4 document(s)
Page 1 of 1
-
We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix P the mass is essentially concentrated on few en...
-
Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each ...
-
A matching on a finite graph G = (V,E) is a collection of pairwise nonadjacent edges M in E....
-
Sur un graphe fini, il existe de nombreux objets combinatoires dignes d'intérêt : ses arbres couvrants, ses appariements, ses ensembles stables, ses cycles et ainsi de suite....