The Impact of Social Curiosity on Information Spreading on Networks

The Impact of Social Curiosity on Information Spreading on Networks

Abstract

Most information spreading models consider that all individuals are identical psychologically. They ignore, for instance, the curiosity level of people, which may indicate that they can be influenced to seek for information given their interest. For example, the game Pokémon GO spread rapidly because of the aroused curiosity among users. This paper proposes an information propagation model considering the curiosity level of each individual, which is a dynamical parameter that evolves over time. We evaluate the efficiency of our model in contrast to traditional information propagation models, like or , and perform analysis on different types of artificial and real-world networks, like Google+, Facebook, and the United States roads map. We present a mean-field approach that reproduces with a good accuracy the evolution of macroscopic quantities, such as the density of stiflers, for the system’s behavior with the curiosity. We also obtain an analytical solution of the mean-field equations that allows to predicts a transition from a phase where the information remains confined to a small number of users to a phase where it spreads over a large fraction of the population. The results indicate that the curiosity increases the information spreading in all networks as compared with the spreading without curiosity, and that this increase is larger in spatial networks than in social networks. When the curiosity is taken into account, the maximum number of informed individuals is reached close to the transition point. Since curious people are more open to a new product, concepts, and ideas, this is an important factor to be considered in propagation modeling. Our results contribute to the understanding of the interplay between diffusion process and dynamical heterogeneous transmission in social networks.

\IEEEpeerreviewmaketitle

1 Introduction

Information spreading research relates to understanding how rumors, news and behaviors spread on a large scale in a short time. The diffusion of information is a ubiquitous process in the society, where people are interacting with each other all the time, making contact and exchanging information in the public transport, at work or school, the Internet and at home [1, 2]. In this way, the maximization of the transmission of some information on social networks and the society is important for scenarios like viral marketing, political and ideological campaigns, among others.

After the establishment of Network Sciences [3, 4], more accurate models have been introduced for analyzing the spread of information as social contagion processes [5, 6, 7, 8, 9]. Within these models, the epidemic model has been applied extensively in research areas like opinion formation, decision making, and information or rumor propagation [5, 6]. The spreading of information can be approached as a psychological contagion where an idea passes from person to person and “contaminates” the mind of many individuals [9]. In the classical approach people are divided into three groups or states: ignorant (those not aware of the information), spreaders (those who spread the information), and stiflers (those who know the information but stop trying to convince others).

However, most models on spreading processes consider homogeneous or static transmission probabilities [4, 5, 6], i.e., each individual has a fixed likelihood of transmission over time. Moreover, the curiosity has been disregarded in these models until now, although it is expected to have an impact on diffusion processes: the more surprising a rumor, the more rapidly and extensively it is likely to spread. Also, the more people know the information and the more sources that spread it, the higher the likelihood of accepting that information. The curiosity is psychologically defined as the desire of knowledge and experiences that lead to exploratory behavior and the acquisition of new information [10, 11, 12]. It is also associated with the reward of two kind of triggers, the cognitive curiosity and sensory curiosity [10]. A person often gets curious about some behaviors of his/her friends; a phenomenon known as the social curiosity in psychology [12].

(a)
(b)
(c)
(d)
Figure 1: (Color online) Illustration of four consecutive time steps in the Social Curiosity model for information spreading on networks. (a) Vertex 1 is the only initial spreader (red circle). Vertex 2 is ignorant (white circle) and has no curiosity because none of its neighbors knows about the information. (b) Vertex 1 randomly convinces two neighbors and it turns into stifler (gray circle). Vertex 2 starts to become curious about the information (blue bars inside the circle) since one of its five neighbors is informed. (c) Given that already three neighbors of vertex 2 know the information, its curiosity level and thus the chances to get the information are increased. (d) Eventually, vertex 2 becomes informed due to its curiosity and the contact with spreaders.

In this paper, we aim to model the information spreading on networks taking into account the human curiosity. We evaluated how information (for instance a rumor) propagates considering the social curiosity, which is high if more friends are talking about the spreading rumor (Figure d). One motivational example is the rapid outbreak of the game Pokémon GO [13, 2] launched by Niantic in July 2016 and that is based on the 1990’s Pokémon video games. It became a social phenomenon that achieved a high popularity in a short time, being the app in the iOS App Store with more downloads in one week than any other in the same period, and one of the most commented topics in on-line and traditional magazines, Social Networks, among others [2]. This success is probably due to the fact that the game promotes an interesting mix of virtual reality and socialization activities in public spaces where players can interact, which arouses the curiosity of people that are not part of the game [12]. The probability that a person becomes player increases if more of its neighbors or friends are playing it. In this article, we show by analytical and numerical simulations that including the psychological characteristics of individuals, such as the curiosity, improves the diffusion of information in traditional spreading models.

The major contributions of this work are: i) we provide a more detailed and realistic description of information spreading processes with the combination of the curiosity mechanism and the model of epidemics. ii) We define a dynamical measure of the social curiosity for each subject in its neighborhood. iii) A mathematical model for information spreading is presented, including different probabilities of contagion and the dynamical curiosity that evolves over time. iv) We provide an analytical solution for the final density of informed individuals, which is and agrees quite well with simulations results. v) We analyze the impact of curiosity on information spreading, such as the critical threshold, the peak of spreaders and the final density of informed individuals, in artificial and real-world networks. The results indicate that depending on the transmission parameters, the social curiosity improves the propagation process in nearly twice the expected value of the non-curiosity case. Besides, the curiosity increases the peak in the number of spreaders reached during the propagation process and speeds up the propagation. These results suggest that the social curiosity is an important feature to be considered in spreading processes, by marketing campaigns and in the analysis of information spreading models.

The remaining of this paper is organized as follows. Section 2 presents the literature on related models for information diffusion on networks. Section 3 brings some concepts and definitions used in the paper. Section 4 introduces the proposed model for information spreading that includes the social curiosity mechanism. Section 5 shows some experimental results in artificial and real-world networks. In Section 6 we develop a mean-field approach for the model’s dynamics and obtain analytic results. Finally, Section 7 provides the final remarks and future work.

2 Related works

Several models have been proposed for modeling propagation dynamics on networks [5, 6, 7, 8, 9, 14, 15, 16, 17]. These models consider some assumptions about the propagation process and network structure, like the degree correlation or distribution, classes of vertices, among others [5, 6, 7, 8]. The majority of the spreading models consider only homogeneous or fixed transmission probabilities, i.e., each vertex has the same likelihood of transmitting the information [7, 6, 8]. For instance, in [9] the authors propose a discrete-time model for rumor propagation with heterogeneous transmission probabilities, but still, each vertex has a constant probability over time. Other transmission models consider characteristics like short-term of immunity or steady active state [4], and spreaders’ procrastination in the transmission of information by heterogeneous delays [14]. Also, there are some proposals that introduced disbelieving or forgetting mechanism [15], lost of interest [16], apathy and many others [6]. Regarding the contagion dynamic, the diffusion process can be spontaneous or by different kind of contact interaction or adaptation among the subjects [17].

Previous studies analyzed the effect of the new characteristic in the propagation process and examined numerical and dynamical properties on top of the different type of networks. They looked for critical thresholds, computational cost and accuracy in the results [6]. However, these studies of information spreading assumed fixed parameters and the curiosity mechanism was also disregarded [5, 7, 6, 8]. Here, we consider the curiosity as an important factor to determinate the speed and coverage of information spreading on networks.

3 Concepts and methods

An information system can be represented as a network (or a graph) consisting of two elements: actors (individuals or objects that are the elements of the system) and the connections (interactions, relationships, or social ties) [4]. Formally, let’s consider a network , where is the set of vertices, is the set of edges or connections. The edges can be directed, indicating the flow of the relation, or undirected. Two vertices are called neighbors if they are connected by an edge.

Classical propagation models consider that nodes interact in the same way during the dynamic. The model’s parameter (for propagating or transmitting the signal) and (for recovering or stopping the propagation) are constants and invariant during the process. In the model [4, 6], the susceptibles () are those who remain unaware of the information, the spreaders () are the influencers who disseminate the information, and the stiflers () are those who know the information but lose the interest in the spreading process. The influencers and the stiflers are part of the group of informed individuals. Also, the transition to the stifler state happens spontaneously [6]. Whenever a spreader meets a susceptible neighbor , the latter become spreader with probability . Spreaders turn into stifler with probability .

The effective spreading rate [18, 19, 6] = is the contagion strength or infectivity level of the propagation. The final density of informed individuals is equivalent to the combination of and that hold the same value [4, 18, 9]. In epidemics, this is known as the basic reproductive ratio[4] and a global endemic phase is reached by infectivity levels above a critical threshold (), while no endemic phase appear whenever the contagion strength is below . For random and uncorrelated networks,  [6], where and are the mean and the second moment of the degree distribution, respectively.

Another propagation model is the Independent Cascade () model [7, 8]. The difference with the model yields in the transition to the stifler (inactive spreaders) state [5], which happens instantly in the next iteration step. In fact, the can be approached as a variation of the model [20]. Both models are spreader-centric, i.e., the contagion occurs given the contact interaction of the spreaders. In the model, the spreaders try to pass the information only once, which is equivalent to the with parameter . The models are also incremental monotonic functions, and they can consider heterogeneous probabilities in the diffusion [19, 8, 9].

4 Curiosity in spreading process

We present a discrete-time approach including the social curiosity property, centered in the propagation dynamic of each vertex on arbitrary network structure. The approach follows the states and the social curiosity is as a parameter that evolves over time. This parameter introduces a susceptible-centric approach, affecting the behavior of each susceptible vertex. We consider vertices with different curiosity levels and this approach is rooted on the observation that activity patterns are essentially heterogeneous [9] and people do not behave in the same way when asking for information.

Figure 2: (Color online) Dynamical rules of the proposed model. Vertex is making contact with the neighbor , in which: the first line, is a spreader (red circles) that convinces its ignorant neighbor (white circles) with probability ; the second line, is an ignorant that asks for information to its spreader neighbor with probability and get convinced with probability . The third line is the spontaneous transition of to stop the propagation of the information (stifler state in gray circles).

4.1 Curiosity measurement

The personality, as an inherent characteristic of an individual, has a role in the organization of people on the network, and in turn, they position reinforce specific personality traits [1]. A range of network-based features is correlated with specific characteristics of individuals [21, 1, 2]. For instances, the Extroversion, one of the Five-Factor Model of personality [1, 2], is positively correlated with the number of friends or connections of a person [1]. In particular, the Openness to experience refers to an individual’s curiosity and willingness to engage in new experiences. The Extroversion and Openness are positively related with the capacity of higher social engagement [1]. The before is in accordance with a social study about the users of Pokémon GO [2], where was reported that individuals with high level of Openness also were the early adopters.

In the case of epidemic or information spreading process, the “early adopters” are correlated to the network centrality, where the most central nodes are reached at an early stage [20]. This is explained by the higher interaction of individuals with their pairs and the update of their states as a consequence of these interactions. This property is known as the homophily phenomena or assortative mixing [20], the tendency of similar nodes to be connected, which is the main characteristic of social relationship.

Definition.

(Curiosity Strength) The curiosity strength is the probability that a susceptible vertex asks a spreader neighbor about some information.

Thus, given that the Openness to experience individuals are part of the group of early adopters and they are somehow positively correlated with the connection structure of the network, we can consider that higher the scores in Openness to experience, the more strongly connected the individual. For a more realistic scenario, we define the social curiosity for a given vertex () as the fraction of informed neighbors over time (Figure d). Thus, the higher the level of social curiosity, the higher the probability of a susceptible vertex makes contact with a spreader. Therefore, the chances of the susceptible vertices take an action for searching for information depends on the propagation process and the size of their networks.

When , we recover the and the models. The Utopian case happens when all the individuals are always curious (). The critical threshold for the maximum curiosity case, , and the critical threshold of non-curiosity case, , are the lower and upper bound of the critical threshold for the proposed social curiosity measure (), i.e, .

4.2 Monte Carlo simulation

We consider a constant population of vertices in all time steps. The spreading dynamic is a stochastic process where each vertex has a probability of being in a possible state over time. The density of susceptible , spreader or stifler vertices satisfies for all time steps. At each time step, all spreaders uniformly try to infect their neighbors with probability , or stop the diffusion with probability . The dynamical rules that define the general diffusion process are depicted in Figure 2.

0:  , , , , , , Initialization :
1:  repeat
2:     
3:     , ,
4:     for all vertex such that  do
5:        for all neighbor of such that  do
6:           if  infected with probability  then
7:              
8:               // update the states
9:           end if
10:        end for
11:        if  gets recovered with probability  then
12:           
13:           
14:        end if
15:     end for
16:     for all vertex such that  do
17:        for all neighbor of such that  do
18:           if  gets curious with probability and gets infected by with probability  then
19:              
20:              
21:           end if
22:        end for
23:     end for
24:  until 
25:  return  
Algorithm 1 MC for information spreading with curiosity.

The Monte Carlo (MC) algorithm for the simulations consider the following variables at time : (i) that represents the set of ignorants, (ii) the set of spreaders or seeds and (iii) the set of stiflers. Vertices belong to only one of the states over time, i.e., if , and always . In terms of MC implementation, we assume that infection and recovering do not occur during the same time step. The contact interaction happens with all the neighbors of an informed node in each time step, known as reactive process (RP) [22]. The macroscopic densities of susceptible () over time is calculated as , where is the size of the set. For the other states, we adopt a similar approach.

The end of the simulation is reached when . Thus, the final fraction of informed individuals is or . The algorithm for the information spreading with curiosity (Algorithm 1) needs as input the network , the set of initial states of the vertices , , , the transmission probabilities , and the vector of node curiosity. The sets of vertices states can be approached as a structured list of nodes in a specific time step. For illustrative purpose, the steps (7 - 8), (12 - 13) and (19 - 20) are the same procedure for updating the state of the vertex, but it can be generalized in a separated function. Also, the part of propagation by curiosity, steps (16 - 23), can be refactored in a main loop (step 4) that considers all the vertices.

The complexity of the MC algorithm is determined by: (i) the maximum number of steps in which ; (ii) the number of iterations in the loops of the classical (step 4) and curiosity (step 16) propagation, which are and can be approximated to ; (iii) the computational cost of copying and updating the sets, which can be considered as a constant value ; and (iv) the cost of contacting the neighbors of the vertices, which in average for the whole networks is equivalent to . Thus, the complexity of the simulation algorithm is .

5 Experiments

Network
ER
Artificial BA
SSF
USAroad
Real Google+
Facebook
Table 1: Topological properties of the networks considered here.
(a) BA
(b) ER
(c) SSF
(d) Google+
(e) USAroad
(f) Facebook
Figure 3: (Color online) Phase diagram of the macroscopic density of stiflers as a function of parameter for (a) a Barabási-Albert (BA), (b) Erdös-Rényi (ER), (c) spatial scale-free (SSF), (d) Google+, (e) USAroad and (f) Facebook networks. The artificial networks have the same size and average degree , and the real-world networks are described in Table 1. The classical propagation is recovered when , whereas the complete curiosity case occurs for . means the dynamical curiosity over time (Figure d). The values are the average of the final density of stiflers among all vertices. The inset figures are the quotient between the results of considering the dynamical curiosity and the respective of the classical propagation.

The impact of the curiosity in the propagation process was analyzed on top of three network models, presenting different degree distributions, and three real-world networks. We consider the Barabási-Albert [3] (BA), Erdös-Rényi [23] (ER) and Barthélemy spatial scale free [24] (SSF) models, and for real-world networks we adopt the Google+ [25], Facebook [21] and USAroad [26], the road network of USA. Their topological features are summarized in Table 1, with the corresponding average degree , second moment of degree distribution , average shortest path length and assortativity coefficient that measures degree-degree correlation . For the real-world networks we take the main component and assumed them as undirected networks.

5.1 Simulation Setup

We analyze the proposed model of information spreading considering the macroscopic scale of the propagation. For this purpose, the initial setup for each simulation is , e . We calculate the corresponding density of stiflers and spreader over time by taking each vertex as the only initial seed. For this value was considered an average of realizations. The macroscopic density of stiflers is calculated by averaging the number of stifler among all nodes. The macroscopic measures represent the propagation values for the whole network. Without lack of generality, we adopt the recovery probability  [6, 20].

5.2 Simulation results

(a)
(b)
(c)
(d)
(e)
(f)
Figure 4: (Color online) Macroscopic density of spreaders and stiflers over time for (a) a Barabási-Albert (BA), (b) Erdös-Rényi (ER), (c) spatial scale-free (SSF), (d) Google+, (e) USAroad and (f) Facebook networks. Parameter was fixed to a value for USAroad and for the remaining networks. In the figures we have the curves of the average peak of spreaders and the insets are the corresponding average density of stiflers over time. The averages are calculated considering each vertex as a initial seed.

The impact of the social curiosity is evaluated on the information spreading process. Initially, we analyze whether the phase transition for the endemic state is affected by the inclusion of the curiosity parameter. For different values of , the average density of stifler and the critical threshold are evaluated, as shown in Figure f.

We observe that independently of the network structure, i.e., scale-free, spatial or Poisson networks, the curiosity phenomenon improves the overall propagation. For the artificial networks (Fig. a, b, c), the critical threshold of the Utopian case () is very close to half of the corresponding threshold of the non-curiosity configuration (), when . In the real-world networks, the critical thresholds and are very similar and tend to zero, (Fig. d, f). This occurs due to real-world networks have a scale-free organization, characterized by a power-law degree distribution [3, 4] ( with ). In these networks, the critical threshold when . The USAroad is the most homogeneously distributed network, having low variance in the degree distribution and larger average shortest path length (Table 1). The dynamical curiosity () little affects the critical threshold in comparison with the non-curiosity case (). The final density of stiflers is improved in more than twice than the results reached by the non-curiosity case in lower values of , and tend to be ineffective for larger values (inset Figure f).

(a)
(b)
Figure 5: (Color online) (a) Final density of stiflers vs for curiosity (diamonds), (circles) and (squares). Filled symbols correspond to Monte Carlo simulations on Erdös-Renyi networks of size with initial density of spreaders , whereas empty symbols represent the numerical integration of Eqs. (1). Solid lines are the analytical solutions from Eqs. (9). (b) Difference between the final density of stiflers in the dynamic case and in the case, obtained from the data of panel (a).

To study the evolution of the diffusion process, we evaluate the curves of spreaders achieved in each network, and the insets are the corresponding density of stiflers (Figure f). Parameter is fixed to a value close to , which is for USAroad and for the remaining networks. The peak of spreaders and the final density of stiflers for the social curiosity are superior in all the case to the classical spreading approach (). The curves of the peak of spreaders and density of stiflers last the same time than the classical approach. This indicates that the curiosity can improve the extent and velocity of the propagation. Specifically, the peak of the spreaders is twice or higher the respective peaks of the classical approach, except for the Facebook network, which is higher. The curves also achieve more than twice the final density of stiflers of the curves, for the ER, SSF and USAroad networks (inset Fig. b, c,e); it achieves or higher density of stiflers in the BA and Google+ networks (inset Fig. a, d); and it is higher in the Facebook network (inset Fig f).

The results suggest that adopting the social curiosity in the diffusion process can improve the expected density of informed individuals, as well, it increases the peak of spreaders and the velocity of the dynamic. The impact in the results depend on the network topology and the effective spreading rate employed. For instances, for spatially distributed networks like USAroad, we obtain very significant results than in social networks like Google+ or Facebook.

6 Mean-field analysis

The system behavior can be described, at the mean-field level, by the following set of coupled recurrence equations for the time evolution of the densities of individuals , and :

(1a)
(1b)
(1c)

which allows calculating their values at time from the previous time . These equations describe an infinitely large system, where fluctuations due finite-size effects are neglected. Here

(2)

is the probability that a susceptible vertex gets informed from one of its spreader neighbors, and is the curiosity level, i. e., the probability that a susceptible vertex requests the information to each spreader. Within a mean-field approach, the curiosity is approximated as the mean fraction of informed neighbors of a given vertex , , while the exponent in is the estimated mean number of spreader neighbors of . In Eq. (1b), the gain term represents the fraction of susceptible nodes that become spreaders, while the loss term corresponds to the fraction of spreaders that become stiflers in a time step.

In Fig. b(a) we plot the stationary value of vs obtained from Monte Carlo simulations (filled symbols) and compare with results from the numerical integration of Eqs. (1) (empty symbols). Simulations were performed on Erdös-Renyi networks of nodes, starting with a small fraction of spreaders uniformly distributed over the network. Diamonds, squares and circles correspond to curiosity , and , respectively. We observe that the agreement between theory and simulations is quite good for the entire range of . The mean-field solution is also able to capture the transition point at which the final density of stiflers becomes larger than zero, and gives the same qualitative behavior as the corresponding curves for all networks shown in Fig. f. Figure b(b) shows the difference in the values of corresponding to the dynamic case and . We observe that is larger than for the entire range of , and that the difference becomes very large close to the transition point. This shows that the spreading of the information is largely increased when the curiosity mechanism is taken into account.

We now perform the analysis of Eqs. (1) starting from the simplest case in which the curiosity is constant over time. To solve Eqs. (1) we make two approximations. First, we approximate the difference by the time derivative in the continuous time limit, and analogously for and . Next, we assume that is small and expand from Eq. (2) to first order in and obtain

(3)

Then, Eqs. (1) become

(4a)
(4b)
(4c)

Dividing Eq. (4a) by Eq. (4c) we arrive to the equation

(5)

which gives a relation between and . Then, the integration of Eq. (5) gives, after some algebra, the following equation that relates and at all times:

(6)

where we have used the initial condition and . At the stationary state (), and take the values and , respectively, since . Then, the final density of stiflers obeys the equation

(7)

Finally, solving for leads to the expression

(8)

which relates the stationary value of with the propagation force . For the extreme cases and , Eq. (8) is reduced to

(9)

In Fig. b(a) we plot by solid lines the analytical solution vs from Eqs. (9). We observe a very good agreement with the numerical integration of Eqs. (1) (empty symbols). An interesting relation between the two curves can be found from Eqs. (9), that is, . This means that the shape of vs for is the same as that for with the x-axis shifted to the right by the factor .

Another quantity of interest is the transition point between an “endemic phase” where the information spreads to a large fraction of the population for , and a “healthy phase” where the information does not propagate for . Starting from a situation with a very small fraction of spreaders and no stiflers , Eq. (4b) becomes

(10)

with , and where we have neglected terms of order . For (), grows (decays) exponentially fast. Then, at the transition point is , from where arrive to the following expression for :

(11)

For and we obtain, respectively,
and . We can easily check that , in agreement with the shift of the vs curves mentioned above.

We now study the case where the curiosity changes over time according to . Expanding from Eq. (2) to first order in we obtain
. Then, in the continuous time limit Eqs. (1) become

(12a)
(12b)
(12c)

Following an approach similar to the one above for constant , the transition point is obtained by linearizing Eq. (12b) around the fixed point , . This leads to an equation like Eq. (10) with the same value of . Therefore, the transition point with dynamical curiosity is the same as that with . This can be observed in Fig. b(a) and also in Fig. f for all networks, except for the USA road network [panel (e)].

7 Discussion and Final Remarks

The curiosity is an intrinsic feature that varies from person to person. The level of curiosity of people can be increased not only among the most curious subjects but also among the less curious individuals that are willing to adopt a new product or idea. More marketing campaigns are employing curiosity strategies to attract customers [27, 28]. For instance, the game Pokémon GO, the biggest mobile game in US history [28], introduces virtual reality and outdoor activities in public locations, which increase people’s curiosity. Another example is Philips RéAura, a skin rejuvenation brand where the customers can access an interactive site that shows diaries and trial results from real people [27]. The social platform for customer engagement and interaction promotes users’ curiosity about the truth behind the product claims. Stimulation of people’s curiosity can provide better results not only for the marketing area but also for education and political or health campaigns, among others. In general, people’s opinions are influenced by their close contacts, i. e., family and friends, and that are why they tend to spread these ideas more than those they receive from other sources outside of the circle of close relationships.

This work contributes to understanding how social curiosity can improve the potential diffusion of information on networks. We proposed an information spreading model based on the dynamics and introduced the social curiosity as a heterogeneous dynamical parameter that evolves over time. Depending on the fraction of informed neighbors, susceptible individuals become curious and interact with the neighborhood to satisfy the curiosity about the new idea or information. We found that the effect of the social curiosity on the propagation of the information depends on the effective spreading rate . For values of above and close to the healthy-endemic transition point , the curiosity is able to increase the propagation level in more than twice compared to the classical approach without curiosity. The maximum number of new spreaders reached during the propagation process and the speed of propagation are also increased by the curiosity. However, as becomes smaller or larger than , the social curiosity has no significant effect. These results suggest that the curiosity mechanism reaches its maximum effectiveness when the system is just above the transition point, in the endemic phase. Another important point is the structure of the network. We found that the curiosity has a larger impact on homogeneous and spatial networks than on on-line social and scale-free networks.

The proposed curiosity mechanism might be applicable to other fields like biological networks and animal social behavior models. Another important issue to be studied is the interplay between the curiosity influence –like location-base strategies, the impact of network structure and dynamical parameters, and the personality homophily for the adoption/diffusion of ideas and publicity. More suitable models can be developed adopting the social curiosity and analyzing geolocated phenomena like the Pokémon GO game.

Acknowledgments

This research employed the computing resources of the Center for Mathematical Sciences Applied to Industry (CeMEAI), financed by FAPESP. DAVO acknowledges CNPq (grant 140688/2013-7), FAPESP (grant 2016/23698-1) and the Banco Santander grant of RED Macro Universidades. LB acknowledges CAPES and FAPESP. FV acknowledges support from CONICET (Argentina). FAR acknowledges CNPq (grant 305940/2010-4) and FAPESP (grant 13/26416-9).

References

  1. N. Noë, R. M. Whitaker, and S. M. Allen, “Personality homophily and the local network characteristics of facebook,” in 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Aug 2016, pp. 386–393.
  2. M. E. Tabacchi, B. Caci, M. Cardaci, and V. Perticone, “Early usage of pokémon go and its personality correlates,” Computers in Human Behavior, vol. 72, pp. 163 – 169, 2017.
  3. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, pp. 509–512, 1999.
  4. M. Newman, Networks: an introduction.   Oxford Uni. Press, Inc., 2010.
  5. A. Guille, H. Hacid, C. Favre, and D. A. Zighed, “Information diffusion in online social networks: A survey,” ACM SIGMOD Record, vol. 42, no. 1, p. 17, 5 2013.
  6. R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, “Epidemic processes in complex networks,” Reviews of Modern Physics, vol. 87, no. 3, pp. 925–979, 8 2015.
  7. D. Kempe, J. Kleinberg, and v. Tardos, “Maximizing the Spread of Influence through a Social Network,” Theory of Computing, vol. 11, no. 4, pp. 105 – 147, 2015.
  8. M. A. Porter and J. P. Gleeson, Dynamical Systems on Networks: A Tutorial, 1st ed., ser. Frontiers in Applied Dynamical Systems: Reviews and Tutorials.   Springer, 2016.
  9. D. A. Vega-Oliveros, L. da F Costa, and F. A. Rodrigues, “Rumor propagation with heterogeneous transmission in social networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2017, no. 2, p. 023401, 2017.
  10. M. Zuckerman and P. Litle, “Personality and curiosity about morbid and sexual events,” Personality and Individual Differences, vol. 7, no. 1, pp. 49 – 56, 1986.
  11. J. A. Litman, “Curiosity and the pleasures of learning: Wanting and liking new information,” Cognition and Emotion, vol. 19, no. 6, pp. 793–814, 2005.
  12. Q. Wu and C. Miao, “Curiosity: From psychology to computation,” ACM Comput. Surv., vol. 46, no. 2, pp. 18:1–18:26, 2013.
  13. M. I. Nick Wingfield, “Pokemon go brings augmented reality to a mass audience,” July, 2016. [Online]. Available: http://www.nytimes.com
  14. H. Zhang, A. Kuhnle, H. Zhang, and M. T. Thai, “Detecting misinformation in online social networks before it is too late,” in 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Aug 2016, pp. 541–548.
  15. L. Zhao, Q. Wang, J. Cheng, Y. Chen, J. Wang, and W. Huang, “Rumor spreading model with consideration of forgetting mechanism: A case of online blogging LiveJournal,” Physica A: Statistical Mechanics and its Applications, vol. 390, no. 13, pp. 2619–2625, 2011.
  16. M. Nekovee, Y. Moreno, G. Bianconi, and M. Marsili, “Theory of rumour spreading in complex social networks,” Physica A: Statistical Mechanics and its Applications, vol. 374, no. 1, pp. 457–470, 1 2007.
  17. D. Vega-Oliveros, L. Berton, A. Lopes, and F. Rodrigues, “Influence maximization based on the least influential spreaders,” in SocInf 2015, co-located with IJCAI 2015, vol. 1398, 2015, pp. 3–8.
  18. H. W. Hethcote, “The Mathematics of Infectious Diseases,” SlAM REVIEW, 8 2006.
  19. C. Buono, F. Vazquez, P. A. Macri, and L. A. Braunstein, “Slow epidemic extinction in populations with heterogeneous infection rates,” Physical Review E, vol. 88, no. 2, p. 022813, 2013.
  20. D. A. Vega-Oliveros, L. d. F. Costa, and F. A. Rodrigues, “Influence maximization on correlated networks through community identification,” may 2017. [Online]. Available: http://arxiv.org/abs/1705.00630
  21. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, “On the evolution of user interaction in Facebook,” in Proc. Workshop on Online Social Networks, 2009, pp. 37–42.
  22. D. Vega-Oliveros and L. Berton, “Spreader selection by community to maximize information diffusion in social networks,” in SIMBig 2015, 2015, pp. 73–82.
  23. A. Erdos P.; Rényi, “On random graphs,” Publicationes Mathematicae, vol. 6, no. 1, pp. 290–297, 1959.
  24. M. Barthélemy, “Crossover from scale-free to spatial networks,” Europhysics Letters (EPL), vol. 63, no. 6, pp. 915–921, 2003.
  25. J. McAuley and J. Leskovec, “Learning to discover social circles in ego networks,” in Advances in Neural Information Processing Systems, 2012, pp. 548–556.
  26. A. L. Barbieri, G. de Arruda, F. A. Rodrigues, O. M. Bruno, and L. da Fontoura Costa, “An entropy-based approach to automatic image segmentation of satellite images,” Physica A: Statistical Mechanics and its Applications, vol. 390, no. 3, pp. 512 – 518, 2011.
  27. G. Wheeler. (2013) Marketing’s new mission: Creating a customer curiosity strategy. [Online]. Available: http://www.mycustomer.com
  28. TEDxZurich. (2017) Pokémon go is now the biggest mobile game in u.s. history. [Online]. Available: http://tedxzurich.com
248276
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
Edit
-  
Unpublish
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel
Comments 0
Request comment
""
The feedback must be of minumum 40 characters
Add comment
Cancel
Loading ...

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description