相关论文: Asymptotic entropy of the Gibbs state of complex n…

Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…

The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

We develop the argument that the Gibbs-von Neumann entropy is the appropriate statistical mechanical generalisation of the thermodynamic entropy, for macroscopic and microscopic systems, whether in thermal equilibrium or not, as a…

In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…

Controversy exists regarding the possible existence of a transition between the liquid and glassy states of water. Here we use experimental measurements of the entropy, specific heat, and enthalpy of both liquid and glassy water to…

We consider the asymptotic state after a sudden quench of the magnetic field in the transverse field quantum Ising chain starting from excited states of the pre-quench Hamiltonian. We compute the thermodynamic entropies of the generalised…

Preparing Gibbs states, which describe systems in equilibrium at finite temperature, is of great importance, particularly at low temperatures. In this work, we propose a new method -- TEPID-ADAPT -- that prepares the thermal Gibbs state of…

We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…

We derive the quantum Fisher information for entropy estimation in a Gibbs state and show that it equals the inverse of the heat capacity, which is dual to the temperature Fisher information given by the heat capacity divided by the square…

Real-world social and economic networks typically display a number of particular topological properties, such as a giant connected component, a broad degree distribution, the small-world property and the presence of communities of densely…

We exhibit an uncountable family of extremal inhomogeneous Gibbs measures of the low temperature Ising model on regular tilings of the hyperbolic plane. These states arise as low temperature perturbations of local ground states having a…

We prove a hardness of sampling result for the anti-ferromagnetic Ising model on random graphs of average degree $d$ for large constant $d$, proving that when the normalized inverse temperature satisfies $\beta>1$ (asymptotically…

Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…

In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states…

Understanding information exchange and aggregation on networks is a central problem in theoretical economics, probability and statistics. We study a standard model of economic agents on the nodes of a social network graph who learn a binary…

Ordering at arbitrarily high temperature - entropic order - has been argued to take place in a class of generalized Ising models parameterised by a real interaction parameter $p$ when $p\ge 1$. We give a rigorous proof of this conjecture.…

We introduce a graph-signal generalisation of Sample Entropy, denoted SampEn$_{G}$, to quantify irregularity of graph signals on a continuous state space, complementing existing methods on symbolic dynamics. Our approach replaces the…

In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph…

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…