Why rumors spread fast in social networks

Public release date: 21-May-2012
[ | E-mail | Share ]

Contact: Gordon Bolduan
bolduan@mmci.uni-saarland.de
49-068-130-270-741
Saarland University

"It is fascinating," Tobias Friedrich of the Cluster of Excellence on "Multimodal Computing and Interaction" says. He points out that so far, it has been assumed that the uncontrolled growth in social networks creates a structure on which information spreads very fast. "But now we can prove it in a mathematical way," says Friedrich, who leads the independent research group "Random Structures and Algorithms."

Together with his research colleagues Benjamin Doerr, adjunct professor for algorithms and complexity at Saarland University, and the PhD student Mahmoud Fouz he proved that information spreads in social networks much faster than in networks where everyone communicates with everyone else, or in networks whose structure is totally random.

The scientists explain their results through the successful combination of persons with many contacts and persons with only a few contacts. "A person who keeps only a few connections can inform all of these contacts very fast," Friedrich says. Additionally, it can be proved that among these few contacts there always is a highly networked person who is contacted by a lot of other people in the social network, the scientist points out. "Therefore everybody in these networks gets informed rapidly."

To model how people connect with each other in a social network, the scientists chose so-called preferential attachment graphs as a basic network model. It assumes that new members of a social network would more likely connect to a person maintaining many connections than to a person with only a few contacts. The communication within the network is based on the model that every person regularly exchanges all information with his or her contacts, but never speaks to the person contacted in the previous communication round.

###

It took the scientists twelve pages to write down the mathematical proof. They explain the concept of the proof more simply in the article "Why Rumors Spread Fast in Social Networks," published in the peer-reviewed magazine "Communications of the ACM" in June.

Computer Science on the Saarland University campus

A unique number of renowned computer science institutes do research on the campus in Saarbrucken, Germany. In addition to the computer science faculty and the Cluster of Excellence, these include the German Research Center for Artificial Intelligence (DFKI), the Max Planck Institute for Informatics, the Max Planck Institute for Software Systems, the Center for IT Security, Privacy and Accountability and the Intel Visual Computing Institute.

See also:

Social Networks Spread Rumors in Sublogarithmic Time www.mpi-inf.mpg.de/~tfried/paper/2012CACM.pdf

For further information please contact:

Tobias Friedrich
Cluster of Excellence "Multimodal Computing and Interaction"
Phone: 0681 9325 1055
E-Mail: t.friedrich@mpi-inf.mpg.de

Gordon Bolduan
Science Communication
Cluster of Excellence "Multimodal Computing and Interaction"
Phone: 0681 302-70741
E-Mail: bolduan@mmci.uni-saarland.de

---

[ | E-mail | Share ]

?

AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert! system.

Public release date: 21-May-2012
[ | E-mail | Share ]

Contact: Gordon Bolduan
bolduan@mmci.uni-saarland.de
49-068-130-270-741
Saarland University

"It is fascinating," Tobias Friedrich of the Cluster of Excellence on "Multimodal Computing and Interaction" says. He points out that so far, it has been assumed that the uncontrolled growth in social networks creates a structure on which information spreads very fast. "But now we can prove it in a mathematical way," says Friedrich, who leads the independent research group "Random Structures and Algorithms."

Together with his research colleagues Benjamin Doerr, adjunct professor for algorithms and complexity at Saarland University, and the PhD student Mahmoud Fouz he proved that information spreads in social networks much faster than in networks where everyone communicates with everyone else, or in networks whose structure is totally random.

The scientists explain their results through the successful combination of persons with many contacts and persons with only a few contacts. "A person who keeps only a few connections can inform all of these contacts very fast," Friedrich says. Additionally, it can be proved that among these few contacts there always is a highly networked person who is contacted by a lot of other people in the social network, the scientist points out. "Therefore everybody in these networks gets informed rapidly."

To model how people connect with each other in a social network, the scientists chose so-called preferential attachment graphs as a basic network model. It assumes that new members of a social network would more likely connect to a person maintaining many connections than to a person with only a few contacts. The communication within the network is based on the model that every person regularly exchanges all information with his or her contacts, but never speaks to the person contacted in the previous communication round.

###

It took the scientists twelve pages to write down the mathematical proof. They explain the concept of the proof more simply in the article "Why Rumors Spread Fast in Social Networks," published in the peer-reviewed magazine "Communications of the ACM" in June.

Computer Science on the Saarland University campus

A unique number of renowned computer science institutes do research on the campus in Saarbrucken, Germany. In addition to the computer science faculty and the Cluster of Excellence, these include the German Research Center for Artificial Intelligence (DFKI), the Max Planck Institute for Informatics, the Max Planck Institute for Software Systems, the Center for IT Security, Privacy and Accountability and the Intel Visual Computing Institute.

See also:

Social Networks Spread Rumors in Sublogarithmic Time www.mpi-inf.mpg.de/~tfried/paper/2012CACM.pdf

For further information please contact:

Tobias Friedrich
Cluster of Excellence "Multimodal Computing and Interaction"
Phone: 0681 9325 1055
E-Mail: t.friedrich@mpi-inf.mpg.de

Gordon Bolduan
Science Communication
Cluster of Excellence "Multimodal Computing and Interaction"
Phone: 0681 302-70741
E-Mail: bolduan@mmci.uni-saarland.de

---

[ | E-mail | Share ]

?

AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert! system.

new york jets etch a sketch romney tim tebow ny jets ny jets sean payton saints bounty program