相关论文: Minimal volume entropy on graphs

Given $r \geq 3$, we prove that there exists $\lambda >0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $\lambda$.…

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…

We consider an energy model for harmonic graphs with junctions and study the regularity properties of minimizers and their free boundaries.

The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…

A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as…

This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…

We develop a functional analytic approach for the study of nonlocal minimal graphs. Through this, we establish existence and uniqueness results, a priori estimates, comparison principles, rearrangement inequalities, and the equivalence of…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph…

We show certain rigidity for minimizers of generalized Colding-Minicozzi entropies. The proofs are elementary and work even in situations where the generalized entropies are not monotone along mean curvature flow.

We introduce a new graph minimization method, in which it is required to preserve some graph property and there is an effective procedure for checking this property. We applied this method to minimize 5-chromatic unit-distance graphs and…

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

Motivated by Bonahon's result for hyperbolic surfaces, we construct an analogue of the Patterson-Sullivan-Bowen-Margulis map from the Culler-Vogtmann outer space $CV(F_k)$ into the space of projectivized geodesic currents on a free group.…

We present two new estimators for estimating the entropy of absolutely continuous random variables. Some properties of them are considered, specifically consistency of the first is proved. The introduced estimators are compared with the…

Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…

We introduce the notion of relative volume entropy for two spacetimes with preferred compact spacelike foliations. This is accomplished by applying the notion of Kullback-Leibler divergence to the volume elements induced on spacelike…

We study notions of asymptotic regularity for a class of minimal submanifolds of complex hyperbolic space that includes minimal Lagrangian submanifolds. As an application, we show a relationship between an appropriate formulation of…

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

This is a survey on the recent theory on minimizing the normalized volume function attached to any klt singularities.