## Abstract

Information spreading in complex networks is often modeled as diffusing information with certain probability from nodes that possess it to their neighbors that do not. Information cascades are triggered when the activation of a set of initial nodes – seeds – results in diffusion to large number of nodes. Here, several novel approaches for seed initiation that replace the commonly used activation of all seeds at once with a sequence of initiation stages are introduced. Sequential strategies at later stages avoid seeding highly ranked nodes that are already activated by diffusion active between stages. The gain arises when a saved seed is allocated to a node difficult to reach via diffusion. Sequential seeding and a single stage approach are compared using various seed ranking methods and diffusion parameters on real complex networks. The experimental results indicate that, regardless of the seed ranking method used, sequential seeding strategies deliver better coverage than single stage seeding in about 90% of cases. Longer seeding sequences tend to activate more nodes but they also extend the duration of diffusion. Various variants of sequential seeding resolve the trade-off between the coverage and speed of diffusion differently.

## Introduction

The process of making the complex decisions is difficult, so it is often worth making partial decisions and to track their consequences before proceeding further. Such strategy was proven useful in areas such as: general theory of decision making^{1, 2}, financial markets^{3, 4}, epidemiology^{5} and marketing^{6}. Here, we show that sequential, consecutive approach is also highly efficient in choosing the individuals, called seeds, that when activated will widely spread information or opinion in a social network. The current research on influence maximization and information spread in complex networks focuses mainly on single stage seed initiation. An exception is new product adaptation with early diffusion of product samples^{7, 8} to benefit from consumer responses and product spread. The main challenge is finding a method for selection of seeds to maximize the final spread of information within the network. If the total number of seeds to be used is limited, e.g. due to restricted budget, a typical approach is to rank all nodes in the network according to some criteria, select top *n* nodes as seeds and activate them at once to initiate the diffusion.

Influence maximization problem in complex networks was defined by Kempe^{9}. Analyses of various factors affecting the diffusion and social influence in complex networks include the efficiency of using different centrality measures for ranking influencers for selection^{10}, impact of homophily for successful seeding^{11}, and heterogeneous thresholds on congestion^{12}, finding the critical initiator fraction beyond which the cascade becomes global^{13} or importance of different network features in predicting spread^{14}. Selection of initial seeds was also analyzed, including incentives for innovators to start diffusion^{15} and the multi-market entry perspective^{16}. While most of research is related to marketing, the problem has been generalized to ranking nodes for target set selection in the domain of combinatorial optimization of theoretical computer science^{17,18,19}. The influence maximization problem is also explored in physics from the perspective of diffusion in complex networks^{20}. Other studies discuss the role of communities^{21} and propose the influence maximization through optimal percolation^{22}. Some initial research has been carried out to identify efficient seeds to initiate spread in temporal^{23, 24} and multilayer social networks^{25}. Several comparative studies discuss seeding strategies^{26} and marketing word of mouth programs^{27}.

Typically, seeding strategies applied in viral marketing, social campaigns, political campaigns, diffusion of information, etc. are based on the assumption that selected seeds are initiated at once, and then the diffusion continues without any additional support^{26}. Resent research takes into account adaptive approaches with two-stage stochastic model exploring the potential of neighboring nodes^{28}, further extended towards more scalable approach^{29}. Other preliminary studies were performed to demonstrate the potential of using seeds after the first stage^{30, 31}. The potential of multi-period spraying algorithm for routing in delay-tolerant networks was also discussed^{32}. Some authors noticed the benefit of not initiating a node that is likely to be activated by other seeds. Hence, they proposed structural heuristics for static seed ranking that avoid choosing as a new seed (1) a node that is a neighbor of or close to the already chosen seed^{33, 34}, or (2) a node that is in a local cluster already containing another seed^{21, 35, 36}.

Here, we introduce sequential seeding for influence maximization in complex networks and compare it to classical single stage approach. In our approach seeds are divided into several packages, and seeds from each package start either in fixed intervals or when diffusion stops for the previous package. We verify the performance of the proposed approach for different parameters related to network structure and characteristics of diffusion. Our results show that deploying the same number of seeds in stages as in at once approach yields larger spread, than achieved in a single stage seeding thanks to use of diffusion between stages. This improvement is however offset by the longer time needed to finish diffusion and to reach the maximal coverage. The best sequential seeding strategy depends on the relative importance of the spread coverage and the time available for spread execution.

A typical single seeding approach starts with ranking all nodes according to some structural features ranging from a simple degree ranking^{26} to more advanced solutions^{21, 33,34,35}. Actual seed selection commences with initiating all *n* top ranking nodes at once at the beginning of campaign. In contrast, sequential seeding utilizes the same ranking as the corresponding single stage method but initiates nodes that are top ranked and *not yet initiated* in stages. Between those stages, the diffusion proceeds from initiated nodes. Thus, any top ranking nodes initiated by such diffusion is not used as seeds and in its place other high ranked but uninitiated node is chosen to be activated.

The diffusion model that is used here is stochastic. Even for a single stage seeding, when the same set of seeds is initiated in repeated executions, the coverage will vary as each activated node will attempt to activate its neighbor with certain probability, but no certainty. Still, we found a broad conditions under which there exists a sequential seeding using the same node ranking method but achieving the higher average coverage than the single stage seeding does. This condition is that there is a seed in the single stage seeding that is reachable from other seeds with non-zero probability. Indeed, by initiating all seeds except such reachable seed in the first stage, we can observe the following. For all execution cases in which uninitiated seed is not activated by diffusion after the first stage, the average coverage over such cases will be the same for both methods. However, in all other execution cases (guaranteed to exist since the node is reachable with non-zero probability from other seeds), the single stage seeding will have average coverage equal to the coverage of the first stage of the sequential seeding. However, in the second stage, the latter will initiate a new node in place of the already active reachable seed (and perhaps more nodes in the subsequent diffusion), making the overall average coverage of the sequential seeding larger than the single stage one.

## Results

Sequential seeding strategies are considered here for an independent cascade model representing stochastic diffusion of information over the network initiated by seeds^{9}. A basic, commonly used, single stage (*SN*) seeding consists of only one stage with *n* seeds. A seeding stage starts with activation of all *n* seeds at the beginning to initiate diffusion and lasts until diffusion stops. According to the definition of independent cascade model each diffusion step consists of a single attempt performed by each node activated in the previous step to activate this node direct non-active neighbors with a given propagation probability. Due to the fact that we measure diffusion time in the number of steps, we assume that each such step takes a unit time to execute regardless of the network size. It means that time corresponds directly to the number of diffusion steps. Let *T*
_{
SN
} denote the number of diffusion steps of single stage seeding. All seeding methods considered here use the same fixed number of *n* seeds. Five sequential seeding methods are introduced here as presented in Table 1; see the *Methods* section for more details. In the single stage method, the *n* seeds are utilized at once at the beginning, whereas new sequential approaches deploy them in a sequence of multiple consecutive stages. In general, there are two types of proposed sequential seeding. The first type uses constant seeding stage time and includes an approach denoted as SQ_kPS with *k* seeds initiated in each seeding stage. The other approach of this type denoted SQ_TSN, uses the number of stages defined by the seeding time of single stage approach. The second type uses revival mode, in which the stage ends when the diffusion finishes and the next seeding stage starts immediately thereafter. This type includes approaches denoted as SQ_kPS_R, SQ_TSN_R and the revival mode with buffering denoted as SQ_kPS_B.

To summarize, the execution of SQ_kPS strategy (other strategies differ slightly as indicated in Table 1) of the sequential seeding in a real world scenario, is done in the following steps: (i) create a seed ranking for the network using the preferred node ranking method, e.g. degree-based, PageRank-based, VoteRank, etc.; (ii) select top *k* nodes from the ranking as the first *k* seeds; (iii) observe the spreading process and when it stops, restart it by selecting for seeding the next *k* not yet activated nodes according to the ranking used (iv) repeat step (iii) until the desired number of seeds is allocated.

The example of one seed per stage sequential seeding (SQ_1PS) in the relation to single stage seeding (SN) with the same diffusion parameters is shown in Fig. 1(A). The use of a single seed in each step of simulation instead of using all seeds at the beginning results in the increased coverage *C*
_{
SQ_kPS
}, when compared to single stage coverage *C*
_{
SN
}. Time – more precisely the number of diffusion steps – when the maximal coverage is reached, denoted as *T*
_{
SQ_1PS
} is also typically longer than the reference time for the single stage *T*
_{
SN
}. Time *T*
_{
SQ_1PS,SN
} denotes the number of steps when SQ_1PS process reaches the maximal coverage *C*
_{
SN
} from single stage process.

The second approach (SQ_TSN) is illustrated in Fig. 1(B), uses shorter sequence with the total number of stages equal to the number of steps needed to reach maximal coverage *C*
_{
SN
} in the single stage seeding (SN). The number of seeds *s* used in each step is equal to the total number of available seeds *n* divided by the number of steps *T*
_{
SN
} in the corresponding single stage process. An extension, based on the revival mode presented in Fig. 1(C), uses additional seeds once the diffusion dies out and needs to be reseeded. The revival mode may also be extended with buffering: the number of seeds designated for initiation but not used because of their initiation in earlier diffusion steps is cumulatively stored in the buffer and the equivalent number of new not activated by diffusion nodes are initiated as seeds when the current stage diffusion terminates.

Sequential seeding uses dynamic selection and any node ranking method including simple heuristics or their extensions can be applied. To show the advantages of sequential seeding over single stage approach, we use for both the same nodes ranking, and compare their performance for the following five rankings: random selection (R), degree (D), second level degree (D2) — it takes into account node degree and the degrees of its neighbors, Page Rank (PR) and eigenvector (EV). In each seeding stage, only nodes that have been not activated yet are selected in the order of their initial ranking as seeds, making the sequential seeding set often different from the set used by the single stage approach. Rankings of nodes may be computed at the beginning of the process based on the structural measures within the initial network.

The results achieved with the sequential seeding strategies are compared, Table 2, with the single stage seeding (SN) for 1,875 versatile configurations. For each of the 15 networks, we use the same diffusion parameters (five propagation probabilities), the total number of seeds (five values of SP) and five node rankings. The simulation outcomes from all sequential strategies compared with single stage approach manifests the improvement in 89.8% configurations, with the largest benefit, in terms of better coverage, of 10.1% on average but exceeding 50% in some cases. Simultaneously, sequential methods increase the diffusion duration by 5.2 times on average. It is worth noticing that the average coverage achieved with sequential seeding SQ_1PS_R applied to any seed ranking method is greater than the average coverage provided by the single seeding based on the same ranking. We observed two main factors affecting the performance of sequential seeding. The first is the extent to which sequential seeding avoids selecting nodes that would be activated through diffusion. The gain arises when a top ranked but already activated node is removed from selection and in its place another not yet activated node becomes a seed, Fig. 3(B), stages IV–VI. It is most likely to happen in happen in the revival mode, which maximally delays the next seeding stage until diffusion stops in the current stage.

The performance improvement depends also on selecting new seeds that have high potential of activating their neighbors in place of those seeds that were already activated by diffusion. The gain from sequential approach is commonly greater for configurations with low overall coverage, i.e. low propagation probability, see Fig. 2(D2), networks N1, N4, N5, N7 described in Supplementary Information, Fig. 2(D4) as well as for large seed sets, see Fig. 2(D3).

Distributing the seeds over time makes it possible to take advantage of the progress the diffusion made before new seeds are selected. It is important especially when the budget, i.e. the number of initial seeds, is fixed. In such a case under single seeding approach the entire budget of seed is consumed at the outset and recovery is not possible if diffusion stops without reaching the desired coverage. Gradual spending allows to fund a campaign for a longer time period and to reach more customers.

The resolution of trade-off between the final coverage and speed of diffusion depends on individual preferences for the importance of both coverage and the process duration in specific applications. Better coverage can be achieved by sequential approach, but it takes more time to finish or even to reach the same coverage as for single stage seeding. The more stages the sequential seeding process has, the more nodes might be activated, but the longer diffusion lasts. If the process is optimized for time, the length of sequence should be short. For example during the elections, time is fixed and all possible efforts should be taken to acquire as many voters as possible by the voting date. With high speed epidemics, vaccination should be applied quickly to protect as many people as possible. In critical situations, when initial actions are not sufficient, additional resources can be engaged and additional seeds activated.

An experimental setup runs agent-based simulations on 15 static real networks N1-N15, containing from 899 to 16,726 nodes and from 2,742 to 147,547 edges, see Supplementary Information for details.

The independent cascades model (IC)^{9} was used with propagation probability *PP*(*a*, *b*) that node *a* activates (influences or infects) node *b* in the step *t* + 1 under condition that node *a* was activated at time *t*
^{37}. The main reason for selecting this model was a relatively small number of seeds needed in each stage for the optimal decomposition of initial set of seeds. With this model even a single seed can induce diffusion, while in linear threshold model^{9} (LT) a small seeds packages would often have no effect. Parameters used in simulations characterizing diffusion, networks and strategies are presented in Table 2.

Simulation parameters create an experimental space N × PP × SP × S, resulting in 1,875 configurations. Each configuration was independently applied for each seeding strategy from Table 1 and the results were averaged over 100 runs for each case. The agent based model was used, with agents connected according to the networks specifications. Each step of simulation includes the selection of additional seeds (if additional seeding is allowed), visiting all nodes activated in the previous step and newly selected seeds, and finally activating their neighbors according to the propagation probability (PP). Within the experimental space sequential seeding algorithms were tested including constant seeding stage time and revival mode, see Table 1.

The simulation results achieved in sequential seeding were compared with the single stage seeding (SN) on the same network (N) and with the same parameters including propagation probability (PP), seeding percentage (SP) and node ranking strategy (S). Reference values for comparison were based on the coverage achieved in the single stage seeding *C*
_{
SN
} with the duration representing the number of steps in the single stage process *T*
_{
SN
} when the coverage *C*
_{
SN
} is achieved, see Fig. 1 and the *Methods* section.

During experiments several variants of sequential seeding approach were verified including k seeds per stage with *k* equal to 1, 2, 4 and 8 with both revival (SQ_kPS_R) and non-revival mode (SQ_kPS). For *k* = 1 buffered approach was used (SQ_1PS_B). Reference based strategy was verified with revival (SQ_TSN_R) and non-revival mode (SQ_TSN). Finally 11 variants of sequential strategies were used.

The best results in terms of coverage were delivered by the sequential strategy with *k* = 1 seed used per stage with revival mode (SQ_1PS_R) but they required the largest number of steps to finish. The opposite results with the shortest duration and the lowest coverage were achieved by the sequential approach with reference time from single stage (SQ_TSN), see Fig. 5(D) for the results from both strategies.

The SQ_1PS_R method achieved the highest decomposition of the seeding and the highest usage of single seeds which resulted in the highest coverage, but it also have diffusion taking the longest time to finish. For SQ_TSN, the number of seeding stages and the coverage ware usually low. Both strategies were compared with the coverage of single stage strategy (SN) achieved for the same simulation parameters, Fig. 2(A). The results from 1,875 configurations for both strategies are ordered by coverage obtained in the single stage method represented by red line. For the parameters with relatively low coverage, below 5%, results for the first 250 cases for all strategies are quite similar since the differences are small, while with growing coverage the differences are much more visible. Sequential seeding is almost always better than its single stage equivalent with the same parameters. The global results for all networks, strategies and parameters show better results than SN in 95.3% of simulation cases delivered by SQ_1PS_R. The gain was also observed in 85.49% cases for SQ_TSN. Figure 2(B) illustrates coverage performance of sequential seeding strategies, SQ_1PS_R and SQ_TSN represented as a ratio of coverage obtained by these two methods to the one achieved the single stage (SN). The length of sequence positively affects the total results. In 1,697 cases from 1,875 (90.5%), one seed per stage method (SQ_1PS_R) outperformed seeding with shorter sequences (SQ_TSN). The example comparison of simulation results between SQ_TSN, SQ_1PS_R and single stage seeding is presented in Fig. 2(C). Sequential strategies outperform the single stage approach even though they need more time (steps) to achieve that.

The results from simulations demonstrate that the improvement can even exceed 50% with the use of the same number of seeds as in the single stage seeding. The coverage of diffusion in SQ_1PS_R is on average 13.1% better than when using SN approach with the same parameters. The SQ_TSN increased the coverage, on average by 7.15%, comparing to the single stage seeding.

The performance of proposed methods is dependent on parameters of diffusion and network characteristics. The results are also dependent on seed ranking strategy used. For example, the coverage gain and its distance from the results of the single stage seeding for both SQ_1PS_R and SQ_TSN was the highest for degree based ranking and the lowest for random node ranking as seen Fig. 2(D1). The overall coverage level depends only little on strategy or seed percentage and it is much more impacted by propagation probability and network profile. Experiments were carried out on a wide range of networks and parameters, including cases with very low performance/coverage, e.g. the propagation probability PP = 0.05 or seeding percentage SP = 1%.

For such parameters, it is very difficult to trigger a cascade regardless of seeding strategy used. The highest improvement was observed for the lowest propagation probability PP = 0.05 at 13% for SQ_1PS_R compared to single stage seeding with SQ_TSN delivering 8% improvement. With the highest propagation probability PP = 0.25 the improvement decreases to 7% and 4% for both strategies respectively, see Fig. 2(D2). In configurations with high propagation probability, diffusion reaches high coverage in a very short time, regardless of what seeding strategy is used - there is almost no space for any improvement. In terms of seeding percentage (SP) performance of sequential seeding grows together with the number of seeds selected. The lowest seeding percentage SP = 1% delivered 4% and 2% improvement while for the SP = 5% the improvement increases to 12% and 8% respectively, Fig. 2(D3). In general, the obtained results were strongly dependent on the network profile with the overall coverage and performance of sequential seeding illustrated in Fig. 2(D3) and in Fig. 5(A).

One of the reasons for a generally good coverage performance of sequential methods, is related to identifying new seeds with the highest potential to activate other nodes. Sequential seeding efficiently utilizes the potential of diffusion, but spreading seeds over time increases the diffusion duration, see Fig. 2(C). The greatest coverage can be achieved by means of one per stage strategy with revival SQ_1PS_R, but it results in the longest duration since every single seed waits until diffusion started by the previous seed terminates. On the other hand, the coverage performance of the SQ_TSN strategy is lower, but it takes less time to reach the coverage greater than in the single stage approach, Fig. 2(C).

The final decision which strategy to use depends on how the trade-off between time and coverage is resolved. If the process is restricted in time, the seeding sequence length should be shorter. For SQ_TSN, the diffusion is on average only 1.4 times longer than for the single stage approach SN whereas the duration of the longest sequences based on SQ_1PS_R is on average 11.9 times longer.

Gain in coverage (positive coverage ratio) and loss in time (positive time ratio) for both sequential strategies seen in Fig. 2(E) presents a trade-off between acceptable extended time and desired increased coverage for two sequential methods SQ_1PS_R and SQ_TSN shown in Fig. 2(E). It can be seen that SQ_1PS_R provides greater variety of possible solutions and much greater gain in coverage, at the cost of the substantial expense of speed.

While the results from two opposite approaches SQ_1PS_R and SQ_TSN are presented in this section, their extensions based on revival mode and buffering are described in the *Discussion* section. The SQ_kPS strategy and usage of *k* parameter other than one (2, 4, 8) makes it possible to accordingly adjust both duration and the coverage.

In addition to the typical benchmark seed ranking strategies presented above, we have also analyzed the more recent ones like VoteRank^{34} or community structure based method^{21}. The results are similar as for typical ranking methods. For example, sequential degree and sequential VoteRank outperform single stage VoteRank in 84.9% and 89.6% cases, respectively. Sequential degree based rankings delivered better results than single stage community structure based selection in 93.33% of simulation configurations. In 66.67% of configurations sequential community structure based selection delivered better results than single stage community approach. Please see Supplementary Information for details.

## Methods

The common approach for seeding in complex networks uses a single stage seeding (SN), Fig. 3(A). In the first stage, all *n* initial seeds are selected using a given node ranking. In the next and last stage, diffusion starts, and then continues without any additional support until it stops at certain time to which we refer as saturation time *T*
_{
SN
}, achieving coverage *C*
_{
SN
}. An sample network with 30 nodes was generated using Barabási-Albert model. At the beginning, *n* = 6 nodes with the highest degrees, representing 20% of all nodes, are selected as seeds. Then diffusion is simulated using the Independent Cascades model with propagation probability P = 0.5, see Fig. 3(AI,II).

In the sequential seeding approach, introduced here, the seeds are split among several seeding stages interspersed with diffusion stages so each seeding stage is followed by diffusion stage. The selection of seeds in each stage is based on inactive node ranks. The first sequential method — one seed per stage (SQ_1PS) utilizes the highest distribution of seeds assigning a single seed to each seeding stage. The number of stages equals the number of seeds - *n*. To illustrate this process the same network with the same number of seeds as for SN is used in Fig. 3(B). The seeding consists of six stages with one seed per stage. In each stage, a new seed with the highest degree is selected from not activated yet nodes. It means that the already activated nodes are not considered for selection, even if they possess the high rank. This allows avoiding to seed nodes that would be activated anyway by diffusion.

The diffusion with sequential seeding (SQ_1PS) reaches 24 nodes, while the single stage seeding (SN) activates just 18. All those nodes, except node 11 that have been activated by the SN method, were also activated by sequential strategy which in addition activated seven more nodes. However, since diffusion is simulated using the probabilistic Independent Cascades model, the outcome of sequential seeding strategy might be different, or even worse, than the final result of single stage seeding strategy. Nevertheless, as proved by experimental results, the sequential seeding strategy outperforms the single stage method in over 90% of cases.

The higher coverage and the longer duration compared to single stage SN shown in Fig. 4(A) is illustrated for the *k* per stage sequential seeding process SQ_1PS in Fig. 4(B). The questions arise what is the increased coverage *C*
_{
OPS
} how much it is greater than *C*
_{
SN
} and how much longer is the time *T*
_{
OPS
} to achieve this coverage greater than *T*
_{
SN
}. Additionally, we can assess the lower speed of the SQ_1PS process by measuring the time *T*
_{
OPS,SN
} when the maximal coverage *C*
_{
SN
} from the SN process is reached. Commonly, *T*
_{
OPS,SN
} > *T*
_{
SN
}. Another sign of lower speed is that the coverage *C*
_{
SN,1PS
} of the SQ_kPS process is achieved in time *T*
_{
SN
} and typically, *C*
_{
SN,kPS
} < *C*
_{
SN
}.

While the sequences with the SQ_1PS are relatively long, the second proposed approach is based on the reference time *T*
_{
SN
} from the single stage seeding applied to sequential approach as SQ_TSN, Fig. 4(C). The number of seeds used in each step is equal to the number of seeds *s* used in single stage seeding divided by the number of steps *T*
_{
SN
} needed to reach the saturation point in SN. The sequence of seeding starts at the first stage and finishes at ${T}_{SN}^{th}$ stage. The coverage *C*
_{
TSN,SN
} of the SQ_TSN process at the time *T*
_{
SN
} can be compared with *C*
_{
SN
}. The slower speed of the SQ_TSN means that *C*
_{
TSN,SN
} < *C*
_{
SN
}. However, *C*
_{
TSN,SN
} > *C*
_{
OPS,SN
}, i.e. SQ_TSN is faster than SQ_kPS. It can be observed that *T*
_{
OPS,SN
} > *T*
_{
TSN,SN
} > *T*
_{
SN
}. On the other hand, regarding the total coverages, we have: *C*
_{
OPS
} > *C*
_{
TSN
} > *C*
_{
SN
}. Overall, the greater coverage is, the lower speed is.

Sequential seeding with revival and buffering modes. SQ_kPS and SQ_TSN are able to improve coverage thanks to the allocation of additional seeds, even if diffusion is still ongoing. To utilize the acquired knowledge about process dynamics, the sequential strategy with revival mode is proposed and applied to modify sequential strategies with constant seeding stage time: SQ_kPS_R and SQ_TSN_R. In both cases, an additional seeding is suspended until the most recent diffusion stops, i.e., the increase of coverage in two following steps ΔC is zero, see Fig. 4(D,E). It means that the proposed approaches extend the execution time of individual seeding stages and the total process duration. Only one seed per stage is used in SQ_kPS_R and similarly to SQ_TSN, the allocated package of |*s*| = *n*/*T*
_{
SN
} seeds is used in SQ_TSN_R. According to the nature of the independent cascades model, each recently activated node has only one chance to infect its neighbors. Hence, if the process stops, such a node would never be re-activated in the future stages. The only way to restart diffusion is by initiating additional seed (SQ_kPS_R) or seeds (SQ_TSN_R). This can improve the final diffusion coverage, but at the price of spread increased duration.

Yet another proposed approach SQ_kPS_B is based on one seed per stage method and accumulates in a buffer the number of seeds unused because they were initiated by diffusion. The equal number of inactive nodes is initiated after diffusion terminates and requires recovery. The main goal of SQ_kPS_B is to limit the process duration and make it equal to SQ_kPS, duration, simultaneously using the potential of diffusion, Fig. 4(F). If we compare SQ_kPS_B with SQ_kPS, the diffusion time of both is similar but the coverage for the buffering mode – SQ_kPS_B is commonly greater because of the better exploitation of diffusion.

## Discussion

Sequential seeding with one seed per stage SQ_1PS outperforms coverage of the single stage seeding SN in over 85% of configurations, providing on average nearly 9% better coverage but its duration was over 7 times longer, Table 3.

The revival mode applied to single seed per stage (SQ_1PS_R) achieves the best coverage among all sequential methods - better by over 13% on average with gained observed for more than 95% of configurations but lasts the longest (over 10 times longer than SN). In general, the revival mode applied to any *k* per stage methods (SQ_kPS) outperforms single stage approach in 10% more configurations with 43–59% increase of coverage gain compared to their non-revival version, see also Fig. 5(B). The similar improvement is observed for application of revival mode to SQ_TSN, Fig. 5(B2). The revival mode provides greater coverage than its reference version since it makes better use of interstage diffusion. On the other hand, the revival mode significantly extends the process duration: by 60% to 130%.

The buffered mode SQ_1PS_B gains little compared to the regular one per stage method SQ_1PS at the small expense of time so it provides limited SQ_1PS improvement, much weaker than provided by the revival mode, Fig. 5(B1).

The experiments include some configurations with very low final coverage, which result from low propagation probability PP = 0.05 combined with low seeding percentage SP = 1%. It means that the total number of activations will always be low, no matter what strategy is used. For example, for a small network N10 with SP = 1% only 9 seeds are activated, so it is very difficult to induce any diffusion with PP = 0.05. An opposite case arises for networks with very high node degrees and relatively high propagation probability, i.e. PP = 0.25 and SP = 5%, where all strategies perform very well resulting in a high number of activated nodes in a very short time. Taking into account the above conditions, an increase by 13% on average for SQ_1PS_R can be considered substantial.

Among all sequential strategies SQ_TSN is the fastest – it increases duration in reference to SN by only 1.4 times, but its coverage gain is relatively little: 7%. Hence, two strategies: SQ_1PS_R and SQ_TSN can be treated as upper and lower sequential boundaries, respectively, both for coverage and time, Fig. 5(D). The space between them may be explored by using different values of seeds per stage *k* either with or without revival: SQ_kPS_R or SQ_kPS for *k* = 2, 4, 8, *etc*.

Overall, the experimental results reveal that the proper seeding strategy is a trade-off between time and coverage, which can be resolved according to the user needs by choosing appropriate sequential seeding strategy. Figure 5 and Table 3 provide details on performance of the introduced sequential seeding strategies in terms of trade-off values. The greatest coverage can be achieved by means of longer sequences resulting in longer execution. If the process is limited in time that is very short, the sequential strategies may be less justified.

Here we showed both experimentally and theoretically that the average coverage of any strategy of ranking nodes for selection of all seeds at the beginning of the process can be improved with sequential seeding using the same ranking. This is because the proposed method is dynamic as it adapts the set of activated seeds to the progress of the execution of diffusion active between stages of seeding.

## Additional information

**Publisher's note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

- 1.
Wald, A.

*Sequential Analysis*, 1st edn. (John Wiley and Sons, 1947). - 2.
Siegmund, D.

*Sequential analysis*:*tests and confidence intervals*. Springer series in statistics (Springer-Verlag, New York, 1985). - 3.
Cyert, R. M., DeGroot, M. H. & Holt, C. A. Sequential investment decisions with bayesian learning.

*Management Science***24**, 712–718, doi:10.1287/mnsc.24.7.712 (1978). - 4.
Prastacos, G. P. Optimal sequential investment decisions under conditions of uncertainty.

*Management Science***29**, 118–134 (1983). - 5.
Price, W. H. Sequential immunization as a vaccination procedure against dengue viruses.

*American Journal of Epidemiology***88**, 392–397 (1968). - 6.
Elberse, A. & Eliashberg, J. Demand and supply dynamics for sequentially released products in international markets: The case of motion pictures.

*Marketing Science***22**, 329–354 (2003). - 7.
Bass, F. M. A new product growth for model consumer durables.

*Management Science***15**, 215–227 (1969). - 8.
Rogers, E. M.

*Diffusion of innovations*, 5th edn. (Free Press, 2003). - 9.
Kempe, D., Kleinberg, J. & Tardos, É. Maximizing the spread of influence through a social network. In

*Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining*, 137–146 (ACM, 2003). - 10.
Kiss, C. & Bichler, M. Identification of influencers - measuring influence in customer networks.

*Decis. Support Syst.***46**, 233–253 (2008). - 11.
Nejad, M. G., Amini, M. & Babakus, E. Success factors in product seeding: The role of homophily.

*Journal of Retailing***91**, 68–88 (2015). - 12.
Karampourniotis, P. D., Sreenivasan, S., Szymanski, B. K. & Korniss, G. The impact of heterogeneous thresholds on social contagion with multiple initiators.

*PloS one***10**, e0143020 (2015). - 13.
Singh, P., Sreenivasan, S., Szymanski, B. K. & Korniss, G. Threshold-limited spreading in social networks with multiple initiators.

*Scientific reports***3**(2013). - 14.
Liu-Thompkins, Y. Seeding viral content.

*Journal of Advertising Research***52**, 465–478 (2012). - 15.
Lehmann, D. & Esteban-Bravo, M. When giving some away makes sense to jump-start the diffusion process.

*Marketing Letters***17**, 243–254 (2006). - 16.
Libai, B., Muller, E. & Peres, R. The role of seeding in multi-market entry.

*International Journal of Research in Marketing***22**, 375–393 (2005). - 17.
Ackerman, E., Ben-Zwi, O. & Wolfovitz, G. Combinatorial model and bounds for target set selection.

*Theoretical Computer Science***411**, 4017–4022 (2010). - 18.
Ben-Zwi, O., Hermelin, D., Lokshtanov, D. & Newman, I. Treewidth governs the complexity of target set selection.

*Discret. Optim.***8**, 87–96 (2011). - 19.
Chiang, C.-Y., Huang, L.-H., Li, B.-J., Wu, J. & Yeh, H.-G. Some results on the target set selection problem.

*Journal of Combinatorial Optimization***25**, 702–715 (2013). - 20.
Galstyan, A., Musoyan, V. & Cohen, P. Maximizing influence propagation in networks with community structure.

*Phys. Rev. E***79**, 056102 (2009). - 21.
He, J.-L., Fu, Y. & Chen, D.-B. A novel top-k strategy for influence maximization in complex networks with community structure.

*PloS one***10**, e0145283 (2015). - 22.
Morone, F. & Makse, H. A. Influence maximization in complex networks through optimal percolation.

*Nature***524**, 65–68 (2015). - 23.
Michalski, R., Kajdanowicz, T., Bródka, P. & Kazienko, P. Seed selection for spread of influence in social networks: Temporal vs. static approach.

*New Generation Computing***32**, 213–235 (2014). - 24.
Jankowski, J., Michalski, R. & Kazienko, P. Compensatory seeding in networks with varying availability of nodes. In

*Advances in Social Networks Analysis and Mining*(*ASONAM*),*2013 IEEE*/*ACM International Conference on*, 1242–1249 (IEEE, 2013). - 25.
Michalski, R., Kazienko, P. & Jankowski, J. Convince a dozen more and succeed–the influence in multi-layered social networks. In

*Signal*-*Image Technology & Internet*-*Based Systems*(*SITIS*),*2013 International Conference on*, 499–505 (IEEE, 2013). - 26.
Hinz, O., Skiera, B., Barrot, C. & Becker, J. U. Seeding strategies for viral marketing: An empirical comparison.

*Journal of Marketing***75**, 55–71 (2011). - 27.
Libai, B., Muller, E. & Peres, R. Decomposing the value of word-of-mouth seeding programs: Acceleration versus expansion.

*Journal of Marketing Research***50**, 161–176 (2013). - 28.
Seeman, L. & Singer, Y. Adaptive seeding in social networks. In

*Foundations of Computer Science*(*FOCS*),*2013 IEEE 54th Annual Symposium on*, 459–468 (IEEE, 2013). - 29.
Horel, T. & Singer, Y. Scalable methods for adaptively seeding a social network. In

*Proceedings of the 24th International Conference on World Wide Web*, 441–451 (International World Wide Web Conferences Steering Committee, 2015). - 30.
Sela, A., Ben-Gal, I., Pentland, A. & Shmueli, E. Improving information spread through a scheduled seeding approach. In

*The international conference on Advances in Social Network Analysis and Mining 2015*(2015). - 31.
Zhang, H., Procaccia, A. D. & Vorobeychik, Y. Dynamic influence maximization under increasing returns to scale. In

*Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems*, 949–957 (International Foundation for Autonomous Agents and Multiagent Systems, 2015). - 32.
Bulut, E., Wang, Z. & Szymanski, B. Cost-effective multiperiod spraying for routing in delay-tolerant networks.

*Networking, IEEE/ACM Transactions on***18**, 1530–1543 (2010). - 33.
Kitsak, M.

*et al*. Identification of influential spreaders in complex networks.*Nat. Phys.***6**, 888–893 (2010). - 34.
Zhang, J. X., Chen, D. B., Dong, Q., Zhao, Z. D. & Wang, Y. Identifying a set of influential spreaders in complex networks.

*Sci. Rep.***6**, 27823 (2016). - 35.
Zhao, X. Y., Huang, B., Tang, M., Zhang, H. F. & Chen, D. B. Identifying effective multiple spreaders by coloring complex networks.

*Europhys. Lett.***108**, 68005 (2014). - 36.
Zhang, X., Zhu, J., Wang, Q. & Zhao, H. Identifying influential nodes in complex networks with community structure.

*Knowledge-Based Systems***42**, 74–84 (2013). - 37.
Wang, C., Chen, W. & Wang, Y. Scalable influence maximization for independent cascade model in large-scale social networks.

*Data Mining and Knowledge Discovery***25**, 545–576 (2012).

## Acknowledgements

This work was partially supported by Wrocław University of Science and Technology statutory funds; the Polish National Science Centre, decisions no. 2013/09/B/ST6/02317, 2015/17/D/ST6/04046, 2016/21/D/ST6/02408 and 2016/21/B/HS4/01562; the European Commission under the 7th Framework Programme, Coordination and Support Action, grant agreement No. 316097 (ENGINE); European Union’s Horizon 2020 research and innovation programme under the MarieSkłodowska-Curie grant agreement No. 691152 (RENOIR); the Polish Ministry of Science and Higher Education fund for supporting internationally co-financed projects in 2013-2016 (agreement no. 2820/7.PR/2013/2) and 2016-2019 (agreement no. 3628/H2020/2016/2); the Army Research Laboratory under Cooperative Agreement Number W911NF-09-2-0053 (the ARL Network Science CTA); and the Office of Naval Research Grant No. N00014-09-1-0607. Calculations have been carried out using resources provided by Wroclaw Centre for Networking and Supercomputing (http://wcss.pl), grant No. 177.

## Author information

### Affiliations

#### Department of Computational Intelligence, ENGINE - The European Centre for Data Science, Wrocław University of Science and Technology, Wrocław, 50-370, Poland

- Jarosław Jankowski
- , Piotr Bródka
- , Przemysław Kazienko
- , Boleslaw K. Szymanski
- , Radosław Michalski
- & Tomasz Kajdanowicz

#### Department of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, 71-210, Poland

- Jarosław Jankowski

#### Department of Computer Science, Rensselaer Polytechnic Institute, Troy, 12180, NY, United States

- Boleslaw K. Szymanski

### Authors

### Search for Jarosław Jankowski in:

### Search for Piotr Bródka in:

### Search for Przemysław Kazienko in:

### Search for Boleslaw K. Szymanski in:

### Search for Radosław Michalski in:

### Search for Tomasz Kajdanowicz in:

### Contributions

J.J., P.B. created an initial concept of sequential seeding; J.J., P.B., P.K., B.K.S., R.M. developed the concept of sequential seeding to its current state; J.J., P.B., P.K., B.K.S. designed the experiments; J.J. executed all experiments and simulations; BKS analyzed and described the proposed method coverage improvement theoretically; J.J., P.B., P.K., B.K.S. analyzed data and discussed results; J.J., P.B. performed additional simulations and analysis presented within Supplementary Information; J.J., P.B., P.K., R.M., T.K. drafted the manuscript. All authors critically reviewed the manuscript and approved the final version.

### Competing Interests

The authors declare that they have no competing interests.

### Corresponding author

Correspondence to Jarosław Jankowski.

## Electronic supplementary material

## About this article

### Publication history

#### Received

#### Accepted

#### Published

### DOI

https://doi.org/10.1038/s41598-017-00937-8

### Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

## Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.