Related papers: Dimer-monomer model on the generalized Tower of Ha…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
Random tensor models which display multicritical behaviors in a remarkably simple fashion are presented. They come with entropy exponents \gamma = (m-1)/m, similarly to multicritical random branched polymers. Moreover, they are interpreted…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
How small can a set of vertices in the $n$-dimensional hypercube $Q_n$ be if it meets every copy of $Q_d$? The asymptotic density of such a set (for $d$ fixed and $n$ large) is denoted by $\gamma_d$. It is easy to see that $\gamma_d \leq…
Let $X$ be a compact complex manifold of dimension $k$ and $f:X \longrightarrow X$ be a dominating meromorphic map. We generalize the notion of topological entropy, by defining a quantity $h_{(m,l)}^{top}(f)$ which measures the action of…
We study holographically non-local observables in field theories at finite temperature and in the large $d$ limit. These include the Wilson loop, the entanglement entropy, as well as an extension to various dual extremal surfaces of…
Using the transfer matrix technique, we estimate the entropy for a gas of rods of sizes equal to k (named k-mers), which cover completely a square lattice. Our calculations were made considering three different constructions, using…
We show that the von Neumann entropy (from herein referred to as the von Neumann index) of a graph's trace normalized combinatorial Laplacian provides structural information about the level of centralization across a graph. This is done by…
We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…
Let $D(n,r)$ be a random $r$-out regular directed multigraph on the set of vertices $\{1,\ldots,n\}$. In this work, we establish that for every $r \ge 2$, there exists $\eta_r>0$ such that $\text{diam}(D(n,r))=(1+\eta_r+o(1))\log_r{n}$. Our…
The number of monomers, in a monomer-dimer mean-field model with an attractive potential, fluctuates according to the central limit theorem when the parameters are outside the critical curve. At the critical point the model belongs to the…
We study the dimer model on special subgraphs of the square hexagon lattice called "tower graphs" of size $N$. Using integrable probability techniques, we confirm that as $N \rightarrow \infty$, the local statistics are translation…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by…
Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph…
We define the topological entropy per unit volume in parabolic PDE's such as the complex Ginzburg-Landau equation, and show that it exists, and is bounded by the upper Hausdorff dimension times the maximal expansion rate. We then give a…
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based…
We study the von Neumann entropy asymptotics of pure translation-invariant quasi-free states of d-dimensional fermionic systems. It is shown that the entropic area law is violated by all these states: apart from the trivial cases, the…
We propose a method to associate a differentiable Riemannian manifold to a generic many degrees of freedom discrete system which is not described by a Hamiltonian function. Then, in analogy with classical Statistical Mechanics, we introduce…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…