Faster computation of successive bounds on the group betweenness centrality

Date

2017-07-17

Author

Dinler, Derya
Tural, Mustafa Kemal

Metadata

Show full item record

Item Usage Stats

101
views

0
downloads

We propose a method that computes bounds on the group betweenness centrality (GBC) of groups of vertices of a network. Once certain quantities related to the network are computed in the preprocessing step that takes urn:x-wiley:00283045:media:net21817:net21817-math-0001 time, where n is the number of vertices in the network, our method can compute bounds on the GBC of any number of groups of vertices successively, for each group requiring a running time proportional to the square of its size. Our method is an improvement of the method of Kolaczyk et al. [Social Networks, 31, 3 (2009)], which has to be restarted for each group making it less efficient for the successive GBC computations. In addition, the bounds used in our method are stronger and/or faster to compute. Our computational experiments show that in the search for a group of a certain size with the highest GBC value, our method reduces the number of candidate groups substantially and in some cases the optimal group can be found without exactly computing the GBC values which is computationally more demanding.

URI

https://www.euro-online.org/conf/admin/tmp/program-ifors2017.pdf
https://hdl.handle.net/11511/85618

Conference Name

21st Conference of the International Federation of Operational Research Societies, (17 - 21 Temmuz 2017)

Collections

Department of Industrial Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Faster computation of successive bounds on the group betweenness centrality DİNLER, DERYA; Tural, Mustafa Kemal (2018-06-01) We propose a method that computes bounds on the group betweenness centrality (GBC) of groups of vertices of a network. Once certain quantities related to the network are computed in the preprocessing step that takes O(n(3)) time, where n is the number of vertices in the network, our method can compute bounds on the GBC of any number of groups of vertices successively, for each group requiring a running time proportional to the square of its size. Our method is an improvement of the method of Kolaczyk et al....
Faster Computation of Successive Bounds on the Group Betweenness Centrality Dinler, Derya; Tural, Mustafa Kemal (2017-12-06) Numerous measures have been introduced in the literature for the identification of central nodes in a network, e.g., group degree centrality, group closeness centrality, and group betweenness centrality (GBC) [1]. The GBC of a group of vertices measures the influence the group has on communications between every pair of vertices in the network assuming that information flows through the shortest paths. Given a group size, the problem of finding a group of vertices with the highest GBC is a combinatorial pro...
Faster residue multiplication modulo 521-bit mersenne prime and application to ECC Ali, Shoukat; Cenk, Murat; Department of Cryptography (2017) We present faster algorithms for the residue multiplication modulo 521-bit Mersenne prime on 32- and 64-bit platforms by using Toeplitz Matrix-Vector Product (TMVP). The total arithmetic cost of our proposed algorithms is less than the existing algorithms and we select the ones, 32- and 64-bit residue multiplication, with the best timing results on our testing machine(s). For the 64-bit residue multiplication we have presented three versions of our algorithm along with their arithmetic cost and from impleme...
Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC Ali, Shoukat; Cenk, Murat (2018-08-01) We present faster algorithms for the residue multiplication modulo 521-bit Mersenne prime on 32- and 64-bit platforms by using Toeplitz matrix-vector product. The total arithmetic cost of our proposed algorithms is less than that of existing algorithms, with algorithms for 64- and 32-bit residue multiplication giving the best timing results on our test machine. The transition from 64- to 32-bit implementation is full of challenges because the number of limbs doubles and the limbs' bitlengths are cut in half...
Possible manifestation of new scalar interaction in P-odd asymmetries in Lambda(b)->Lambda(+)(-)(T)(T) decay Alıyev, Tahmasıb; Savcı, Mustafa (Springer Science and Business Media LLC, 2006-10-01) Using the helicity amplitude method and including a new scalar type interaction in the matrix element of the exclusive semileptonic Lambda(b) -> Lambda tau(+) tau(-) decay, P-odd asymmetries with polarized and unpolarized heavy baryons are investigated. The result is obtained that the study of P-odd asymmetries can be promising for establishing the new scalar sector beyond the SM.

Citation Formats

D. Dinler and M. K. Tural, “Faster computation of successive bounds on the group betweenness centrality,” presented at the 21st Conference of the International Federation of Operational Research Societies, (17 - 21 Temmuz 2017), Québec City Convention Centre, Québec City, Canada, 2017, Accessed: 00, 2021. [Online]. Available: https://www.euro-online.org/conf/admin/tmp/program-ifors2017.pdf.