相关论文: Minimal volume entropy on graphs

We establish a sharp estimate for a minimal number of binary digits (bits) needed to represent all bounded total generalized variation functions taking values in a general totally bounded metric space $(E,\rho)$ up to an accuracy of…

The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…

We give a new type of sufficient condition for the existence of measures with maximal entropy for an interval map $f$, using some non-uniform hyperbolicity to compensate for a lack of smoothness of $f$. More precisely, if the topological…

We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…

The main purpose of this paper is to present a number of analytic and geometric properties of the $l$-function and the reduced volume of Perelman, including in particular the monotonicity, the upper bound and the rigidities of the reduced…

We consider operators arising from regular Dirichlet forms with vanishing killing term. We give bounds for the bottom of the (essential) spectrum in terms of exponential volume growth with respect to an intrinsic metric. As special cases we…

Thanks to a recent result by Jean-Marc Schlenker, we establish an explicit linear inequality between the normalized entropies of pseudo-Anosov automorphisms and the hyperbolic volumes of their mapping tori. As its corollaries, we give an…

Maximum entropy modeling is a flexible and popular framework for formulating statistical models given partial knowledge. In this paper, rather than the traditional method of optimizing over the continuous density directly, we learn a smooth…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…

A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\it et al.} have characterized the minimizing graphs in the class…

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…

We study the equilibrium shape of liquid drops minimizing the fractional perimeter under the action of a potential energy. We prove, with a quantitative estimate, that the small volume minimizers are convex and uniformly close to a ball.

We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…

We study minimax lower bounds for function estimation problems on large graph when the target function is smoothly varying over the graph. We derive minimax rates in the context of regression and classification problems on graphs that…

We present some new nonparametric estimators of entropies and we establish almost sure consistency and central limit Theorems for some of the most important entropies in the discrete case. Our theorical results are validated by simulations.

An algorithm for measurement of entropy in multiparticle systems, based on recently published proposal of the present authors, is given. Dependence on discretization of the system and effects of multiparticle correlations are discussed in…

Necessary and sufficient conditions for the symbolic dynamics of a Lorenz map to be fully embedded in the symbolic dynamics of a piecewise continuous interval map are given. As an application of this result, we describe a new algorithm for…

Graph based entropy, an index of the diversity of events in their distribution to parts of a co-occurrence graph, is proposed for detecting signs of structural changes in the data that are informative in explaining latent dynamics of…