9 papers
Estimating peer effects in noisy, low-rank networks via network smoothing
Alex Hayes, Keith Levin
Peer effect estimation requires precise network measurement, yet most empirical networks are noisy, rendering standard estimators inconsistent. To address measurement error in netw…
Adjacency Spectral Embeddings of Correlation Networks
Keith Levin
In many applications, weighted networks are constructed based on time series data: each time series is associated to a vertex and edge weights are given by pairwise correlations. T…
Matching and mixing: Matchability of graphs under Markovian error
Zhirui Li, Keith D. Levin, Zhiang Zhao +1
We consider the problem of graph matching for a sequence of graphs generated under a time-dependent Markov chain noise model. Our edgelighter error model, a variant of the classica…
On the Effect of Misspecifying the Embedding Dimension in Low-rank Network Models
Roddy Taing, Keith Levin
As network data has become ubiquitous in the sciences, there has been growing interest in network models whose structure is driven by latent node-level variables in a (typically lo…
Minimax rates for the linear-in-means model reveal an identifiability-estimability gap
Alex Hayes, Keith Levin
The linear-in-means model is widely used to study peer influence in social networks. We consider estimation in the linear-in-means model when a randomized treatment is applied to n…
Testing for correlation between network structure and high-dimensional node covariates
Alexander Fuchs-Kreiss, Keith Levin
In many application domains, networks are observed with node-level features. In such settings, a common problem is to assess whether or not nodal covariates are correlated with the…