相关论文: Minimal volume entropy on graphs

We consider the volume-constrained minimization of the sum of the perimeter and the Riesz potential. We add an external potential of the form $\|x\|^{\beta}$ that provides the existence of a minimizer for any volume constraint, and we study…

Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient…

We propose an operational definition of the entropy of cosmological perturbations based on a truncation of the hierarchy of Green functions. The value of the entropy is unambiguous despite gauge invariance and the renormalization procedure.…

We consider volume-constrained minimizers of the fractional perimeter with the addition of a potential energy in the form of a volume inte- gral. Such minimizers are solutions of the prescribed fractional curvature problem. We prove…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We study the set of intrinsic metrics on a given graph. This is a convex compact set and it carries a natural order. We investigate existence of largest elements with respect to this order. We show that the only locally finite graphs which…

We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…

We consider the problem of minimizing a generalized relative entropy, with respect to a reference diffusion law, over the set of path-measures with fully prescribed marginal distributions. When dealing with the actual relative entropy,…

We consider actions of a tileable amenable group $\Gamma$ on a topological space $X$. For a continuous function on $X$, we define the entropy of the number of homologically detectable critical point of the average of that function over…

We consider the one-parameter family of interval maps arising from generalized continued fraction expansions known as alpha-continued fractions. For such maps, we perform a numerical study of the behaviour of metric entropy as a function of…

We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any…

We will discuss theoretical and experimental results concerning comparison of entropy of pseudo-Anosov maps and volume of their mapping tori. Recent study of Weil-Petersson geometry of the Teichm\"uller space tells us that they admit linear…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…

We study the infimum of the renormalized volume for convex-cocompact hyperbolic manifolds, as well as describing how a sequence converging to such values behaves. In particular, we show that the renormalized volume is continuous under the…

We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below…

Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact in parameterized complexity by being the first known problems in NP to admit double-exponential lower…

The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighborhoods of at most $k$ other vertices in the subgraph. The…

In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…

Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…