<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>SEBD</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Analyzing the dynamics of user influence in Threads</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>(Discussion Paper)</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DII, Polytechnic University of Marche</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Gianluca Bonifazi</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>33</volume>
      <fpage>16</fpage>
      <lpage>19</lpage>
      <abstract>
        <p>One of the most common analyses in social networks concerns power users (also called influencers, lead users, influential users, etc.), i.e. users who play a crucial role in the dissemination of information in a social platform. In this paper, we want to make a double contribution to this line of research by proposing a new definition of power users that takes into account the four main centralities of Social Network Analysis and then applying it to Threads, a social platform that is still little studied by social network analysts because of its young age.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Threads</kwd>
        <kwd>Power Users</kwd>
        <kwd>Influencers</kwd>
        <kwd>Influential Users</kwd>
        <kwd>Lead Users</kwd>
        <kwd>Social Network Analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>concept of power user and then we use this definition to propose an approach for detecting and
characterizing power users in Threads.</p>
      <p>
        Our definition of power user is intended to be highly selective and based on well-known
concepts in SNA in order to take advantage of the knowledge that social network analysts have
discovered in the past. In particular, it is based on the idea that to be a power user, it is not
enough for a user to have many connections, but she/he must be close to as many users as
possible, act as a bridge between communities of users who would otherwise not communicate,
and have connections with other power users. In SNA, these properties are identified with
the four classical forms of centrality (degree, closeness, betweenness, and eigenvector) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ];
therefore, in our conception, a power user must simultaneously have very high values of all the
four centralities (and thus be among the top users for each of them).
      </p>
      <p>
        There are so many approaches to power user detection in the literature that it would be
impossible to cover all of them in this paper. For example, the approaches described in [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">13, 14,
15, 16, 17, 18, 19, 20</xref>
        ] are only recent approaches that search for power users by considering
information other than centralities. In contrast, the approaches of [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">5, 6, 4, 7</xref>
        ] are close to ours
in that they are based on centralities. However, none of them considers closeness centrality,
which instead plays a very important role and is orthogonal to other forms of centrality such
as degree centrality [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Clearly, by imposing the need for high values of all four centralities
simultaneously, our approach is extremely selective, implying that the power users it finds (if
any) are very strong.
      </p>
      <p>The rest of this paper is organized as follows: in Section 2, we illustrate the Threads dataset
and the model used to represent Threads. In Section 3, we present the concept of power users
and formulate an approach for power user detection in Threads. In Section 4, we characterize
the detected power users. Finally, in Section 5, we draw our conclusions and look at possible
future developments.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Dataset and Threads modeling</title>
      <p>For our experiments, we constructed a dataset containing all posts and comments published
in Threads from December 14, 2023 to February 21, 2024. It can be downloaded from the
following GitHub repository: https://github.com/ecorradini/Threads_Dataset. It is anonymized
to protect the privacy of Thread users. It is important to highlight that Threads has a feature
that distinguishes it from other content-based social platforms in that each comment is itself a
post. Therefore, for each post/comment, we stored the possible “parent post” so that we could
reconstruct discussions conducted by multiple users through chains of posts/comments.</p>
      <p>Once the dataset was constructed, it was necessary to define a model to represent Threads.
To do this, we use a network  = ⟨, ⟩.  is the set of nodes in  . There is a node  ∈ 
for each user who posted on Threads. Since there is a biunivocal correspondence between a
node  and its corresponding user , we will employ these two terms interchangeably in
the following.  is the set of arcs in  . An arc  = (,  ) ∈  indicates that  posted a
comment in response to a post made by  and, by implication, that  piqued ’s interest.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Defining and detecting power users in Threads</title>
      <p>In Table 1, we report some basic measures of  . The examination of the values of these measures
reveals a scenario typical of a new social network, in which interactions are still limited, users
know each other little, and tend to interact on the basis of their content of interest rather than
on the basis of their indegree or outdegree, as evidenced by the almost null value of indegree
and outdegree assortativity.</p>
      <p>After this initial analysis, since our definition of power users is based on the four centralities,
we calculated the corresponding distributions. They are shown in Figure 1. We considered only
the indegree centrality and not the outdegree centrality because it is precisely the indegree
centrality that indicates whether a user in  has attracted the interest of other users.</p>
      <p>
        From the figure, we can see that the distribution of indegree centrality follows a very steep
power law, the distribution of closeness centrality resembles the superposition of two
bellshaped curves with diferent heights and a “half-bell-shaped” curve, and the distributions of
betweenness centrality and eigenvector centrality follow a very steep power law. Basically, the
four distributions respect what is predicted for them by social network theory [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Looking at
them, we notice the presence of a small number of nodes that have extremely high centrality
values. This is not entirely surprising, except for the fact that this is also the case for closeness
centrality, which generally does not show this characteristic [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. At this point, we can ask
whether the nodes with high centrality in the four distributions are always the same or whether
they are diferent. SNA tells us that they are generally diferent in the diferent centralities [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
Therefore, if they were the same, we would be in the presence of very strong users.
      </p>
      <p>As a first test of this hypothesis, we computed the Spearman’s correlation coeficient [ 21]
between the diferent centrality measures and saw that there is a strong correlation (equal to
0.46 on a scale between -1 and 1) between indegree centrality and closeness centrality, which
should be uncorrelated for social network theory. This reinforces the idea that there may be
some nodes in  having high values for all four centralities. To test this idea, we calculated the
top 20% of nodes for each centrality, resulting in four sets of nodes. The 20% value is empirical
and was chosen based on the fact that three of the four distributions follow a power law, as
well as the desire to focus only on the most important nodes while not losing strong nodes, and
thus potential power users. The 20% threshold represents a reasonable tradeof between the
latter two requirements.</p>
      <p>At this point, we calculated the intersection of the four sets thus constructed and saw that
it returned 1,176 users corresponding to the 2.59% of total users. Thus, we found that in our
Threads dataset there is indeed a set of power users according to our definition. In the next
section, we will analyze the main characteristics of these power users.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Characterizing power users in Threads</title>
      <p>Considering the semantics of the four centrality measures, we can already define some
characteristics of Threads power users. In fact: (i) they are important reference points for other
users; (ii) the information they transmit can reach other users very quickly; (iii) they are able to
transmit information between diferent Threads communities; and (iv) they are connected to
other equally central users, which would lead us to hypothesize the presence of a backbone
between them.</p>
      <p>We calculated and compared the indegree of users and power users, and then the mean and
median of these values. We saw that the mean (resp., median) indegree of power users is 11.96
(resp., 5) times greater than that of users. We expected this for the mean, given our definition of
power users, but it was not obvious for the median. These median values tell us one important
thing, i.e., that the overall indegree distribution is shifted upward for power users.</p>
      <p>At this point, we checked whether there is a backbone connecting power users in Threads, i.e.,
whether they tend to prefer contacts with other power users rather than with other users. To
do this, we considered the subnet  of  consisting only of power users and their connections,
and measured the following parameters of  and  : number of nodes, number of arcs, density,
average clustering coeficient, diameter, average shortest path, average indegree, and normalized
average indegree. The latter parameter was introduced by us and is defined as the ratio of the
average indegree to the number of nodes in the network. It takes into account the fact that
the same value of average indegree on a very large network or on a very small network has
diferent implications. Table 2 shows the value obtained for these parameters.</p>
      <p>Parameter
Number of nodes
Number of arcs
Density
Average clustering coeficient
Diameter
Average shortest path
Average indegree
Normalized average indegree</p>
      <p>From the analysis of this table, we can see that: (i) the density, average clustering coeficient,
and normalized average indegree are much higher in  than in  , meaning that power users
tend to interact and be connected to each other much more than other users; (ii) the average
shortest path and diameter are smaller in  than in  . These results all point in the same
direction, that is, they lead us to conclude that there is indeed a backbone among power users
in Threads. This is an extremely significant result, because it suggests that there is a structured
organization among these users that allows them to strongly influence the behavior of other
users, despite the fact that they are very few in number.</p>
      <p>All previous results have considered the structure of  ; now we want to go further and also
examine the content of the posts/comments and see if there are communities of users with
the same interests in Threads. From this point of view, Threads can be seen as a network of
partially overlapping communities, each interested in a particular topic. In such a scenario,
we want to see if power users act as connectors or bridges between diferent communities. If
this were true, the backbone of power users would also act as a “glue” that holds the various
Threads communities together.</p>
      <p>To perform this analysis, we first had to find a way to analyze the content exchanged in
Threads. For this purpose, we thought to look at the topics that users were discussing through
their posts/comments. To do this in a simple but efective way, we used OpenAI’s GPT-3.5
and asked it to extract, for each post/comment, the topic that best represented it. Doing this
over our entire dataset, ChatGPT identified 531 topics. This means that there are 531 partially
overlapping communities in our Threads dataset, each comprising all users who published at
least one post/comment on the corresponding topic.</p>
      <p>In Figure 2, we show the distribution of posts with respect to topics restricted to the top 50
topics. This distribution follows a power law. In particular, the two topics “Entertainment” and
“Politics” have a much larger number of associated posts than the other topics. A third topic
that still has a significant number of associated posts is “Technology”. From the fourth topic on,
we see a slow decrease in the number of posts associated with each topic.</p>
      <p>16000
14000
12000
s
t
so10000
p
f
o
r
e
bm8000
u
N
6000
4000
2000
0
itttraeeEnnnm iiltscPo lcyTooenhg trsoSp isssenuB ltaehH Lvoe iitcooaunnCmm ittrrLaeeu Food trA itcoaEnud itooEnm iltroaeenbC iscuM ltreuuC lisyPoohhp isFoanh lrvTae isccooEnm iittvooanM icFaenn ittrcyaennU tryPooahhpg iitrcoaenppA tyaeuB rouHm ittraeudG Law ilFyam itcyoeS ltyoeEnpmm iittryvaeC llsseenW traeehW iisssconuD iangGm iTem ittcxeeEnm iJtsceu treeengAm lraeenG itrkaengM traeuN iaedM itrcPoeenp iraenngdG icceenS ftyaeS sscceuS
Topics</p>
      <p>In Figure 3, we show the distribution of power users with respect to topics restricted to the
top 50 topics. This distribution is much less steep than the previous one. In fact, the two topics
“Entertainment” and “Politics” still dominate the others, but this dominance is not as pronounced
as in Figure 2. Again, we see a slow decline in the number of power users associated with each
topic. Comparing Figure 3 with Figure 2, we can see some interesting diferences. For instance,
the topic “Technology”, which was third in Figure 2, drops to eight in Figure 3, while the topic
“Education”, which was twelfth in Figure 2, rises to fifth in Figure 3.</p>
      <p>In Figure 4 (resp., 5), we show the distribution of users (resp., power users) with respect to
topics restricted to the top 50 topics. For each topic, we show the number of users (resp., power
users) who published at least one post on it. In the figure, we consider two classes of users
(resp., power users) called “unique” and “shared”. Given a topic, the former consists of users
(resp., power users) who published posts only on it, while the latter includes users (resp., power
users) who published posts on it and at least one other topic.</p>
      <p>By comparing the two figures, we can draw some important conclusions. First of all, there
are some important diferences in the position of topics in the two distributions. For example,
“Technology” is ranked third in Figure 4 and eighth in Figure 5, while “Education” is ranked
eleventh in Figure 4 and fifth in Figure 5. However, the most important information that can be
obtained by comparing the two figures is the diference in the proportion of users and power
users belonging to the “unique” and “shared” classes. In fact, for a given topic, the proportion
of power users belonging to the “shared” class is generally larger than the corresponding
itttraeennnm iiltscPo trsopS ltaehH itcoaEnud isssenuB ittrrLaeeu lcyTooenhg iitcoannumm iscuM ilsyPoohhp iltroaeenbC trA lrvTae ltreuuC isFoanh icFaenn iittvooanM tryPooahhpg ittrcyaennU Law rouHm ltyoeEnpmm itcyoeS Food iitrcoaenppA isccooEnm Lvoe llsseenW tyaeuB ittcxeeEnm itooEnm iisssconuD traeehW iangGm iittrvyaeC iJtsceu treeengAm iTem itrkaengM traeuN icceenS itrcPoeenp liFyam iraenngdG ittraeudG iaedM lraeenG sscceuS ftyaeS
E o
itttraeennnm iiltscPo lcyTooenhg trsopS ltaehH isssenuB Lvoe iitcoannumm ittrrLaeeu itooEnm itcoaEnud trA Food iltroaeenbC iscuM ltreuuC isFoanh lisyPoohhp lrvTae isccooEnm iittvooanM ittrcyaennU iitrcoaenppA icFaenn tryPooahhpg rouHm ittraeudG tyaeuB itcyoeS ilFyam ltyoeEnpmm iittryvaeC Law iisssconuD llsseenW traeehW ittcxeeEnm iTem iangGm iJtsceu lraeenG treeengAm traeuN itrkaengM itrcPoeenp iaedM sscceuS iraenngdG ftyaeS icceenS
E o
"shared" (50 most frequent topics in )</p>
      <p>proportion of users. This seems to be a first confirmation of our hypothesis that power users can
act as “bridges” (and their backbone as a “glue”) to hold the diferent communities of Threads
together.</p>
      <p>To test whether our hypothesis was true, we performed the following additional experiment:
(i) we selected the 50 most frequent topics in terms of the number of users who made at least
one post on them; these are the 50 topics that appear in Figure 4; (ii) we considered the 2,450
topic pairs that could be obtained from them; (iii) for each pair, we calculated the number of
users in common between the two topics of the pair; (iv) for all pairs with a number of users in
common greater than 0, we calculated the ratio of power users in common to users (involving
power users) in common; (v) we averaged the values thus obtained.</p>
      <p>The value of this average is 0.4637, which is much higher (in particular, 17.90 times higher) than

the percentage of power users in (which, as we have seen, was 0.0259). This result confirms
the hypothesis that power users act as “bridges” between diferent Threads communities, and
the backbone of power users acts as the “glue” that holds these communities together.
Unique
Shared</p>
      <p>With this analysis, we have completed our characterization of power users in Threads. We
have shown that these users are critical to the information difusion in this social platform. We
have also shown that power users are able to: (i) influence user behavior, (ii) hold together the
diferent communities that make up this social platform, and (iii) influence the Threads life and
evolution.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In this paper, we have first proposed a new definition of power users based on the classic
centrality measures of SNA, in order to exploit the knowledge accumulated on this topic over
the years. Then, we have defined an approach for power user detection and applied it to
Threads, and we have seen that there are indeed power users on this social platform. Finally,
we have presented an experimental campaign to characterize power users in Threads. From a
structural point of view, we have shown that power users form a backbone capable of rapidly
spreading information in Threads and strongly influencing user behavior on this social platform.
From a content point of view, we have shown that their backbone acts as a “glue” capable of
holding together the diferent communities that make up Threads, which would otherwise risk
remaining isolated.</p>
      <p>Threads is a very young network and for this reason it is still little studied. Moreover, it
has some peculiarities that distinguish it from all the other existing social networks, first of
all its growth model based on Instagram. For this reason, we think it makes sense to conduct
research in the future to better understand this platform. For example, we would like to define
mechanisms to measure the trust, reputation and reliability of Threads users based on the
posts/comments they publish and, more generally, on their behavior. Second, we would like to
verify if there are phenomena of assortativity, both of status and of value, within Threads and,
if so, we would like to investigate their causes. Last but not least, we would like to study the
dynamics by which the diferent user communities in Threads are born, evolve, and eventually
die.</p>
    </sec>
    <sec id="sec-6">
      <title>Declaration on Generative AI</title>
      <p>The authors have not employed any Generative AI tools.
[16] S. Wu, W. Li, H. Shen, Q. Bai, Identifying influential users in unknown social networks for
adaptive incentive allocation under budget restriction, Information Sciences 624 (2023)
128–146. Elsevier.
[17] J. Bhadra, A. Khanna, A. Beuno, A Graph Neural Network Approach for Identification
of Influencers and Micro-Influencers in a Social Network: Classifying influencers from
non-influencers using GNN and GCN, in: Proc. of International Conference on Advances
in Electronics, Communication, Computing and Intelligent Information Systems
(ICAECIS’23), IEEE, Bangalore, India, 2023, pp. 66–71.
[18] S. Iqbal, R. Khan, R. Khan, F. Alarfaj, A. Alomair, M. Ahmed, Association Rule
AnalysisBased Identification of Influential Users in the Social Media., Computers, Materials &amp;
Continua 73 (2022). Tech Science Press.
[19] M. Hasan, A. Bakar, M. Yaakub, Measuring user influence in real-time on twitter using
behavioural features, Physica A: Statistical Mechanics and its Applications 639 (2024)
129662. Elsevier.
[20] W. Karoui, N. Hafiene, L. B. Romdhane, Machine learning-based method to predict
influential nodes in dynamic social networks, Social Network Analysis and Mining 12
(2022) 108. Springer.
[21] J. Zar, Spearman rank correlation: overview, Wiley StatsRef: Statistics Reference Online
(2014). Wiley Online Library.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wilson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Boe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Puttaswamy</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Zhao,</surname>
          </string-name>
          <article-title>User interactions in social networks and their implications</article-title>
          ,
          <source>in: Proc. of the ACM European Conference on Computer systems (EuroSys'09)</source>
          , Nuremberg, Germany,
          <year>2009</year>
          , pp.
          <fpage>205</fpage>
          -
          <lpage>218</lpage>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Buccafurri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Foti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nocera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ursino</surname>
          </string-name>
          ,
          <article-title>Bridge Analysis in a Social Internetworking Scenario</article-title>
          ,
          <source>Information Sciences 224</source>
          (
          <year>2013</year>
          )
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Buccafurri</surname>
          </string-name>
          , G. Lax,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nicolazzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nocera</surname>
          </string-name>
          ,
          <article-title>Comparing Twitter and Facebook user behavior: Privacy and other aspects</article-title>
          ,
          <source>Computers in Human Behavior</source>
          <volume>52</volume>
          (
          <year>2015</year>
          )
          <fpage>87</fpage>
          -
          <lpage>95</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kratzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lettl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Franke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gloor</surname>
          </string-name>
          ,
          <article-title>The social network position of lead users</article-title>
          ,
          <source>Journal of Product Innovation Management</source>
          <volume>33</volume>
          (
          <year>2016</year>
          )
          <fpage>201</fpage>
          -
          <lpage>216</lpage>
          . Wiley Online Library.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yustiawan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Maharani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gozali</surname>
          </string-name>
          ,
          <article-title>Degree centrality for social network with Opsahl method</article-title>
          ,
          <source>Procedia Computer Science</source>
          <volume>59</volume>
          (
          <year>2015</year>
          )
          <fpage>419</fpage>
          -
          <lpage>426</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Howlader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sudeep</surname>
          </string-name>
          ,
          <article-title>Degree centrality, eigenvector centrality and the relation between them in Twitter</article-title>
          ,
          <source>in: Proc. of International Conference on Recent Trends in Electronics, Information &amp; Communication Technology (RTEICT'16)</source>
          , Bangalore, India,
          <year>2016</year>
          , pp.
          <fpage>678</fpage>
          -
          <lpage>682</lpage>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Alp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Öğüdücü</surname>
          </string-name>
          ,
          <article-title>Identifying topical influencers on Twitter based on user behavior and network topology, Knowledge-Based Systems 141 (</article-title>
          <year>2018</year>
          )
          <fpage>211</fpage>
          -
          <lpage>221</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Zareie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sheikhahmadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jalili</surname>
          </string-name>
          ,
          <article-title>Influential node ranking in social networks based on neighborhood diversity</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          <volume>94</volume>
          (
          <year>2019</year>
          )
          <fpage>120</fpage>
          -
          <lpage>129</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <article-title>Identifying influencers in social networks</article-title>
          ,
          <source>Entropy</source>
          <volume>22</volume>
          (
          <year>2020</year>
          )
          <article-title>450</article-title>
          . MDPI.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Subramani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. V.</given-names>
            <surname>Easwaramoorthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sambath</surname>
          </string-name>
          ,
          <article-title>A gradient boosted decision tree-based influencer prediction in social network analysis</article-title>
          ,
          <source>Big Data and Cognitive Computing</source>
          <volume>7</volume>
          (
          <year>2023</year>
          )
          <article-title>6</article-title>
          . MDPI.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B.</given-names>
            <surname>Anastasiei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dospinescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Dospinescu</surname>
          </string-name>
          ,
          <article-title>Word-of-mouth engagement in online social networks: Influence of network centrality and density</article-title>
          ,
          <source>Electronics</source>
          <volume>12</volume>
          (
          <year>2023</year>
          )
          <article-title>2857</article-title>
          . MDPI.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tsvetovat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kouznetsov</surname>
          </string-name>
          ,
          <article-title>Social Network Analysis for Startups: Finding connections on the social web</article-title>
          , Sebastopol, CA, USA,
          <year>2011</year>
          .
          <string-name>
            <given-names>O</given-names>
            <surname>'Reilly Media</surname>
          </string-name>
          , Inc.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Purba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Asirvatham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Murugesan</surname>
          </string-name>
          ,
          <article-title>Influence maximization difusion models based on engagement and activeness on instagram</article-title>
          ,
          <source>Journal of King Saud University-Computer and Information Sciences</source>
          <volume>34</volume>
          (
          <year>2022</year>
          )
          <fpage>2831</fpage>
          -
          <lpage>2839</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mallik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khetarpal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Panda</surname>
          </string-name>
          ,
          <article-title>Influence maximization in social networks using graph embedding and graph neural network</article-title>
          ,
          <source>Information Sciences 607</source>
          (
          <year>2022</year>
          )
          <fpage>1617</fpage>
          -
          <lpage>1636</lpage>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bartolucci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Caccioli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Caravelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Vivo</surname>
          </string-name>
          ,
          <article-title>Ranking influential nodes in networks from aggregate local information</article-title>
          ,
          <source>Physical Review Research</source>
          <volume>5</volume>
          (
          <year>2023</year>
          )
          <article-title>033123</article-title>
          . APS.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>