Related papers: On the Growth of a Ballistic Deposition Model on F…

Let X be a Hadamard manifold and $\Gamma$ a discrete group of isometries of X which contains an axial isometry without invariant flat half plane. We study the behavior of conformal densities on the geometric limit set of $\Gamma$ in order…

Classical questions in extremal graph theory concern the asymptotics of $\operatorname{ex}(G, \mathcal{H})$ where $\mathcal{H}$ is a fixed family of graphs and $G=G_n$ is taken from a `standard' increasing sequence of host graphs $(G_1,…

A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let $\{G_1, G_2, \ldots,…

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}\gamma^n n!$ where $c^{(g)}>0$, and $\gamma \approx 27.23$ is the…

Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…

We study the asymptotic growth rate of the label size of high-degree vertices in weighted recursive graphs (WRG) when the weights are i.i.d. almost surely bounded random variables, and as a result confirm a conjecture by Lodewijks and…

We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $\gamma…

We continue to study a model of disordered interface growth in two dimensions. The interface is given by a height function on the sites of the one--dimensional integer lattice and grows in discrete time: (1) the height above the site $x$…

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

We introduce a variation of the classic ballistic deposition model in which vertically falling blocks can only stick to the top or the upper right corner of growing columns. We establish that fluctuations of the height function at points…

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

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…

Let $G$ be a simple, connected non bipartite graph and let $I_G$ be the edge idealof $G$. In our previous work we showed that L. Lov\'asz's theorem on ear decompositions offactor-critical graphs and the canonical decomposition of a graph…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

We consider the Moran process in a graph called the "star" and obtain the asymptotic expression for the fixation probability of a single mutant when the size of the graph is large. The expression obtained corrects the previously known…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

In the averaging process on a graph $G = (V, E)$, a random mass distribution $\eta$ on $V$ is repeatedly updated via transformations of the form $\eta_{v}, \eta_{w} \mapsto (\eta_{v} + \eta_{w})/2$, with updates made according to…