Related papers: On Counting Constructions and Isomorphism Classes …
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
In this paper, we use a formula obtained in [8] to study certain asymptotic behaviors of GUE (Gaussian unitary ensemble) correlators. More precisely, we obtain large genus asymptotics of enumerations of ordinary graphs and ribbon graphs…
Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$. The graph $G$ is assumed to have average degrees at least $n^{1/3 + \varepsilon}$ for some $\varepsilon > 0$, and to have…
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…
A relatively fast algorithm for evaluating Weil-Petersson volumes of moduli spaces of complex algebraic curves is proposed. On the basis of numerical data, a conjectural large genus asymptotics of the Weil-Petersson volumes is computed.…
The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
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.
We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been recent results for specific graph classes, these involve…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
The nonsingular real plane algebraic curves of given degree $d$ are considered either up to isotopy or up to deformation. The asymptotic behavior of the number $I_d$ of isotopy classes and the number $D_d$ of deformation classes are…