Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T22:43:00.633Z Has data issue: false hasContentIssue false

Graph-Theoretic Representations for Proximity Matrices Through Strongly-Anti-Robinson or Circular Strongly-Anti-Robinson Matrices

Published online by Cambridge University Press:  01 January 2025

Lawrence Hubert*
Affiliation:
University of Illinois, Champaign
Phipps Arabie
Affiliation:
Faculty of Management, Rutgers University, Newark, New Jersey
Jacqueline Meulman
Affiliation:
Department of Data Theory, Leiden University
*
Requests for reprints should be sent to Lawrence Hubert, Department of Psychology, The University of Illinois, 603 East Daniel Street, Champaign, IL 61820, USA.

Abstract

There are various optimization strategies for approximating, through the minimization of a least-squares loss function, a given symmetric proximity matrix by a sum of matrices each subject to some collection of order constraints on its entries. We extend these approaches to include components in the approximating sum that satisfy what are called the strongly-anti-Robinson (SAR) or circular strongly-anti-Robinson (CSAR) restrictions. A matrix that is SAR or CSAR is representable by a particular graph-theoretic structure, where each matrix entry is reproducible from certain minimum path lengths in the graph. One published proximity matrix is used extensively to illustrate the types of approximation that ensue when the SAR or CSAR constraints are imposed.

Information

Type
Original Paper
Copyright
Copyright © 1998 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