Sciweavers

89 search results - page 8 / 18
» Randomizing Social Networks: a Spectrum Preserving Approach
Sort
View
76
Voted
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
15 years 10 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
ICDCS
2011
IEEE
13 years 9 months ago
JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
Rui Zhang 0007, Yanchao Zhang, Xiaoxia Huang
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
15 years 9 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
ECRA
2010
145views more  ECRA 2010»
14 years 9 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
ICML
2009
IEEE
15 years 10 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis