Related papers: A Quantitative Local Limit Theorem for Triangles i…

We establish elliptic and parabolic Harnack inequalities on graphs with unbounded weights. As an application we prove a local limit theorem for a continuous time random walk $X$ in an environment of ergodic random conductances taking values…

Let $G=(V,E)$ be a finite graph. For $v\in V$ we denote by $G_v$ the subgraph of $G$ that is induced by $v$'s neighbor set. We say that $G$ is $(a,b)$-regular for $a>b>0$ integers, if $G$ is $a$-regular and $G_v$ is $b$-regular for every…

The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…

For a graph $G$ and $p\in[0,1]$, we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$. We show that there exists a $C>0$ such that if $p\geq C(\log n)^{1/3}n^{-2/3}$…

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

In this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erd${\rm \ddot{o}}$s-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next,…

In 2013, Bollob\'as, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for a large range of expected degrees $d=pn$. However, their results only apply when $d \ge…

In this paper we study the behaviour of the domination number of the Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. Extending a result of Wieland and Godbole we show that the domination number of $\mathcal{G}(n,p)$ is equal to one of…

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

In this paper, we propose a new interpretation of local limit theorems for univariate and multivariate distributions on lattices. We show that - given a local limit theorem in the standard sense - the distributions are approximated well by…

Starting from a complete graph on $n$ vertices, repeatedly delete the edges of a uniformly chosen triangle. This stochastic process terminates once it arrives at a triangle-free graph, and the fundamental question is to estimate the final…

We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical spectral measure of the adjacency matrix of an Erd\H{o}s-R\'enyi random graph with $n$ vertices and parameter $c/n$. We present two different methods, one of…

Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the…

For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…

We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our…

We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.

In this paper we study the one dimensional random geometric graph when the location of the nodes are independent and exponentially distributed. We derive exact results and the limit theorems for the connectivity and other properties…

In this work we establish local limit theorems for q-multinomial and multiple Heine distributions. Specifically, the pointwise convergence of the q-multinomial distribution of the first kind, as well as for its discrete limit, the multiple…

The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…

Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high…