Results 81 to 90 of about 120 (114)
A Canonical Representation for Aggregated Markov Processes
A deterministic function of a Markov process is called an aggregated Markov process. We give necessary and sufficient conditions for the equivalence of continuous-time aggregated Markov processes.
Bret Larget
core
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
We give efficient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest.
Frank Ruskey +2 more
core
How Long does it Take to Train an Elephant Random Walk. [PDF]
Fang Z.
europepmc +1 more source
Genome rearrangements as double coset Markov chains. [PDF]
Simper MA.
europepmc +1 more source
On the geometric ergodicity of hybrid samplers
In this paper, we consider the random scan symmetric random walk Metropolis algorithm (RSM) on R . This algorithm performs a Metropolis step on just one coordinate at a time (as opposed to the full dimensional symmetric Random walk Metropolis algorithm,
Fort, G. +7 more
core
Average height for Abelian sandpiles and the looping constant on Sierpiński graphs. [PDF]
Heizmann N, Kaiser R, Sava-Huss E.
europepmc +1 more source
NETWORK-ENSEMBLE COMPARISONS WITH STOCHASTIC REWIRING AND VON NEUMANN ENTROPY. [PDF]
Li Z, Mucha PJ, Taylor D.
europepmc +1 more source
Card-cyclic-to-random shuffling with relabeling
The card-cyclic-to-random shuffle is the card shuffle where the n cards are labeled 1,..., n according to their starting positions. Then the cards are mixed by first picking card 1 from the deck and reinserting it at a uniformly random position, then ...
Jonasson, Johan, Johan Jonasson
core
Some Open Questions About the Anisotropic Random Walks. [PDF]
Csáki E, Földes A.
europepmc +1 more source
Mutation and Selection in Bacteria: Modelling and Calibration. [PDF]
Bayliss CD +3 more
europepmc +1 more source

