Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling

In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity o...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 22; no. 5; pp. 1389 - 1400
Main Authors Bo Han, Jian Li, Srinivasan, Aravind
Format Journal Article
LanguageEnglish
Published New York IEEE 01.10.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity of these algorithms is known to be very high, making them unsuitable for large-scale networks. We propose a lightweight and distributed protocol, iWander, to identify influential users through fixed-length random-walk sampling. We prove that random-walk sampling with O(logn) steps, where n is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees. To the best of our knowledge, we are the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users, although this technique has been used in other areas. The most attractive feature of iWander is its extremely low control-message overhead, which lends itself well to mobile applications. We evaluate the performance of iWander for two applications, targeted immunization of infectious diseases and target-set selection for information dissemination. Through extensive simulation studies using a real-world mobility trace, we demonstrate that targeted immunization using iWander achieves a comparable performance with a degree-based immunization policy that vaccinates users with a large number of contacts first, while generating only less than 1% of this policy's control messages. We also show that target-set selection based on iWander outperforms the random and degree-based selections for information dissemination in several scenarios.
AbstractList In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity of these algorithms is known to be very high, making them unsuitable for large-scale networks. We propose a lightweight and distributed protocol, [Formula Omitted], to identify influential users through fixed-length random-walk sampling. We prove that random-walk sampling with [Formula Omitted] steps, where [Formula Omitted] is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees. To the best of our knowledge, we are the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users, although this technique has been used in other areas. The most attractive feature of [Formula Omitted] is its extremely low control-message overhead, which lends itself well to mobile applications. We evaluate the performance of [Formula Omitted] for two applications, targeted immunization of infectious diseases and target-set selection for information dissemination. Through extensive simulation studies using a real-world mobility trace, we demonstrate that targeted immunization using [Formula Omitted] achieves a comparable performance with a degree-based immunization policy that vaccinates users with a large number of contacts first, while generating only less than 1% of this policy's control messages. We also show that target-set selection based on [Formula Omitted] outperforms the random and degree-based selections for information dissemination in several scenarios.
In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity of these algorithms is known to be very high, making them unsuitable for large-scale networks. We propose a lightweight and distributed protocol, iWander, to identify influential users through fixed-length random-walk sampling. We prove that random-walk sampling with O(logn) steps, where n is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees. To the best of our knowledge, we are the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users, although this technique has been used in other areas. The most attractive feature of iWander is its extremely low control-message overhead, which lends itself well to mobile applications. We evaluate the performance of iWander for two applications, targeted immunization of infectious diseases and target-set selection for information dissemination. Through extensive simulation studies using a real-world mobility trace, we demonstrate that targeted immunization using iWander achieves a comparable performance with a degree-based immunization policy that vaccinates users with a large number of contacts first, while generating only less than 1% of this policy's control messages. We also show that target-set selection based on iWander outperforms the random and degree-based selections for information dissemination in several scenarios.
In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity of these algorithms is known to be very high, making them unsuitable for large-scale networks. We propose a lightweight and distributed protocol, hbox ttiWander , to identify influential users through fixed-length random-walk sampling. We prove that random-walk sampling with O openbracket logn [ closebracket ] steps, where n is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees. To the best of our knowledge, we are the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users, although this technique has been used in other areas. The most attractive feature of hbox ttiWander is its extremely low control-message overhead, which lends itself well to mobile applications. We evaluate the performance of hbox ttiWander for two applications, targeted immunization of infectious diseases and target-set selection for information dissemination. Through extensive simulation studies using a real-world mobility trace, we demonstrate that targeted immunization using hbox ttiWander achieves a comparable performance with a degree-based immunization policy that vaccinates users with a large number of contacts first, while generating only less than 1% of this policy's control messages. We also show that target-set selection based on hbox ttiWander outperforms the random and degree-based selections for information dissemination in several scenarios.
Author Srinivasan, Aravind
Bo Han
Jian Li
Author_xml – sequence: 1
  surname: Bo Han
  fullname: Bo Han
  email: bohan@research.att.com
  organization: Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA
– sequence: 2
  surname: Jian Li
  fullname: Jian Li
  email: lijian83@mail.tsinghua.edu.cn
  organization: Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China
– sequence: 3
  givenname: Aravind
  surname: Srinivasan
  fullname: Srinivasan, Aravind
  email: srin@cs.umd.edu
  organization: Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA
BookMark eNp9kctOAyEUhonRRKs-gHFD4sbNVC6FGdwZr028JFpjXE2QgZbKQIUZE99eJjUuXLg6HPJ9nBP-Edj0wWsADjAaY4zEyez-cjYmCNMxIRWaUL4BdjBjVUEY55v5jDgtOBdkG4xSWqJMIsJ3QPsa-givotW-SfBGfmp4F6L-vZktpIeZgRfhFE4b7Ttrvqyfw6k3rh9a6bLxZp2Gz0nHwYihny_go_RNaIsX6d7hk2xXLlt7YMtIl_T-T90Fz1eXs_Ob4vbhenp-dlsoKnhXTCqjGC5LwplUVPFGaWwQlxy_TajBsmoqZCQuqWmaUpFKKSErwQgThhJFOd0Fx-t3VzF89Dp1dWuT0s5Jr0OfasyJoEwwSjJ69Add5h_xebtM4QnhApcDhdeUiiGlqE29iraV8avGqB4CqIcA6iGA-ieA7JR_HGU72dnguyit-9c8XJtWa_07iTMhECb0G9HFlI0
CODEN IEANEP
CitedBy_id crossref_primary_10_1016_j_future_2018_01_043
crossref_primary_10_1109_JSYST_2014_2369526
crossref_primary_10_14778_3311880_3311884
crossref_primary_10_1109_ACCESS_2022_3213044
crossref_primary_10_1109_ACCESS_2020_2969992
crossref_primary_10_1007_s41109_022_00475_x
crossref_primary_10_1016_j_jnca_2020_102768
crossref_primary_10_1016_j_comcom_2016_11_006
crossref_primary_10_3233_JIFS_182512
crossref_primary_10_1109_TSMC_2017_2690827
crossref_primary_10_1016_j_future_2017_04_043
crossref_primary_10_1109_TMC_2015_2451624
crossref_primary_10_1016_j_optcom_2016_12_045
Cites_doi 10.1109/MPRV.2010.41
10.1038/nature02541
10.1098/rspa.1927.0118
10.1145/502512.502525
10.1371/journal.pone.0012948
10.1145/1080829.1080855
10.1086/229693
10.1145/1879141.1879192
10.1016/0020-0190(80)90021-6
10.1016/j.socnet.2004.11.009
10.1145/2030613.2030623
10.1145/1151659.1159945
10.1145/2030613.2030624
10.1145/2254756.2254794
10.1109/TMC.2011.101
10.1103/PhysRevLett.91.247901
10.1109/TMC.2007.1060
10.1109/INFCOM.2011.5934896
10.1145/775047.775057
10.1109/ICNP.2012.6459980
10.1093/aje/kwi308
10.1109/TNET.2002.801403
10.1145/1557019.1557047
10.1073/pnas.1009094108
10.1145/956750.956769
10.1090/dimacs/070/09
10.1017/CBO9780511813603
10.1038/072294b0
10.1109/INFCOM.2010.5462078
10.1145/2248371.2248376
10.1109/TNET.2008.2001730
10.1145/1555349.1555351
10.1103/PhysRevLett.92.118701
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2014
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2014
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TNET.2013.2280436
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2566
EndPage 1400
ExternalDocumentID 3466236901
10_1109_TNET_2013_2280436
6599012
Genre orig-research
GroupedDBID -DZ
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
85S
8US
97E
9M8
AAJGR
AAKMM
AALFJ
AARMG
AASAJ
AAWTH
AAWTV
ABAZT
ABPPZ
ABQJQ
ABVLG
ACGFS
ACGOD
ACIWK
ACM
ADBCU
ADL
AEBYY
AEFXT
AEJOY
AENSD
AETEA
AETIX
AFWIH
AFWXC
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AIKLT
AKJIK
AKQYR
AKRVB
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BDXCO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CCLIF
CS3
D0L
EBS
EJD
FEDTE
GUFHI
HF~
HGAVV
HZ~
H~9
I07
ICLAB
IEDLZ
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
LHSKQ
M43
MVM
O9-
OCL
P1C
P2P
PQQKQ
RIA
RIE
RNS
ROL
TN5
UPT
UQL
VH1
XOL
YR2
ZCA
AAYOK
AAYXX
CITATION
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c396t-48fc5177265ac3c6dce1f06a61b43f1a8d80fa173fdd7c28cc9a895259f32c363
IEDL.DBID RIE
ISSN 1063-6692
IngestDate Fri Jul 11 04:22:45 EDT 2025
Mon Jun 30 05:33:16 EDT 2025
Tue Jul 01 01:49:17 EDT 2025
Thu Apr 24 23:05:31 EDT 2025
Tue Aug 26 16:50:06 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c396t-48fc5177265ac3c6dce1f06a61b43f1a8d80fa173fdd7c28cc9a895259f32c363
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1614269172
PQPubID 32020
PageCount 12
ParticipantIDs proquest_journals_1614269172
ieee_primary_6599012
crossref_primary_10_1109_TNET_2013_2280436
proquest_miscellaneous_1629359532
crossref_citationtrail_10_1109_TNET_2013_2280436
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2014-10-01
PublicationDateYYYYMMDD 2014-10-01
PublicationDate_xml – month: 10
  year: 2014
  text: 2014-10-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE/ACM transactions on networking
PublicationTitleAbbrev TNET
PublicationYear 2014
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref34
ref12
ref37
ref15
ref14
ref31
ref30
ref33
ref11
ref32
ref10
ref2
ref1
ref17
ref16
eubank (ref9) 2006; 70
ref18
lov sz (ref21) 1993; 2
xie (ref35) 2005
kotz (ref19) 2005
ref24
ref26
ref25
ref20
yu (ref36) 2006
ref22
ref28
ref29
ref8
ref7
p sztor (ref27) 2010
ref3
ref6
ref5
motani (ref23) 2005
christley (ref4) 2005; 162
References_xml – start-page: 242
  year: 2005
  ident: ref35
  article-title: Worm origin identification using random moonwalks
  publication-title: Proc IEEE Symp Security Privacy
– ident: ref29
  doi: 10.1109/MPRV.2010.41
– ident: ref8
  doi: 10.1038/nature02541
– ident: ref18
  doi: 10.1098/rspa.1927.0118
– ident: ref7
  doi: 10.1145/502512.502525
– year: 2005
  ident: ref19
  publication-title: ?CRAWDAD trace dartmouth/campus/movement/01 04 (v 2005-03-08) ?
– ident: ref3
  doi: 10.1371/journal.pone.0012948
– start-page: 243
  year: 2005
  ident: ref23
  article-title: PeopleNet: Engineering a wireless virtual social network
  publication-title: Proc Mobicom
  doi: 10.1145/1080829.1080855
– ident: ref10
  doi: 10.1086/229693
– ident: ref31
  doi: 10.1145/1879141.1879192
– ident: ref6
  doi: 10.1016/0020-0190(80)90021-6
– ident: ref24
  doi: 10.1016/j.socnet.2004.11.009
– ident: ref30
  doi: 10.1145/2030613.2030623
– start-page: 267
  year: 2006
  ident: ref36
  article-title: SybilGuard: Defending against sybil attacks via social networks
  publication-title: Proc SIGCOMM
  doi: 10.1145/1151659.1159945
– ident: ref25
  doi: 10.1145/2030613.2030624
– ident: ref11
  doi: 10.1145/2254756.2254794
– ident: ref14
  doi: 10.1109/TMC.2011.101
– volume: 2
  start-page: 1
  year: 1993
  ident: ref21
  article-title: Random walks on graphs: A survey
  publication-title: Combinatorics Paul Erd s is Eighty
– ident: ref5
  doi: 10.1103/PhysRevLett.91.247901
– ident: ref1
  doi: 10.1109/TMC.2007.1060
– ident: ref37
  doi: 10.1109/INFCOM.2011.5934896
– ident: ref32
  doi: 10.1145/775047.775057
– ident: ref15
  doi: 10.1109/ICNP.2012.6459980
– start-page: 178
  year: 2010
  ident: ref27
  article-title: Selective reprogramming of mobile sensor networks through social community detection
  publication-title: Proc EWSN
– volume: 162
  start-page: 1024
  year: 2005
  ident: ref4
  article-title: Infection in social networks: Using network analysis to identify high-risk individuals
  publication-title: Amer J Epidemiol
  doi: 10.1093/aje/kwi308
– ident: ref13
  doi: 10.1109/TNET.2002.801403
– ident: ref2
  doi: 10.1145/1557019.1557047
– ident: ref33
  doi: 10.1073/pnas.1009094108
– ident: ref17
  doi: 10.1145/956750.956769
– volume: 70
  start-page: 181
  year: 2006
  ident: ref9
  article-title: Structure of social contact networks and their impact on epidemics
  publication-title: AMS-DIMACS Vol Discrete Methods Epidemiol
  doi: 10.1090/dimacs/070/09
– ident: ref22
  doi: 10.1017/CBO9780511813603
– ident: ref28
  doi: 10.1038/072294b0
– ident: ref12
  doi: 10.1109/INFCOM.2010.5462078
– ident: ref16
  doi: 10.1145/2248371.2248376
– ident: ref34
  doi: 10.1109/TNET.2008.2001730
– ident: ref20
  doi: 10.1145/1555349.1555351
– ident: ref26
  doi: 10.1103/PhysRevLett.92.118701
SSID ssj0013026
Score 2.2225974
Snippet In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1389
SubjectTerms Algorithms
Centrality
disease control
Graphs
Immunization
influential mobile users
Information dissemination
Mobile communication
Mobile communication systems
Mobile computing
Mobile handsets
Performance evaluation
Policies
Probes
Radiation detectors
Random variables
random walks
Sampling
Social network services
Weight reduction
Title Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling
URI https://ieeexplore.ieee.org/document/6599012
https://www.proquest.com/docview/1614269172
https://www.proquest.com/docview/1629359532
Volume 22
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9QwDLfGnsYDHxuIg4EyiSe03tKmTRveEOx0TNoe4E7bW5U46Sbt1kPbHQ_89dhpr0OAEOpL1TppJMeOXds_A7xNHUcM0SXoXZnkPqsSW6JJpOIgk_VkccQE2TM9necnF8XFFhwOtTAhhJh8FsZ8G2P5folr_lV2pAuO4pDCfUCOW1erdR8xkLG1Gnk4KtHaZH0EM5XmaHZ2POMkLjVm7Jc8ojHfn0GxqcofmjgeL5PHcLpZWJdVcj1er9wYf_yG2fi_K38Cj3o7U3zoNsZT2ArtLjz8BX1wD25I0m_FhIGO_Z2Y2u9BnNK8w5PZlW0F0YhPy_eiK-iNRVHic9fYhHTDgkY40itizkWbNCI2_RFfbOtJ957bxbX4ajlnvb18BvPJ8ezjNOm7LySojF4ledVgkZLxrQuLCrXHkDZSW526XDWprXwlG5uWqvG-xKxCNLYyBblTjcpQafUctttlG16A8E1ZOpRV7uhSWWGlcQaVlAFzE1QYgdzwo8Yempw7ZCzq6KJIUzMLa2Zh3bNwBO-GId86XI5_Ee8xSwbCnhsj2N8wve4l964mC5ire8muG8HB8JpkjgMptg3LNdNksaBZZS__PvMr2KHv513S3z5sr27X4TUZLyv3Ju7an3PX6ow
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwzV1Lb9QwEB6VcoAeyqOgbilgJLggZevYiRMjcUC0q13a7gGyorfgV1qpSxZ1d0HwW_gr_DfGTjZFgLhVQrlEydjyYzL-JvMCeBprbzE0OjJWZ1FiWR6pzMiIcm9kUhYRR3CQHYvhJHlzkp6swfcuFsY5F5zPXN_fBlu-nZml_1W2J1JvxWGtC-Wh-_oFFbT5y9E-7uYzxgYHxeth1NYQiAyXYhEleWXSGCGkSJXhRljj4ooKJWKd8CpWuc1ppeKMV9ZmhuXGSJXLFJWCijPDBcd-r8F1xBkpa6LDLm0UNBRzQ52KR0JI1tpMYyr3ivFB4d3GeN9nm0lC_ufLUy-UcflD9ocDbXALfqyWovFjOe8vF7pvvv2WJfJ_XavbsNkiafKqYf07sObqu7DxS37FLfiIsuyCDHwqZzsnQ_XZkWOcR_ekOFM1QRqyP3tBmpDlEPZFRk3pFpR-U2yhUXKSiQ9LxRahrBF5q2qLp8t7NT0n75T3yq9P78HkSuZ7H9brWe22gdgqy7SheaLx4ixVVGppOKXOJNJx1wO62v_StMnXfQ2QaRmUMCpLzzKlZ5myZZkePO-afGoyj_yLeMuzQEfY7n4PdldMVrayaV4ixvfxy4hce_Cke41SxZuKVO1mS0_DQsg2Zzt_7_kx3BgWx0fl0Wh8-ABu4liSxsVxF9YXF0v3EKHaQj8KXwyBD1fNdj8BQalIgA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Your+Friends+Have+More+Friends+Than+You+Do%3A+Identifying+Influential+Mobile+Users+Through+Random-Walk+Sampling&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Han%2C+Bo&rft.au=Li%2C+Jian&rft.au=Srinivasan%2C+Aravind&rft.date=2014-10-01&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=22&rft.issue=5&rft.spage=1389&rft.epage=1400&rft_id=info:doi/10.1109%2FTNET.2013.2280436&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon