2000 character limit reached
Transition matrix from a random walk
Published 5 May 2016 in physics.gen-ph | (1605.04282v3)
Abstract: Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is a kind of reverse application of the usual ergodicity and is tested by using a transition matrix to produce a path and then using that path to create the estimate. The two matrices and their predictions are then compared. A variety of situations test the method, random matrices, metastable configurations (for which ergodicity often does not apply) and explicit violation of detailed balance.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.