Results 251 to 260 of about 71,117 (287)

Finding Critical Links for Closeness Centrality

INFORMS Journal on Computing, 2019
Closeness centrality is a class of distance-based measures in the network analysis literature to quantify reachability of a given vertex (or a group of vertices) by other network agents. In this paper, we consider a new class of critical edge detection problems, in which given a group of vertices that represent an important subset of network elements ...
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao   +2 more
openaire   +2 more sources

Incremental algorithms for closeness centrality

2013 IEEE International Conference on Big Data, 2013
Centrality metrics have shown to be highly correlated with the importance and loads of the nodes within the network traffic. In this work, we provide fast incremental algorithms for closeness centrality computation. Our algorithms efficiently compute the closeness centrality values upon changes in network topology, i.e., edge insertions and deletions ...
Ahmet Erdem Sariyuce, Kamer Kaya, Erik Saule, Umit V. Catalyurek   +3 more
openaire   +1 more source

Distributed estimation of closeness centrality

2015 54th IEEE Conference on Decision and Control (CDC), 2015
Closeness centrality is a fundamental centrality measure that quantifies how centrally located a node is, within a network, based on its total distances to all other nodes. In this paper, we first derive a set of linear inequality and equality constraints, which are distributed in nature, that characterize closeness centrality in lieu of its original ...
Wei Wang, Choon Yik Tang
openaire   +1 more source

FINITE GROUPS WITH 2-CLOSED OR 2'-CLOSED CENTRALIZERS OF INVOLUTIONS

Mathematics of the USSR-Izvestiya, 1971
Finite nonsolvable groups are described whose involution centralizers are 2-closed or 2′-closed, whereas the Sylow p-subgroups for p>2 are cyclic.
openaire   +2 more sources

Closeness Centrality on BBS Reply Network

2011 International Conference of Information Technology, Computer Engineering and Management Sciences, 2011
In this paper, a reply network was constructed with the data downloaded from SINA BBS. Based on the complex network theory, we firstly studied the node closeness centrality and graph closeness centralization of the reply network, and analyzed the influence of the central figure in reply network by studying the node closeness centrality.
Ke Zhang, Hui Li, Lijuan Qin, Min Wu
openaire   +1 more source

Closeness Centrality: A Social Network Perspective

Journal of International and Interdisciplinary Business Research, 2019
Although the topic of a firm’s network centrality has received significant attention in the literature, little is known about the theoretical concepts behind closeness centrality. This study reviews the definitions of closeness centrality that have been proposed by researchers.
Dong-Young Kim, null null, null null, null null   +3 more
openaire   +2 more sources

Centrally closed hopf module algebras

Communications in Algebra, 1991
We introduce a concept of centrally closed Hopf module algebras and show that centrally closed Hopf module algebras inherit all basic properties of centrally closed algebras.
openaire   +1 more source

CLOSENESS CENTRALITY IN GRAPH PRODUCTS

Advances and Applications in Discrete Mathematics, 2023
Eballe, R. G., Balingit, C. M. R., Cabahug, I. S. jun., Flores, A. L. V., Lumpayao, S. M. B., Peñalosa, B. D., Tampipi, G. A. L., Villarta, C. A.   +7 more
openaire   +1 more source

Efficient top-k closeness centrality search

2014 IEEE 30th International Conference on Data Engineering, 2014
Many of today's applications can benefit from the discovery of the most central entities in real-world networks. This paper presents a new technique that efficiently finds the k most central entities in terms of closeness centrality. Instead of computing the centrality of each entity independently, our technique shares intermediate results between ...
Paul W. Olsen, Alan G. Labouseur, Jeong-Hyon Hwang   +2 more
openaire   +1 more source

Efficient Maximum Closeness Centrality Group Identification

2016
As a key concept in the social networks, closeness centrality is widely adopted to measure the importance of a node. Many efficient algorithms are developed in the literature to find the top-k closeness centrality nodes. In most of the previous work, nodes are treated as irrelevant individuals for a top-k ranking.
Chen Chen, Wei Wang, Xiaoyang Wang
openaire   +1 more source