Quantifying Complexity: An Object-Relations Approach to Complex Systems

• URL: http://arxiv.org/abs/2210.12347v1
• Date: Sat, 22 Oct 2022 04:22:21 GMT
• Title: Quantifying Complexity: An Object-Relations Approach to Complex Systems
• Authors: Stephen Casey
• Abstract summary: This paper develops an object-relations model of complex systems which generalizes to systems of all types. The resulting Complex Information Entropy (CIE) equation is a robust method to quantify complexity across various contexts. Applications are discussed in the fields of engineering design, atomic and molecular physics, chemistry, materials science, psychology, neuroscience, sociology, ecology, economics, and medicine.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The best way to model, understand, and quantify the information contained in complex systems is an open question in physics, mathematics, and computer science. The uncertain relationship between entropy and complexity further complicates this question. With ideas drawn from the object-relations theory of psychology, this paper develops an object-relations model of complex systems which generalizes to systems of all types, including mathematical operations, machines, biological organisms, and social structures. The resulting Complex Information Entropy (CIE) equation is a robust method to quantify complexity across various contexts. The paper also describes algorithms to iteratively update and improve approximate solutions to the CIE equation, to recursively infer the composition of complex systems, and to discover the connections among objects across different lengthscales and timescales. Applications are discussed in the fields of engineering design, atomic and molecular physics, chemistry, materials science, neuroscience, psychology, sociology, ecology, economics, and medicine.

Related papers

• On the Role of Information Structure in Reinforcement Learning for Partially-Observable Sequential Teams and Games [55.2480439325792]
  In a sequential decision-making problem, the information structure is the description of how events in the system occurring at different points in time affect each other. By contrast, real-world sequential decision-making problems typically involve a complex and time-varying interdependence of system variables. We formalize a novel reinforcement learning model which explicitly represents the information structure.
  arXiv  Detail & Related papers  (2024-03-01T21:28:19Z)
• Next-Generation Simulation Illuminates Scientific Problems of Organised Complexity [14.665628508798319]
  We revisit a classic classification of scientific problems and acknowledge that a series of unresolved problems remain. We focus on next-generation simulation (NGS), which can serve as a platform to integrate methods from different paradigms. We propose a methodology, sophisticated behavioural simulation (SBS), to realise it.
  arXiv  Detail & Related papers  (2024-01-18T10:05:52Z)
• Large Language Models for Scientific Synthesis, Inference and Explanation [56.41963802804953]
  We show how large language models can perform scientific synthesis, inference, and explanation. We show that the large language model can augment this "knowledge" by synthesizing from the scientific literature. This approach has the further advantage that the large language model can explain the machine learning system's predictions.
  arXiv  Detail & Related papers  (2023-10-12T02:17:59Z)
• Probing multipartite entanglement through persistent homology [6.107978190324034]
  We propose a study of multipartite entanglement through persistent homology. persistent homology is a tool used in topological data analysis. We show that persistence barcodes provide more fine-grained information than its topological summary.
  arXiv  Detail & Related papers  (2023-07-14T17:24:33Z)
• Towards Complex Dynamic Physics System Simulation with Graph Neural ODEs [75.7104463046767]
  This paper proposes a novel learning based simulation model that characterizes the varying spatial and temporal dependencies in particle systems. We empirically evaluate GNSTODE's simulation performance on two real-world particle systems, Gravity and Coulomb.
  arXiv  Detail & Related papers  (2023-05-21T03:51:03Z)
• On the sampling complexity of open quantum systems [0.0]
  We show how the complexity of the underlying quantum process corresponds to the complexity of the associated family of master equations for the dynamics. Our results pave the way for studying open quantum systems from a complexity-theoretic perspective.
  arXiv  Detail & Related papers  (2022-09-22T09:09:28Z)
• Simulation Intelligence: Towards a New Generation of Scientific Methods [81.75565391122751]
  "Nine Motifs of Simulation Intelligence" is a roadmap for the development and integration of the essential algorithms necessary for a merger of scientific computing, scientific simulation, and artificial intelligence. We argue the motifs of simulation intelligence are interconnected and interdependent, much like the components within the layers of an operating system. We believe coordinated efforts between motifs offers immense opportunity to accelerate scientific discovery.
  arXiv  Detail & Related papers  (2021-12-06T18:45:31Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Model Complexity of Deep Learning: A Survey [79.20117679251766]
  We conduct a systematic overview of the latest studies on model complexity in deep learning. We review the existing studies on those two categories along four important factors, including model framework, model size, optimization process and data complexity.
  arXiv  Detail & Related papers  (2021-03-08T22:39:32Z)
• The 4th International Workshop on Smart Simulation and Modelling for Complex Systems [4.489415125484399]
  Computer-based modelling and simulation have become useful tools to facilitate humans to understand systems in different domains. Smart systems such as multi-agent systems have demonstrated advantages and great potentials in modelling and simulating complex systems.
  arXiv  Detail & Related papers  (2021-02-01T21:40:28Z)
• Learning Theory for Inferring Interaction Kernels in Second-Order Interacting Agent Systems [17.623937769189364]
  We develop a complete learning theory which establishes strong consistency and optimal nonparametric min-max rates of convergence for the estimators. The numerical algorithm presented to build the estimators is parallelizable, performs well on high-dimensional problems, and is demonstrated on complex dynamical systems.
  arXiv  Detail & Related papers  (2020-10-08T02:07:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.