Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model
From MaRDI portal
Publication:3305437
DOI10.1007/978-3-319-66836-9_2zbMath1452.68020OpenAlexW2752931844MaRDI QIDQ3305437
Natalia M. Markovich, Udo R. Krieger, Maxim S. Ryzhov
Publication date: 7 August 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-66836-9_2
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Statistics of extreme values; tail inference (62G32) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)
Related Items
Leader nodes in communities for information spreading, Max-linear models in random environment, Statistical Clustering of a Random Network by Extremal Properties
Uses Software
Cites Work
- Using the bootstrap to estimate mean squared error and select smoothing parameter in nonparametric problems
- Moment-based tail index estimation
- A simple general approach to inference about the tail of a distribution
- Max-linear models on directed acyclic graphs
- PageRank in Scale-Free Random Graphs
- Information ranking and power laws on trees
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Extremes and local dependence in stationary sequences
- Statistics of Extremes
- Nonparametric Analysis of Univariate Heavy‐Tailed Data