Related papers: Volume growth for infinite graphs and translation …
Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…
The study of random surfaces, especially in the asymptotics of large genus, has been of increasing interest in recent years. Many geometrical questions have analogous formulations in the theory of random graphs with a large number of…
Different viewpoints on the asymptotic expansion of Feynman diagrams are reviewed. The relations between the field theoretic and diagrammatic approaches are sketched. The focus is on problems with large masses or large external momenta.…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…
The main theme of this paper is to study for a symplectomorphism of a compact surface, the asymptotic invariant which is defined to be the growth rate of the sequence of the total dimensions of symplectic Floer homologies of the iterates of…
We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.
It is relatively easy to construct a finitely generated group with infinite asymptotic dimension: the restricted wreath product of $\mathbb{Z}$ by $\mathbb{Z}$ provides an example. In light of this, it becomes interesting to consider the…
This book explores infinite-type translation surfaces and is intended as an introductory text for graduate and PhD students, as well as a reference for more advanced researchers. Chapter 1 introduces the three definitions of translation…
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
A \emph{surface of translation} is a sum $(u,v)\mapsto\gt\alpha(u)+\gt\beta(v)$ of two space curves: a \emph{path} $\gt\alpha$ and a \emph{profile} $\gt\beta$. A fundamental problem of differential geometry and shell theory is to determine…
Grey-scale local algorithms have been suggested as a fast way of estimating surface area from grey-scale digital images. Their asymptotic mean has already been described. In this paper, the asymptotic behaviour of the variance is studied in…
In this paper, we study the asymptotic behavior of the volume of spheres in metric measure spaces. We first introduce a general setting adapted to the study of asymptotic isoperimetry in a general class of metric measure spaces. We then…
For an infinite penny graph, we study the finite-dimensional property for the space of harmonic functions, or ancient solutions of the heat equation, of polynomial growth. We prove the asymptotically sharp dimensional estimate for the above…
We compute the asymptotics of the number of connected branched coverings of a torus as their degree goes to infinity and the ramification type stays fixed. These numbers are equal to the volumes of the moduli spaces of pairs (curve,…
We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth.…
Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…
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…
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…