Abstract
The concept of harmonic influence has been recently proposed as a metric for the importance of nodes in a social network. A distributed message passing algorithm for its computation has been proposed by Vassio et al. (2014) and proved to converge on general graphs by Rossi and Frasca (2016a). In this paper, we want to evaluate the convergence time of this algorithm by using a mean-field approach. The mean-field dynamics is first introduced in a “homogeneous” setting, where it is exact, then heuristically extended to a non-homogeneous setting. The rigorous analysis of the mean-field dynamics is complemented by numerical examples and simulations that demonstrate the validity of the approach.
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.
