activity
20152022
most citedAn open set of embeddable matrices whose principal logarithm is not a Markov generator

1 citations · 1 across the 2 of their papers we have counts for

collaborators

6 papers

q-bio.PE2022

Embeddability of centrosymmetric matrices capturing the double-helix structure in natural and synthetic DNA

Muhammad Ardiyansyah, Dimitra Kosta, Jordi Roca-Lacostena

In this paper, we discuss the embedding problem for centrosymmetric matrices, which are higher order generalizations of the matrices occurring in Strand Symmetric Models. These mod…

math.PR2020★ 1 cited

An open set of embeddable matrices whose principal logarithm is not a Markov generator

Marta Casanellas, Jesús Fernández-Sánchez, Jordi Roca-Lacostena

A Markov matrix is embeddable if it can represent a homogeneous continuous-time Markov process. It is well known that if a Markov matrix has real and pairwise-different eigenvalues…

math.PR2020

The embedding problem for Markov matrices

Marta Casanellas, Jesús Fernández-Sánchez, Jordi Roca-Lacostena

Characterizing whether a Markov process of discrete random variables has an homogeneous continuous-time realization is a hard problem. In practice, this problem reduces to deciding…

q-bio.PE2019

Embeddability and rate identifiability of Kimura 2-parameter matrices

Marta Casanellas, Jesús Fernández-Sánchez, Jordi Roca-Lacostena

Deciding whether a Markov matrix is embeddable (i.e. can be written as the exponential of a rate matrix) is an open problem even for matrices. We study the embedding pr…

q-bio.PE2017

Embeddability of Kimura 3ST Markov matrices

Jordi Roca-Lacostena, Jesús Fernández-Sánchez

In this note, we characterize the embeddability of generic Kimura 3ST Markov matrices in terms of their eigenvalues. As a consequence, we are able to compute the volume of such mat…

cs.AI2015

Sufficient and necessary conditions for Dynamic Programming in Valuation-Based Systems

Jordi Roca-Lacostena, Jesus Cerquides, Marc Pouly

Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some no…