Related papers: Correlation between residual entropy and spanning …
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…
Entropy plays a key role in statistical physics of complex systems, which in general exhibit diverse aspects of emergence on different scales. However, it still remains not fully resolved how entropy varies with the coarse-graining level…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a…
Local correlation entropy, introduced by Takens in 1983, represents the exponential decay rate of the relative frequency of recurrences in the trajectory of a point, as the embedding dimension grows to infinity. In this paper we study…
It is shown that the residual entropy (entropy minus that of the ideal gas at the same temperature and density) is mostly synonymous with the independent variable of density scaling, identifying a direct link between these two approaches.…
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…
We consider a generalization of the Hopfield model, where the entries of patterns are Gaussian and diluted. We focus on the high-storage regime and we investigate analytically the topological properties of the emergent network, as well as…
We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…
We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two…
Entropic measures of complexity are able to quantify the information encoded in complex network structures. Several entropic measures have been proposed in this respect. Here we study the relation between the Shannon entropy and the Von…
Whether a system is to be considered complex or not depends on how one searches for correlations. We propose a general scheme for calculation of entropies in lattice systems that has high flexibility in how correlations are successively…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on…
Visibility graphs are spatial interpretations of time series. When derived from the time evolution of physical systems, the graphs associated with such series may exhibit properties that can reflect aspects such as ergodicity, criticality,…