scientific article; zbMATH DE number 7064049
From MaRDI portal
Publication:5381123
zbMath1489.62167arXiv1711.05610MaRDI QIDQ5381123
Keith Levin, Carey E. Priebe, Vince Lyzinski
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1711.05610
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items (5)
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ Subgraph nomination: query by example subgraph retrieval in networks ⋮ Vertex nomination, consistent estimation, and adversarial modification ⋮ Vertex nomination via seeded graph matching ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonparametric two-sample hypothesis testing problem for random graphs
- Universally consistent vertex classification for latent positions graphs
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Spectral clustering and the high-dimensional stochastic blockmodel
- Vertex nomination schemes for membership prediction
- Consistent nonparametric regression. Discussion
- Support vector machines are universally consistent
- Learning to rank on graphs
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Diffusion maps
- A nonparametric view of network models and Newman–Girvan and other modularities
- Statistical mechanics of complex networks
- Graph-based Natural Language Processing and Information Retrieval
- Mixed membership stochastic blockmodels
- Introduction to Information Retrieval
- Markov Graphs
- Latent Space Approaches to Social Network Analysis
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- On the asymmetry of random regular graphs and random graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Vertex nomination via seeded graph matching
- Matchability of heterogeneous networks pairs
- Recommender Systems Handbook
- Collective dynamics of ‘small-world’ networks
- Information Recovery in Shuffled Graphs via Graph Matching
- Random Dot Product Graph Models for Social Networks
- Asymmetric graphs
This page was built for publication:
