Related papers: On Counting Constructions and Isomorphism Classes …
We adapt the techniques in Stigler [Ann. Statist. 1 (1973) 472--477] to obtain a new, general asymptotic result for trimmed $U$-statistics via the generalized $L$-statistic representation introduced by Serfling [Ann. Statist. 12 (1984)…
We compute the Poisson cohomology of a class of Poisson manifolds that are symplectic away from a collection $D$ of hypersurfaces. These Poisson structures induce a generalization of symplectic and cosymplectic structures, which we call a…
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large $n$, a networked data…
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.
A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…
In this work, we study convergence in probability and almost sure convergence for weighted partial sums of random variables that are related to the class of generalized Oppenheim expansions. It is worth noting that the random variables…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
We provide a new general theorem for multivariate normal approximation on convex sets. The theorem is formulated in terms of a multivariate extension of Stein couplings. We apply the results to a homogeneity test in dense random graphs and…
For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
The sizes of subsets of the natural numbers are typically quantified in terms of asymptotic (linear) and logarithmic densities. These concepts have been generalized to weighted $w$-densities, where a specific weight function $w$ plays a key…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
The global clustering coefficient is an effective measure for analyzing and comparing the structures of complex networks. The random annulus graph is a modified version of the well-known Erd\H{o}s-R\'{e}nyi random graph. It has been…
We investigate one-dimensional families of diagonal forms, considering the evolution of the asymptotic formula and error term. We then discuss properties of the average asymptotic formula obtained. The subsequent second moment analysis…
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.
We introduce the concept of shallow directed minors and based on this a new classification of classes of directed graphs which is diametric to existing directed graph decompositions and width measures proposed in the literature. We then…
The results in this paper provide new information on asymptotic properties of classical models: the neutral Kingman coalescent under a general finite-alleles, parent-dependent mutation mechanism, and its generalisation, the ancestral…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…