Nonparametric statistics of dynamic networks with distinguishable nodes
From MaRDI portal
Publication:2404165
DOI10.1007/s11749-017-0524-8zbMath1373.62294arXiv1408.3584OpenAlexW3106305946WikidataQ101496283 ScholiaQ101496283MaRDI QIDQ2404165
Daniel Fraiman, Nicolas Fraiman, Ricardo Fraiman
Publication date: 18 September 2017
Published in: Test (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3584
Factor analysis and principal components; correspondence analysis (62H25) Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80)
Related Items
Tukey’s Depth for Object Data, Depth-based classification for relational data with multiple attributes, A variable selection procedure for depth measures, Level set and density estimation on manifolds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Spectral clustering and the high-dimensional stochastic blockmodel
- A survey of graph edit distance
- Random projections and goodness-of-fit tests in infinite-dimensional spaces
- The Tukey and the random Tukey depths characterize discrete distributions
- Estimating time-varying networks
- Growing directed networks: stationary in-degree probability for arbitrary out-degree one
- The notion of \(\psi \)-weak dependence and its applications to bootstrapping time series
- A state-space mixed membership blockmodel for dynamic network tomography
- Central limit theorem and the bootstrap for \(U\)-statistics of strongly mixing data
- Strong consistency of k-means clustering
- A plug-in approach to sparse and robust principal component analysis
- General notions of statistical depth function.
- Consistency of community detection in networks under degree-corrected stochastic block models
- Estimating and understanding exponential random graph models
- The graph matching problem
- Empirical depth processes
- A sharp form of the Cramér-Wold theorem
- Connectivity of inhomogeneous random graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- Emergence of Scaling in Random Networks
- A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION
- On a notion of simplicial depth
- The multivariate L 1 -median and associated data depth
- An elementary proof of the invertibility of Distance matrices
- The phase transition in inhomogeneous random graphs
- Collective dynamics of ‘small-world’ networks
- Almost sure lim sup behavior of bootstrapped means with applications to pairwise i. i. d. sequences and stationary ergodic sequences
