Searcharxiv⌕ Search

arXiv subjects

Cecilie Olesen Recke

Publications and source records attributed to Cecilie Olesen Recke.

3 recordsLinked to original sources

Identifiability and Estimation in Continuous Lyapunov Models

Cross-sectional observations from a dynamical system can be modeled via steady-state distributions of Markov processes. The major challenge is then to determine whether the process parameters can be identified and estimated from the steady-state distributions. We study this problem for continuous Lyapunov models that arise as steady-state distributions of the solution to a multivariate stochastic differential equation, whose linear drift matrix is parametrized by a directed graph. We derive equations for the cumulant tensors of any order for this distribution, which generalize the well-known covariance Lyapunov equation. Under a non-Gaussianity assumption we prove generic identifiability of the drift matrix for any connected graph using the equations for the higher-order cumulants. Based on the identifiability result, we propose a new semiparametric estimator of the drift matrix, and we derive its asymptotic distribution. A simulation study demonstrates the asymptotic validity of the estimator but shows that it is only accurate for relatively large sample sizes, illustrating the hardness of the unconstrained estimation problem.

math.ST↗

Identifiability in Graphical Discrete Lyapunov Models

In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the components of the random vector. This combinatorial framework naturally allows for cycles in the graph structure. We focus on the fundamental problem of identifying the entries of the parameter matrix. In contrast to the classical setting, we assume non-Gaussian error terms, which allows us to use the higher-order cumulants of the model. In this setup, we show generic identifiability for directed acyclic graphs with self-loops at each vertex and show how to express the parameters as a rational function of the cumulants. Furthermore, we establish local identifiability for all directed graphs containing self loops at each vertex and no isolated vertices. Finally, we provide first results on the defining equations of the models, showing model equivalence for certain graphs and paving the way towards structure learning.

math.ST↗

Completions to Discrete Probability Distributions in Log-linear Models

Completion problems, of recovering a point from a set of observed coordinates, are abundant in applications to image reconstruction, phylogenetics, and data science. We consider a completion problem coming from algebraic statistics: to describe the completions of a point to a probability distribution lying in a given log-linear model. When there are finitely many completions, we show that these points either have a unique completion or two completions to the log-linear model depending on the set of observed coordinates. We additionally describe the region of points which have a completion to the log-linear model.

math.ST↗