Abstract
An influence network is a graph where each node changes its state according to a function of the states of its neighbors. We present bounds for the stabilization time of such networks. We derive a general bound for the classic “Democrats and Republicans” problem and study different model modifications and their influence on the way of stabilizing and their stabilization time. Our main contribution is an exponential lower and upper bound on weighted influence networks. We also investigate influence networks with asymmetric weights and show an influence network with an exponential cycle length in the stable situation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, F.R., Gordon, D.M.: Information Collection and Spread by Networks of Patrolling Ants. The American Naturalist (1992)
Berger, E.: Dynamic Monopolies of Constant Size. Journal of Combinatorial Theory Series B (2008)
Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. In: WWW (1998)
Cartwright, D.: Studies in Social Power. Publications of the Institute for Social Research: Research Center for Group Dynamics Series (1959)
Chen, W., Yuan, Y., Zhang, L.: Scalable Influence Maximization in Social Networks under the Linear Threshold Model. In: ICDM (2010)
Doerr, B., Fouz, M., Friedrich, T.: Social Networks Spread Rumors in Sublogarithmic Time. In: STOC (2011)
Frischknecht, S., Keller, B., Wattenhofer, R.: Convergence in (Social) Influence Networks. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 433–446. Springer, Heidelberg (2013)
Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic Monopolies in Tori. In: IWACOIN (2004)
Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 128–137. Springer, Heidelberg (1990)
Garfield, E., Merton, R.K.: Citation Indexing-Its Theory and Application in Science, Technology, and Humanities (1979)
Goles, E., Olivos, J.: Periodic Behaviour of Generalized Threshold Functions. Discrete Mathematics (1980)
Goles, E., Tchuente, M.: Iterative Behaviour of Generalized Majority Functions. Mathematical Social Sciences (1983)
Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barabsi, A.L.: The Large-Scale Organization of Metabolic Networks. Nature (2000)
Kelman, H.C.: Compliance, Identification, and Internalization: Three Processes of Attitude Change. Journal of Conflict Resolution (1958)
Kempe, D., Kleinberg, J.M., Tardos, É.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Kleinberg, J.M.: Hubs, Authorities, and Communities. CSUR (1999)
Kamp, C., Moslonka-Lefebvre, M., Alizon, S.: Epidemic Spread on Weighted Networks. PLoS Computational Biology (2013)
Kohonen, T.: Self-Organization and Associative Memory. Springer, Heidelberg (1989)
Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of Mouth: Rumor Dissemination in Social Networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185–196. Springer, Heidelberg (2008)
Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized Rumor Spreading. In: FOCS (2000)
Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Signed Networks in Social Media. In: CHI (2010)
Manouchehr, Z.: On Dynamic Monopolies of Graphs with General Thresholds. Discrete Mathematics (2012)
Moreno, J.L., Jennings, H.H.: Who Shall Survive?: A New Approach to the Problem of Human Interrelations. Nervous and mental disease monograph series. Nervous and mental disease publishing co. (1934)
Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and Analysis of Online Social Networks. In: SIGCOMM (2007)
Neumann, J.V.: Theory of Self-Reproducing Automata. University of Illinois Press (1966)
Peleg, D.: Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review. In: SIROCCO (1996)
Peleg, D.: Size Bounds for Dynamic Monopolies. Discrete Applied Mathematics (1998)
Poljak, S., Sra, M.: On Periodical Behaviour in Societies with Symmetric Influences. Combinatorica (1983)
Rolls, E.T., Treves, A.: Neural Networks and Brain Function. Oxford University Press, USA (1998)
Sauerwald, T., Sudholt, D.: A Self-Stabilizing Algorithm for Cut Problems in Synchronous Networks. Theoretical Computer Science (2010)
Sauerwald, T., Stauffer, A.: Rumor Spreading and Vertex Expansion on Regular Graphs. In: SODA (2011)
Winkler, P.: Puzzled: Delightful Graph Theory. CACM (2008)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Watts, D.J., Strogatz, S.H.: Collective Dynamics of ‘Small-World’ Networks. Nature (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Keller, B., Peleg, D., Wattenhofer, R. (2014). How Even Tiny Influence Can Have a Big Impact!. In: Ferro, A., Luccio, F., Widmayer, P. (eds) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol 8496. Springer, Cham. https://doi.org/10.1007/978-3-319-07890-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-07890-8_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07889-2
Online ISBN: 978-3-319-07890-8
eBook Packages: Computer ScienceComputer Science (R0)