✦ LIBER ✦

Markov Chains on Graphs and Brownian Motion

✍ Scribed by Nathanaël Enriquez; Yuri Kifer

Book ID: 110297551
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 158 KB
Volume: 14
Category: Article
ISSN: 0894-9840
DOI: 10.1023/a:1011119932045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumerating graphs and Brownian motion

✍ Joel Spencer 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

fixed) are shown to be moments of the mean distance from the origin in a certain restricted Brownian motion.

Brownian motion and quasi-Markov process

Brownian motion and quasi-Markov processes

✍ T.W. Marshall 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Brownian motion and quasi-markov process

Brownian motion and quasi-markov processes II

✍ Trevor W. Marshall; Pierre Claverie 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Hurst exponents, Markov processes, and f

Hurst exponents, Markov processes, and fractional Brownian motion

✍ Joseph L. McCauley; Gemunu H. Gunaratne; Kevin E. Bassler 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 180 KB

On the Markov Equivalence of Chain Graph

On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

✍ Steen A. Andersson; David Madigan; Michael D. Perlman 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

On Markov Chains for Randomly H-Coloring

On Markov Chains for Randomly H-Coloring a Graph

✍ Colin Cooper; Martin Dyer; Alan Frieze 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let H = W F be a graph without multiple edges, but with the possibility of having loops. Let G = V E be a simple graph. A homomorphism c is a map c V → W with the property that v w ∈ E implies that c v c w ∈ F. We will often refer to c v as the color of v and c as an H-coloring of G. We consider the