Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
k-step betweenness centrality
Date
2020-03-01
Author
Akgun, Melda Kevser
Tural, Mustafa Kemal
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
120
views
0
downloads
Cite This
The notions of betweenness centrality (BC) and group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between pairs of vertices through shortest paths within the first k steps of the start of the communication. The k-step GBC of a single vertex is the k-step BC of that vertex. The introduced centrality measures may find uses in applications where it is important or critical to obtain the information within a fixed time of the start of the communication. For the introduced centrality measures, we propose an algorithm that can compute successively the k-step GBC of several groups of vertices. The performance of the proposed algorithm is evaluated through computational experiments. The use of the new BC measures leads to an earlier control of the information (virus, malware, or rumor) before it spreads through the network.
Subject Keywords
Modelling and Simulation
,
General Decision Sciences
,
General Computer Science
,
Applied Mathematics
,
Computational Mathematics
URI
https://hdl.handle.net/11511/46371
Journal
COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY
DOI
https://doi.org/10.1007/s10588-019-09301-9
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
K-step betweenness centrality
Akgün, Melda Kevser; Tural, Mustafa Kemal; Department of Industrial Engineering (2019)
The notions of betweenness centrality (BC) and its extension group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between a randomly chosen pair of vertices through a randomly chosen shortest path within the first k steps of the start of the communication. The k-ste...
Generating the surface mapping class group by two elements
Korkmaz, Mustafa (American Mathematical Society (AMS), 2005-01-01)
Wajnryb proved in 1996 that the mapping class group of an orientable surface is generated by two elements. We prove that one of these generators can be taken as a Dehn twist. We also prove that the extended mapping class group is generated by two elements, again one of which is a Dehn twist. Another result we prove is that the mapping class groups are also generated by two elements of finite order.
REFLECTION GROUP RELATIONS ARISING FROM CLUSTER ALGEBRAS
Seven, Ahmet İrfan (American Mathematical Society (AMS), 2016-11-01)
There is a well-known analogy between cluster algebras and Kac-moody algebras: roughly speaking, Kac-Moody algebras are associated with symmetrizable generalized Cartan matrices while cluster algebras correspond to skew-symmetrizable matrices. In this paper, we study an interplay between these two classes of matrices. We obtain relations in the Weyl groups of Kac-Moody algebras that come from mutation classes of skew-symmetrizable matrices. More precisely, we establish a set of relations satisfied by the re...
CLUSTER ALGEBRAS AND SEMIPOSITIVE SYMMETRIZABLE MATRICES
Seven, Ahmet İrfan (American Mathematical Society (AMS), 2011-05-01)
There is a particular analogy between combinatorial aspects of cluster algebras and Kac-Moody algebras: roughly speaking, cluster algebras are associated with skew-symmetrizable matrices while Kac-Moody algebras correspond to (symmetrizable) generalized Cartan matrices. Both classes of algebras and the associated matrices have the same classification of finite type objects by the well-known Cartan-Killing types. In this paper, we study an extension of this correspondence to the affine type. In particular, w...
Generalized Shioda-Inose structures on K3 surfaces
Onsiper, H; Sertoz, S (Springer Science and Business Media LLC, 1999-04-01)
In this note, we study the action of finite groups of symplectic automorphisms on K3 surfaces which yield quotients birational to generalized Kummer surfaces. For each possible group, we determine the Picard number of the K3 surface admitting such an action and for singular K3 surfaces we show the uniqueness of the associated abelian surface.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. K. Akgun and M. K. Tural, “k-step betweenness centrality,”
COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY
, pp. 55–87, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46371.