SearcharxivSearch

arXiv subjects

Luca Cecchetti

Publications and source records attributed to Luca Cecchetti.

2 recordsLinked to original sources

Inverse generalised spin models of answers to questionnaires

Network psychometrics conceptualises psychological constructs as emergent properties of systems of interacting items. Energy-based probabilistic models have gained popularity as models of these interactions, but their psychometric application has so far been limited to binary responses, bilinear interactions, and approximated inference methods. To fill these gaps, we here infer and analyse three generalized-spin models of ordinal questionnaire data: the Ising, Blume-Capel (BC), and Blume-Emery-Griffiths (BEG) models. These are maximum-entropy models that accommodate ordinal responses on Likert-type scales with an arbitrary number of options, allowing for single-site anisotropy (BC, BEG) and bi-quadratic item interactions (BEG). We prove the concavity of the maximum likelihood estimation of their parameters, as well as the gauge invariance of the Ising and BC models. We introduce a stochastic gradient ascent algorithm for maximum likelihood inference, and apply this procedure to eleven psychometric and sociological questionnaire datasets. Evaluating the predictive ability of the inferred models reveals that the BEG model systematically outperforms Factor Analysis and the other spin models in capturing the distributions of factors and distances of subject answers to the mean, across all datasets. By leveraging a competitive interplay between the quadratic and bi-quadratic energy terms, the BEG model uniquely captures individual average-extremist response styles, alongside standard latent factor positioning. Moreover, only the spin models can account for the non-concavity and multi-modality of factor histograms in the most polarizing questionnaires. Finally, the analysis reveals other highly non-linear traits of ordinal data---such as the fat-tailed distribution of Mahalanobis distances to the mean---that escape satisfactory description by both factor and spin models.

physics.data-an

Community detection in subject-subject networks from psychometrics data

Identifying subgroups of respondents in psychometric data is traditionally addressed with Latent Class Analysis, which requires the number of classes to be specified a priori and can perform poorly when strong inter-item correlations violate local independence assumptions. We propose a network-theoretic alternative based on community detection in subject-subject similarity networks. To suppress the systematic artifacts induced by the factor structure of the items, the similarity is computed in a low-dimensional factor-score space and the null model for modularity maximisation is obtained by removing the leading (global) mode of the similarity matrix, rather than via the standard Newman--Girvan model. The significance of a detected partition is then assessed against a column-wise resampling null through four complementary observables: the modularity, the differential entropy of the eigenvector point cloud at two neighbourhood scales, and the overlap of the within- and between-community similarity histograms. On a synthetic benchmark with controlled mixture signal, all four metrics correctly identify the homogeneous case as null-compatible -- including the demanding regime of a dataset dominated by a single factor -- and exhibit a graded departure from the null as the cluster separation grows. Applied to 14 widely used psychometric scales, the pipeline isolates a small group of datasets supporting a genuine and directly interpretable modular structure, while the remaining scales fall either in a mixed-signal regime or in one compatible with a single homogeneous community. The significance analysis is independent of the specific community-detection algorithm and provides an operational way to test for modular subject-level structure in questionnaire data.

physics.soc-ph