Markov chains in a Dirichlet environment and hypergeometric integrals (Q2583812): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Edge oriented reinforced random walks and RWRE / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random walks in a Dirichlet environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arrangements and hypergeometric integrals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph / rank | |||
Normal rank | |||
Latest revision as of 15:25, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Markov chains in a Dirichlet environment and hypergeometric integrals |
scientific article |
Statements
Markov chains in a Dirichlet environment and hypergeometric integrals (English)
0 references
18 January 2006
0 references
The author examines the conjecture posed by \textit{R. Pemantle} and \textit{A. M. Stacey} [Ann. Probab. 29, No.~4, 1563--1590 (2001; Zbl 1013.60078)] that the edge adding/removing does not affect the critical value of the intensity of the contact process on a graph. He proves that the conjecture is true for graph being vertex-transitive.
0 references
random walk
0 references
reinforced random walk
0 references
hypergeometric integral
0 references
Gauss-Manin connection
0 references
