Related papers: Dimer-monomer model on the generalized Tower of Ha…
For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the…
The influence of networks topology on collective properties of dynamical systems defined upon it is studied in the thermodynamic limit. A network model construction scheme is proposed where the number of links, the average eccentricity and…
We generalize the topological entanglement entropy to a family of topological Renyi entropies parametrized by a parameter alpha, in an attempt to find new invariants for distinguishing topologically ordered phases. We show that,…
The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…
A set $D \subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\in V\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in…
We elaborate on a previous proposal by Hartman and Maldacena on a tensor network which accounts for the scaling of the entanglement entropy in a system at a finite temperature. In this construction, the ordinary entanglement renormalization…
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…
We extend the nested sampling algorithm to simulate materials under periodic boundary and constant pressure conditions, and show how it can be used to determine the complete equilibrium phase diagram, for a given potential energy function,…
Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer level, where indivisible molecules (monomers) combine to form…
Let M be a closed 3-dimensional graph manifold. We prove that h(g)>1 for each geometrization g of M, where h(g) is the topological entropy of geodesic flow of g.
For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing…
The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…
We characterize the volume entropy of an arbitrary regular building as the topological pressure of the geodesic flow on an apartment. We show that the Liouville measure is not entropy maximizing measure for regular hyperbolic buildings. As…
Using a model of spinless fermions in a lattice with nearest neighbor and next-nearest neighbor interaction we show that the entropy of the reduced two site density matrix (the bond entropy) can be used as an extremely accurate and easy to…
Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…
Topological entropy is a measure of complex dynamics. In this regard, multimodal maps play an important role when it comes to study low-dimensional chaotic dynamics or explain some features of higher dimensional complex dynamics with…
Trigonometric and trigonometric-algebraic entropies are introduced. Regularity increases the entropy and the maximal entropy is shown to result when a regular $n$-gon is inscribed in a circle. A regular $n$-gon circumscribing a circle gives…
Based on the generalized uncertainty principle, we study the entropy of a four-dimensional black hole by counting degrees of freedom near the horizon and obtain the (finite) entropy proportional to the surface area at the horizon without a…
We present generalized methods for calculating lower bounds on the ground-state entropy per site, $S_0$, or equivalently, the ground-state degeneracy per site, $W=e^{S_0/k_B}$, of the antiferromagnetic Potts model. We use these methods to…
Given a graph $\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\H{o}s-R\'{e}nyi graph process with host $\Gamma$ as follows. A permutation $e_1,\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\leq m$ we let…