Skip to content

Transition Network Analysis (TNA)

Research Method · All research methods
Evidence · 4 claims (4 for) · 2 studies (2 associational), q2 · 0 of 2 report an effect size · 4 claims rest on one study

Description

Transition Network Analysis (TNA) models learning processes as networks of discrete behavioural states connected by directed, probabilistic transitions, computed here with a web-based TNA Shiny app. Unlike frequency counts, it "maps the temporal trajectory of learner actions", operationalising the error treatment sequence in interactionist SLA. In this study it revealed the Revision and Chat Loops and enabled network-level metrics (density, reciprocity) and proficiency-group comparisons.

Accounts

  • Transition Network Analysis as a framework for modelling temporal learner-chatbot interaction: Transition Network Analysis (TNA) models learning processes as networks of discrete behavioural states connected by directed, probabilistic transitions, computed here with a web-based TNA Shiny app. Unlike frequency counts, it "maps the temporal trajectory of learner actions", operationalising the error treatment sequence in interactionist SLA. In this study it revealed the Revision and Chat Loops and enabled network-level metrics (density, reciprocity) and proficiency-group comparisons. (Steve Woollaston et al. (2026))
  • Transition networks of action sequences analyzed with five SNA measures (nodes, density, degree centralization, reciprocity, triad census) for dyadic CPS process data: A methodological artifact integrating social network analysis with CPS assessment: for each dyad, actions (e.g., drag to move an object, type in a chat window) are nodes and directed weighted links represent transitions where "the first action is followed by the second action in sequence". In the Olive Oil task, analysis relied on "14,448 log file events conducted by 83 pairs". Five measures capture transition patterns: numbers of existing nodes (actions conducted), weighted density (average frequency of transitions among actions), Freeman degree centralization (dispersion of attempts given to different actions), reciprocity (extent to which pairs revisit the previous action immediately), and numbers of the 16 triadic patterns. Self-loops were excluded, and isolated nodes were added so networks had identical node sets for comparison. (Shupin Li · Johanna Pöysä-Tarhonen · Päivi Häkkinen (2022))

Claims

Key Sources

  • Steve Woollaston, Brendan Flanagan, Yuko Toyokawa and Hiroaki Ogata. (2026). Penny: Transition Network Analysis of Learner-Chatbot Interactions in Scaffolded EFL Writing. Preprint, accepted at the 1st Workshop on Transition Network Analysis (TNA) at LAK '26.
  • Shupin Li · Johanna Pöysä-Tarhonen · Päivi Häkkinen (2022). Patterns of action transitions in online collaborative problem solving: A network analysis approach. Intern. J. Comput.-Support. Collab. Learn (2022) 17:191–223 https://doi.org/10.1007/s11412-022-09369-7
Page metadata
Field Value
type research-method
id transition-network-analysis-tna
title Transition Network Analysis (TNA)
description Transition Network Analysis (TNA) models learning processes as networks of discrete behavioural states connected by directed, probabilistic transitions, computed here with a web-based TNA Shiny app.
status review
generated by process:settle-candidates on 2026-10-11
trust unverified — no one has confirmed this page's content

Frontmatter is the page's machine-readable record — see the Schema & Guide.