Related papers: Wilks' theorems in some exponential random graph m…
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…
In this paper, we introduce a new four-parameter generalization of the exponentiated Weibull (EW) distribution, called the exponentiated Weibull-logarithmic (EWL) distribution, which obtained by compounding EW and logarithmic distributions.…
We study two-sample equality testing in Gaussian graphical models. Classical likelihood ratio tests on decomposable graphs admit clique-wise factorizations, offering limited localization and unstable finite-sample behaviour. We propose…
Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…
Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…
An $\ell$-lift of a graph $G$ is any graph obtained by replacing every vertex of $G$ with an independent set of size $\ell$, and connecting every pair of two such independent sets that correspond to an edge in $G$ by a matching of size…
We obtain Berry-Esseen-type bounds for the sum of random variables with a dependency graph and uniformly bounded moments of order $\delta \in (2,\infty]$ using a Fourier transform approach. Our bounds improve the state-of-the-art in the…
A nonlinear model with response variable missing at random is studied. In order to improve the coverage accuracy, the empirical likelihood ratio (EL) method is considered. The asymptotic distribution of EL statistic and also of its…
We develop some graph-based tests for spherical symmetry of a multivariate distribution using a method based on data augmentation. These tests are constructed using a new notion of signs and ranks that are computed along a path obtained by…
We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…
The present paper considers testing an Erdos--Renyi random graph model against a stochastic block model in the asymptotic regime where the average degree of the graph grows with the graph size n. Our primary interest lies in those cases in…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can be considered as partitions of vertices into cliques.…
In this article, the weighted empirical likelihood is applied to a general setting of two-sample semiparametric models, which includes biased sampling models and case-control logistic regression models as special cases. For various types of…
Many network datasets exhibit connectivity with variance by resolution and large-scale organization that coexists with localized departures. When vertices have observed ordering or embedding, such as geography in spatial and village…
Central limit theorems (CLTs) for high-dimensional random vectors with dimension possibly growing with the sample size have received a lot of attention in the recent times. Chernozhukov et al. (2017) proved a Berry--Esseen type result for…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
Consider $n$ independent measurements, with the additional information of the times at which measurements are performed. This paper deals with testing statistical hypotheses when $n$ is large and only a small amount of observations…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…
This paper considers the maximum generalized empirical likelihood (GEL) estimation and inference on parameters identified by high dimensional moment restrictions with weakly dependent data when the dimensions of the moment restrictions and…