Sciweavers

856 search results - page 44 / 172
» On Randomness Measures for Social Networks.
Sort
View
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 6 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
IMC
2010
ACM
15 years 4 months ago
Listen to me if you can: tracking user experience of mobile network on social media
Social media sites such as Twitter continue to grow at a fast pace. People of all generations use social media to exchange messages and share experiences of their life in a timely...
Tongqing Qiu, Junlan Feng, Zihui Ge, Jia Wang, Jun...
INFOCOM
2010
IEEE
15 years 4 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
WWW
2008
ACM
16 years 7 months ago
Statistical properties of community structure in large social and information networks
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...
BMCBI
2005
127views more  BMCBI 2005»
15 years 6 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao