Related papers: Volume Growth, Spectrum and Stochastic Completenes…
In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size $n.$ Our main results are formulas expressing the expected degree of graph nodes in…
This is a continuation of our previous work (Advances in Mathematics 450 (2024), Paper No. 109768). In this paper, we characterize complete metrics with finite total Q-curvature as normal metrics for all dimensional cases. Secondly, we…
Given an integer homology class of a finitely presentable group, the systolic volume quantifies how tight could be a geometric realization of this class. In this paper, we study various aspects of this numerical invariant showing that it is…
Volume entropy is an important invariant of metric graphs as well as Riemannian manifolds. In this note, we calculate the change of volume entropy when an edge is added to a metric graph. Using the first result, we investigate the change of…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…
In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must occur when the spectral radius ratio is large. We also give…
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…
The article is devoted to stochastic processes with values in finite- and infinite-dimensional vector spaces over infinite fields $\bf K$ of zero characteristics with non-trivial non-archimedean norms. For different types of stochastic…
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…
We consider the homotopy type of maps between symplectic surface whose graphs form symplectic submanifolds of the product. We give a purely topological model for this space in terms of maps with constrained numbers of pre-images. We use…
This manuscript is the first in a series of instalments that investigate spherically symmetric solutions within the effective dynamics program of Loop Quantum Gravity. The choice of lattice is adapted such that it remains invariant under a…
A finite volume symplectic manifold is said to have "packing stability" if the only obstruction to symplectically embedding sufficiently small balls is the volume obstruction. Packing stability has been shown in a variety of cases and it…
We prove pointwise gradient bounds for heat semigroups associated to general (possibly unbounded) Laplacians on infinite graphs satisfying the curvature dimension condition CD(K,\infty). Using gradient bounds, we show stochastic…
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…
The Minkowski problem for a class of unbounded closed convex sets is considered. This is equivalent to a Monge-Amp\`ere equation on a bounded convex open domain with possibly non-integrable given data. A complete solution (necessary and…