Abstract
In this paper we analyse different aspects of the diffusion of innovation in social network. Adopting the linear threshold model we firstly propose an algorithm based on the linear programming which takes as input a set of innovators and returns the maximal cohesive subset contained in the complement of the seed set. Then we introduce and formalize with integer programming two problems. The first one is that of finding a seed set of r individual that maximizes the spread of innovation in the network in k step. The second one is that of finding a seed set whose cardinality is minimal which diffuses the innovation to a desired set of adopters in k steps.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
