Related papers: Asymptotic expansions for enumerating connected la…

In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…

Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

In this paper, we introduce a notion of expansion for groupoids, which recovers the classical notion of expander graphs by a family of pair groupoids and expanding actions in measure by transformation groupoids. We also consider an…

In this paper, insight is given in the techniques used to compute asymptotic expansions. In a broad fashion the technique is described. Most of the results apply to the paper "An expansion for the maximum likelihood estimator and its…

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…

We define and study two structures associated to permutation groups: Dirichlet characters on permutation groups, and the "cycle form," a bilinear form on the group algebras of permutation groups. We use Dirichlet characters and the cycle…

A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…

For each natural number $n$ we determine, both asymptotically and exactly, the maximum number of edges an induced subgraph of order $n$ of the $d$-dimension a grid graph ${\ints}^d$ can have. The asymptotic bound is obtained by using a…

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models, the number of cliques and cycles have exact integral…

We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number…

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine asymptotically…

We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…

We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…

Explicit formulae for asymptotic expansions of Feynman diagrams in typical limits of momenta and masses with external legs on the mass shell are presented.