Related papers: Quantum statistics in Network Geometry with Fracti…
Hypergraphs and simplical complexes both capture the higher-order interactions of complex systems, ranging from higher-order collaboration networks to brain networks. One open problem in the field is what should drive the choice of the…
We present simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called simplicial complexes. These are natural multi-dimensional extensions of graphs that encode not…
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing…
In this paper, we pose a hypothesis that the structure of communities in complex networks may result from their latent fractal properties. This hypothesis is based not only on the general observation that many real networks have multilevel…
Core-periphery structure is an emerging property of a wide range of complex systems and indicate the presence of group of actors in the system with an higher number of connections among them and a lower number of connections with a sparsely…
Geometric properties of evolutionary graph states of spin systems generated by the operator of evolution with Ising Hamiltonian are examined, using their relationship with fluctuations of energy. We find that the geometric characteristics…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…
Both statistics and quantum theory deal with prediction using probability. We will show that there can be established a connection between these two areas. This will at the same time suggest a new, less formalistic way of looking upon basic…
In this work we make an attempt to understand social networks from a mathematical viewpoint. In the first instance we consider a network where each node representing an individual can connect with a neighbouring node with a certain…
Based on a rigorous extension of classical statistical mechanics to networks, we study a specific microscopic network Hamiltonian. The form of this Hamiltonian is derived from the assumption that individual nodes increase/decrease their…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
Equation of state with quantum statistics corrections is derived for a multi-component gas of particles interacting through the repulsive and attractive van der Waals (vdW) forces up to first few orders over a small parameter $\delta…
Quantum geometric maps, which relate SU(2) spin networks and Lorentz covariant projected spin networks, are an important ingredient of spin foam models (and tensorial group field theories) for 4-dimensional quantum gravity. We give a…
Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d greater than or equal to 2. These include…
The dynamical behavior of networked systems is expected to reflect the features of their coupling structure. Yet, symmetry-broken solutions often occur in symmetrically coupled networks. An example is provided by the so-called solitary…
A defining feature of many large empirical networks is their intrinsic complexity. However, many networks also contain a large degree of structural repetition. An immediate question then arises: can we characterize essential network…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
Motivated by the empirical analysis of the air transportation system, we define a network model that includes geographical attributes along with topological and weight (traffic) properties. The introduction of geographical attributes is…
Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…