Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CPC
2004

favoriteEmaildiscussreport

83views more CPC 2004»

Embedding a Markov Chain into a Random Walk on a Permutation Group

13 years 4 months ago

Embedding a Markov Chain into a Random Walk on a Permutation Group

Download oz.berkeley.edu

Using representation theory, we obtain a necessary and sufficient condition for a discrete

Steven N. Evans

Real-time Traffic

CPC 2004 | Discretetime Markov Chain | Finite State Space | Sufficient Condition |

claim paper

Related Content

» Network Inference from CoOccurrences

» An Extension of Geiringers Theorem for a Wide Class of Evolutionary Search Algorithms

» Perfectly Secure Steganography Capacity Error Exponents and Code Constructions

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CPC
Authors	Steven N. Evans

Comments (0)