scispace - formally typeset
K

Kristina Lisa Klinkner

Researcher at Carnegie Mellon University

Publications -  9
Citations -  300

Kristina Lisa Klinkner is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Spike train & Entropy rate. The author has an hindex of 8, co-authored 9 publications receiving 292 citations. Previous affiliations of Kristina Lisa Klinkner include University of Michigan.

Papers
More filters
Journal ArticleDOI

Automatic filters for the detection of coherent structure in spatiotemporal systems.

TL;DR: Two approaches to automatically filter the changing configurations of spatial dynamical systems and extract coherent structures are presented, a modification of the local Lyapunov exponent approach suitable to cellular automata and other discrete spatial systems and a more traditional approach based on an order parameter and free energy is compared.
Journal ArticleDOI

The computational structure of spike trains

TL;DR: In this paper, causal state models (CSMs), the minimal hidden Markov models or stochastic automata capable of generating statistically identical time series, are used to quantify both the generalizable structure and the idiosyncratic randomness of the spike train.
Journal ArticleDOI

The Computational Structure of Spike Trains

TL;DR: The methods presented here complement more traditional spike train analyses by describing not only spiking probability and spike train entropy, but also the complexity of a spike train's structure.
Posted Content

Discovering Functional Communities in Dynamical Networks

TL;DR: This paper lays out the problem of discovering functional communities, and describes an approach to doing so that combines recent work on measuring information sharing across stochastic networks with an existing and successful community-discovery algorithm for weighted networks.
Book ChapterDOI

Discovering functional communities in dynamical networks

TL;DR: In this article, the authors lay out the problem of discovering functional communities and describe an approach to doing so, which combines recent work on measuring information sharing across stochastic networks with an existing and successful community-discovery algorithm for weighted networks.