Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T06:26:39.677Z Has data issue: false hasContentIssue false

What can we Learn from the Path Equations?: Identifiability, Constraints, Equivalence

Published online by Cambridge University Press:  01 January 2025

Roderick P. McDonald*
Affiliation:
University of Illinois
*
Requests for reprints should be sent to R.P. McDonald, Department of Psychology, University of Illinois, 603 E. Daniel St., Champaign, IL 61820. E-Mail: rmcdonal@s.psych.uiuc.edu

Abstract

Procedures are given for determining identified parameters, finding constraints on the covariances, and checking equivalence, in acyclic (recursive) linear path models with correlated error terms (disturbances), by inspection of the path equations, aided by simple recursions. This provides a useful and general alternative to the employment of directed acyclic graph theory for such purposes.

Information

Type
Articles
Copyright
Copyright © 2002 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable