Related papers: Toroidal Spin Networks: Towards a Generalization o…
The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
Nonlinear methods such as Deep Neural Networks (DNNs) are the gold standard for various challenging machine learning problems, e.g., image classification, natural language processing or human action recognition. Although these methods…
A behavior of extreme networks under deformations of their boundary sets is investigated. It is shown that analyticity of a deformation of boundary set guarantees preservation of the networks types for minimal spanning trees, minimal…
In the context of loop quantum gravity, quantum states of geometry are mathematically defined as spin networks living on graphs embedded in the canonical space-like hypersurface. In the effort to study the renormalisation flow of loop…
In this paper, we introduce a generalized topological quantum field theory based on the symmetric monoidal category which we call causal network condensation since it can be regarded as a generalization of spin network construction of Baez,…
Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking…
The widespread use of multi-sensor technology and the emergence of big datasets has highlighted the limitations of standard flat-view matrix models and the necessity to move towards more versatile data analysis tools. We show that…
Understanding conformational change is crucial for programming and controlling the function of many mechanical systems such as allosteric enzymes and tunable metamaterials. Of particular interest is the relationship between the network…
Symmetries are widespread in physical, technological, biological, and social systems and networks, including power grids. The swing equation is a classic model for the dynamics of powergrid networks. The main goal of this paper is to…
High-dimensional neural activity often reside in a low-dimensional subspace, referred to as neural manifolds. Grid cells in the medial entorhinal cortex provide a periodic spatial code that are organized near a toroidal manifold,…
Flexible grid topology has become a key enabler of flexibility in modern power grids, particularly for congestion management. Studying the effects of combinatorial topological changes is therefore of significant interest, though it remains…
Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…
This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for…
Low-rank tensor compression has been proposed as a promising approach to reduce the memory and compute requirements of neural networks for their deployment on edge devices. Tensor compression reduces the number of parameters required to…
Tensors with unit Frobenius norm are fundamental objects in many fields, including scientific computing and quantum physics, which are able to represent normalized eigenvectors and pure quantum states. While the tensor train decomposition…
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the…
Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…
We prove several new results about the topology of fibers of Gelfand--Zeitlin systems on unitary and orthogonal coadjoint orbits, at the same time finding a unifying framework recovering and shedding light on essentially all known results.…
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the problem of…