Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Statistical Clustering of a Random Network by Extremal Properties

Publication

Statistical Clustering of a Random Network by Extremal Properties

Markovich, Natalia M.; Ryzhov, Maxim S.; Krieger, Udo R. (2018): Statistical Clustering of a Random Network by Extremal Properties, in: Vladimir M. Višnevskij und Dmitry V. Kozyrev (Hrsg.), Distributed Computer and Communication Networks : 21st International Conference, DCCN 2018, Moscow, Russia, September 17–21, 2018, Proceedings, Cham: Springer International Publishing, S. 71–82, doi: 10.1007/978-3-319-99447-5_7.

Details

Faculty/Chair
Author
Markovich, Natalia M.
Ryzhov, Maxim S.
Title of the compilation
Distributed Computer and Communication Networks : 21st International Conference, DCCN 2018, Moscow, Russia, September 17–21, 2018, Proceedings
Editors
Višnevskij, Vladimir M.
Kozyrev, Dmitry V.
Conference
21st International Conference, DCCN 2018, September 17–21, 2018, Moscow, Russia
Publisher Information
Springer International Publishing : Cham
Year of publication
2018
ISBN
978-3-319-99446-8
Language
English
DOI
Abstract

We propose the new EI-clustering method for random networks. Regarding the underlying graph of a random network, EI-clustering is an advanced statistical tool for community detection and based on the estimation of the extremal index (EI) associated with each node. The EI metric is estimated by samples of indices of the node influences. The latter quantities are determined by the PageRank and a Max-Linear Model. The EI values of both models are estimated by a blocks estimator for each node which is considered as the root of a Thorny Branching Tree. Generations of descendant nodes related to the root node of the tree are used as blocks. The reciprocal of the EI value indicates the average number of influential nodes per generation containing at least one influential node. In the context of random graphs the EI metric indicates the ability of a randomly selected node to attract highly ranked nodes in its orbit. Looking at the changing shape of a plot of the EI metric versus the node number, the node communities are detected. The EI-clustering method is compared with the conductance measure regarding the data set of a real Web graph.

Keywords
Clustering
Node influence
PageRank
Max-Linear Model
Extremal index
Web graph
Peer Reviewed
no
International Distribution
yes
Type
Conferenceobject
URI
Activation date
2018-10-15, 2018-10-15

Permalink: https://fis.uni-bamberg.de/handle/uniba/44618 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-15

Restricted read-only access: login, editing and submission are temporarily disabled.