On the public citation graph
Matrix Analysis of Identifiability of Some Finite Markov Models
0 signed · 20 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02289345openalex-snapshot
Derivations of Learning Statistics from Absorbing Markov Chains
inferredcites →https://doi.org/10.1007/bf02289509openalex-snapshot
Derivation of Learning Process Statistics for a General Markov Model
inferredcites →https://doi.org/10.1007/bf02289599openalex-snapshot
Markovian Processes with Identifiable States: General Considerations and Application to All-or-None Learning
inferredcites →https://doi.org/10.1007/bf02290151openalex-snapshot
Comments on “Markovian Processes with Identifiable States: General Considerations and Applications to All-or-None Learning”
inferredcites →https://doi.org/10.1007/bf02290152openalex-snapshot
Identifiability and Statistical Properties of Two-Stage Learning with no Successes in the Initial Stage
inferredcites →https://doi.org/10.1007/bf02290602openalex-snapshot
An Analysis of Some Conditions for Representing N State Markov Processes as General all or None Models
inferredcites →https://doi.org/10.1016/0022-2496(67)90033-8openalex-snapshot
Paired-associate learning with short-term retention: Mathematical analysis and data regarding identification of parameters
inferredcites →https://doi.org/10.1214/aoms/1177706444openalex-snapshot
A Markovian Function of a Markov Chain
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-4694-7_2openalex-snapshot
The New Two-Stage Model of Learning: A Tool for Analyzing the Loci of Memory Differences in Intellectually Impaired Children
inferred← citeshttps://doi.org/10.1007/bf02291573openalex-snapshot
Statistical Methods for Absorbing Markov-Chain Models for Learning: Estimation and Identification
inferred← citeshttps://doi.org/10.1007/bf02293556openalex-snapshot
Precriterion Stationarity in Markovian Learning Models
inferred← citeshttps://doi.org/10.1016/0022-2496(74)90029-7openalex-snapshot
Equivalence classes of functions of finite Markov chains
inferred← citeshttps://doi.org/10.1016/0022-2496(75)90058-9openalex-snapshot
Second responses in paired-associate learning
inferred← citeshttps://doi.org/10.1016/0022-2496(80)90018-8openalex-snapshot
Population states and eigenstructure: A simplifying view of Markov learning models
inferred← citeshttps://doi.org/10.1016/0022-2496(82)90005-0openalex-snapshot
An identifiable model of two-stage learning
inferred← citeshttps://doi.org/10.1016/0022-2496(85)90005-7openalex-snapshot
How many parameters can a model have and still be testable?
inferred← citeshttps://doi.org/10.1016/j.jmp.2013.07.003openalex-snapshot
Markovian interpretations of dual retrieval processes
inferred← citeshttps://doi.org/10.1037//0033-2909.91.3.634openalex-snapshot
The general theory of two-stage learning: A mathematical review with illustrations from memory development.
inferred← citeshttps://doi.org/10.1146/annurev.ps.24.020173.000501openalex-snapshot
Mathematical Learning Theory and the New "Mental Forestry"
inferred← citeshttps://doi.org/10.2307/2987540openalex-snapshot
On the Use of Minimum Chi-Square Estimation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.