Statistical Clustering of a Random Network by Extremal Properties

DOI10.1007/978-3-319-99447-5_7zbMath1476.68213OpenAlexW2888653557MaRDI QIDQ5005560

Natalia M. Markovich, Maxim S. Ryzhov, Udo R. Krieger

Publication date: 10 August 2021

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99447-5_7

zbMATH Keywords

clusteringextremal indexPageRankWeb graphmax-linear modelnode influence

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (2)

Statistical analysis of the end-to-end delay of packet transfers in a peer-to-peer network ⋮ Leader nodes in communities for information spreading

Cites Work

• Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
• Random Graphs and Complex Networks
• On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods
• PageRank in Scale-Free Random Graphs
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model
• Asymptotic analysis for personalized Web search
• Extremes and local dependence in stationary sequences
• Statistics of Extremes

This page was built for publication: Statistical Clustering of a Random Network by Extremal Properties