L1centrality-package {L1centrality}R Documentation

L1centrality: Graph/Network Analysis Based on L1 Centrality

Description

Analyze graph/network data using L1 centrality and prestige. Functions for deriving global, local, and group L1 centrality/prestige are provided. Routines for visual inspection of a graph/network are also provided. Details are in Kang and Oh (2024a,b) and Kang (2025).

Details

Every function inside this package supports a distinct variety of graphs. Edge weights can be considered by all functions. Additionally, it is assumed that the graph to be analyzed is a connected graph in the case of an undirected graph, or a strongly connected graph in the case of a directed graph.

Certain functions exclusively accommodate undirected graphs without vertex multiplicity, while others support both directed and undirected graphs with vertex multiplicities. The following table provides a concise overview of the support range for each function.

Functions Undirected graph Directed graph Vertex multiplicity
L1cent(), L1centNB(), L1centLOC(), L1centGROUP() O O O
L1centEDGE() O X O
L1centMDS() O X X

Author(s)

Maintainer: Seungwoo Kang kangsw0401@snu.ac.kr (ORCID)

Authors:

References

S. Kang. Topics in Non-Euclidean Dimension Reduction. PhD thesis, Seoul National University, 2025.

S. Kang and H.-S. Oh. On a notion of graph centrality based on L1 data depth. arXiv preprint arXiv:2404.13233, 2024a.

S. Kang and H.-S. Oh. L1 prominence measures for directed graphs. arXiv preprint arXiv:2408.12078, 2024b.

See Also

Useful links:


[Package L1centrality version 0.3.0 Index]