Related papers: On Counting Constructions and Isomorphism Classes …

We consider the problem of counting $k$-tuples of positive integers satisfying any arbitrary set of gcd conditions, where every integer is not larger than $x$. We first establish the conditions to guarantee the existence of such tuples, and…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes.…

This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…

We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

This paper generalizes recent proposals of density forecasting models and it develops theory for this class of models. In density forecasting, the density of observations is estimated in regions where the density is not observed.…

We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…

We consider classes of diffeomorphisms of Euclidean space with partial asymptotic expansions at infinity; the remainder term lies in a weighted Sobolev space whose properties at infinity fit with the desired application. We show that two…

We discuss formulas for the asymptotic growth rate of the number of summands in tensor powers in certain (finite or infinite) monoidal categories. Our focus is on monoidal categories with infinitely many indecomposable objects, with our…

An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being…

In this paper, we study properties of asymptotic resemblance relations induced by compatible coarse structures on groups. We generalize the notion of asymptotic dimensiongrad for groups with compatible coarse structures and show this notion…

Given a graph $H$, we investigate the $d$-regular graphs $G$ with the highest $H$-density. We reframe the problem as a continuous optimization problem on the eigenvalues of $G$ by relating injective homomorphism numbers from $H$ and…