相关论文: Minimal volume entropy on graphs

The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a…

In this note a notion of generalized topological entropy for arbitrary subsets of the space of all sequences in a compact topological space is introduced. It is shown that for a continuous map on a compact space the generalized topological…

We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…

Inspired by applications to theories of coding and communication in networks of nervous tissue, we study maximum entropy distributions on weighted graphs with a given expected degree sequence. These distributions are characterized by…

We study the localization of sets with constant nonlocal mean curvature and prescribed small volume in a bounded open set with smooth boundary, proving that they are {\em sufficiently close} to critical points of a suitable non-local…

We present several algorithms to generate tables for asymmetric numeral systems and prove that they are optimal in terms of discrepancy. In turn, this gives rise to the strongest proven bound on entropy loss. We further give improved…

Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…

We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…

Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…

We introduce a novel generalization of entropy and conditional entropy from which most definitions from the literature can be derived as particular cases. Within this general framework, we investigate the problem of designing…

This note introduces a notion of entropy for submanifolds of hyperbolic space analogous to the one introduced by Colding and Minicozzi for submanifolds of Euclidean space. Several properties are proved for this quantity including…

The generalized entropic measure, which is optimized by a given arbitrary distribution under the constraints on normalization of the distribution and the finite ordinary expectation value of a physical random quantity, is considered and its…

We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…

Let M be a compact manifold of dimension n with a strictly convex projective structure. We consider the geodesic flow of the Hilbert metric on it, which is known to be Anosov. We prove that its topological entropy is less than n-1, with…

Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…

The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of interesting results have been reported in the past,…

We show vanishing results about the infimum of the topological entropy of the geodesic flow of homogeneous smooth four manifolds. We prove that any closed oriented geometric four manifold has zero minimal entropy if and only if it has zero…

The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…

We consider an entropy-type invariant which measures the polynomial volume growth of submanifolds under the iterates of a map, and we establish sharp uniform lower bounds of this invariant for the following classes of symplectomorphisms of…

We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…