Results 81 to 90 of about 120 (114)

A Canonical Representation for Aggregated Markov Processes

open access: yes, 1998
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

open access: yes, 1996
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  

On the geometric ergodicity of hybrid samplers

open access: yes, 2003
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  

Card-cyclic-to-random shuffling with relabeling

open access: yes, 2014
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  

Mutation and Selection in Bacteria: Modelling and Calibration. [PDF]

open access: yesBull Math Biol, 2019
Bayliss CD   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy