Avoidance, Adjacency, and Association in Distributed Systems Design

Abstract

Patterns of avoidance, adjacency, and association in complex systems design emerge from the system's underlying logical architecture (functional relationships among components) and physical architecture (component physical properties and spatial location). Understanding the physical--logical architecture interplay that gives rise to patterns of arrangement requires a quantitative approach that bridges both descriptions. Here, we show that statistical physics reveals patterns of avoidance, adjacency, and association across sets of complex, distributed system design solutions. Using an example arrangement problem and tensor network methods, we identify several phenomena in complex systems design, including placement symmetry breaking, propagating correlation, and emergent localization. Our approach generalizes straightforwardly to a broad range of complex systems design settings where it can provide a platform for investigating basic design phenomena.

arXiv comment18 REVTeX pages, 12 figures

References in corpus (17)

• The structure and function of complex networks
• Catastrophic cascade of failures in interdependent networks
• The density-matrix renormalization group in the age of matrix product states
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Tensor renormalization group approach to 2D classical lattice models
• Low-Rank Tensor Networks for Dimensionality Reduction and Large-Scale Optimization Problems: Perspectives and Challenges PART 1
• Second Renormalization of Tensor-Network States
• Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectives
• Faster identification of optimal contraction sequences for tensor networks
• Solid-phase structures of the Dzugutov pair potential
• Tensor Network Contractions for #SAT
• Fast counting with tensor networks
• Automatic Contraction of Unstructured Tensor Networks
• Efficient Decomposition of High-Rank Tensors
• Statistical Physics of Design
• Robust Design from Systems Physics