Ising formulations of some graph-theoretic problems in psychological research: models and methods

DOI10.1016/j.jmp.2021.102536zbMath1475.91275OpenAlexW3159157307MaRDI QIDQ2244634

Clintin P. Davis-Stober, Douglas Steinley, Michael J. Brusco

Publication date: 12 November 2021

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://psyarxiv.com/4udfw/

zbMATH Keywords

simulated annealinggraph coloringconvex hullIsing spin modelslinear orderingmax-cut clustering

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27) Measurement and performance in psychology (91E45)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
• Bayes factors for state-trace analysis
• Obtaining the best value for money in adaptive sequential estimation
• Pseudo-Boolean optimization
• Additive factors and stages of mental processes in task networks
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The Bayes factor for inequality and about equality constrained models
• A mathematical analysis of a natural class of partitions of a graph
• On realizable biorders and the biorder dimension of a relation
• Balanced decompositions of a signed graph
• On finding the bidimension of a relation
• Modelling the reliability of paired comparisons
• Some applications of graph theory to clustering
• Data analysis implications of some concepts related to the cuts of a graph
• Every planar map is four colorable. I: Discharging
• A representation theorem for finite random scale systems
• Weak order polytopes.
• Testing probabilistic models of choice using column generation
• Extended formulations for order polytopes through network flows
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
• Computational consequences of agreement and ambiguity in natural language
• A combinatorial study of partial order polytopes
• Mean field dynamics of stochastic cellular automata for random and small-world graphs
• Computing the line index of balance using integer programming optimisation
• A cutting plane algorithm for graph coloring
• A branch-and-cut algorithm for graph coloring
• Hyperplane arrangements in preference modeling
• Quantum versus classical annealing of Ising spin glasses
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
• A comparison of simulated annealing cooling strategies
• Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
• SPANNING TREES AND ASPECTS OF CLUSTERING
• Realizable Hamiltonians for universal adiabatic quantum computers
• Reducibility among Combinatorial Problems
• Beitrag zur Theorie des Ferromagnetismus
• Equation of State Calculations by Fast Computing Machines
• Maximum-likelihood paired comparison rankings
• Maximum likelihood paired comparison ranking by linear programming
• The complexity of theorem-proving procedures

This page was built for publication: Ising formulations of some graph-theoretic problems in psychological research: models and methods