getdocc05d. 201KB Jun 04 2011 12:04:55 AM
Teks penuh
Garis besar
Dokumen terkait
To do this, observe that the hermitian forms graph is the Cayley graph C ay ( G, S ), where G is the additive group of all hermitian matrices and the set S consists of all
The graph G is said to be determined by its signless Laplacian spectrum, if any graph having the same signless Laplacian spectrum as G is isomorphic to G..
Keywords: General state space Markov chains; f -regularity; Markov chain central limit theo- rem; Drazin inverse; fundamental matrix; asymptotic
For a recurrent random walk in a random environment on a general locally finite connected graph, the mixing measure is unique if there exists a mixing measure Q which is supported
One example of a graph model for obtaining a prescribed degree distribution is the so called configuration model – see Molloy and Reed (1995,1998) – where, given n vertices, each
It is expected that this model displays so-called self-organised critical behaviour as the lightning rate λ goes to zero.. If we start from any configuration with infinitely many
While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its bridge are the same in first order, this is not the case
Molloy, Very rapidly mixing Markov chains for 2∆-colourings and for independent sets in a 4-regular graph, Random Struc. Tetali, Mathematical aspects of mixing times in Markov
