ﻻ يوجد ملخص باللغة العربية
Networks are topological and geometric structures used to describe systems as different as the Internet, the brain or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e. simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a non-equilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped respectively to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks including small-world property, high clustering coefficient, high modularity, scale-free degree distribution.Moreover they can be distinguished between the Fermi-Dirac Network and the Bose-Einstein Network obeying respectively the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally we comment on the relation between Quantum Complex Network Geometries, spin networks and triangulations.
Inverse phase transitions are striking phenomena in which an apparently more ordered state disorders under cooling. This behavior can naturally emerge in tricritical systems on heterogeneous networks and it is strongly enhanced by the presence of dis
We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study of the spac
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of total negativ
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constrai
Quantum phase transitions are usually observed in ground states of correlated systems. Remarkably, eigenstate phase transitions can also occur at finite energy density in disordered, isolated quantum systems. Such transitions fall outside the framewo