Seeing Red: Locating People of Interest in Networks

  • Pivithuru Wijegunawardana
  • Vatsal Ojha
  • Ralucca Gera
  • Sucheta Soundarajan
Conference paper
Part of the Springer Proceedings in Complexity book series (SPCOM)


The focus of the current research is to identify people of interest in social networks. We are especially interested in studying dark networks , which represent illegal or covert activity. In such networks, people are unlikely to disclose accurate information when queried. We present RedLearn, an algorithm for sampling dark networks with the goal of identifying as many nodes of interest as possible. We consider two realistic lying scenarios, which describe how individuals in a dark network may attempt to conceal their connections. We test and present our results on several real-world multilayered networks, and show that RedLearn achieves up to a 340% improvement over the next best strategy.


Multilayered networks Sampling Lying scenarios Nodes of interest 


  1. 1.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Phys. Rev. E 64(4), 046135 (2001)ADSCrossRefGoogle Scholar
  2. 2.
    Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (2002)Google Scholar
  3. 3.
    Asztalos, A., Toroczkai, Z.: Network discovery by generalized random walks. EPL (Europhysics Letters) 92(5), 50008 (2010)ADSCrossRefGoogle Scholar
  4. 4.
    Baker, W.E., Faulkner, R.R.: The social organization of conspiracy: illegal networks in the heavy electrical equipment industry. Am. Sociol. Rev. pp. 837–860 (1993)Google Scholar
  5. 5.
    Biernacki, P., Waldorf, D.: Snowball sampling: problems and techniques of chain referral sampling. Soc. Methods Res. 10(2), 141–163 (1981)Google Scholar
  6. 6.
    Bliss, C.A., Danforth, C.M., Dodds, P.S.: Estimation of global network statistics from incomplete data. PloS one 9(10), e108471 (2014)ADSCrossRefGoogle Scholar
  7. 7.
    Davis, B., Gera, R., Lazzaro, G., Lim, B.Y., Rye, E.C.: The marginal benefit of monitor placement on networks. In: Complex Networks VII, pp. 93–104. Springer (2016)Google Scholar
  8. 8.
    Friedman, N., Koller, D.: Being bayesian about network structure. a bayesian approach to structure discovery in bayesian networks. Mach. Learn. 50(1–2), 95–125 (2003)CrossRefzbMATHGoogle Scholar
  9. 9.
    Fronczak, A., Fronczak, P.: Biased random walks in complex networks: the role of local navigation rules. Phys. Rev. E 80(1), 016107 (2009)ADSMathSciNetCrossRefGoogle Scholar
  10. 10.
    Gera, R., Miller, R., MirandaLopez, M., Warnke, S.: Developing multilayered dark networks to enhance community identification. Submitted for publication (2016)Google Scholar
  11. 11.
    Hughes, B.D.: Random walks and random environments (1996)Google Scholar
  12. 12.
    Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: SIGKDD, pp. 631–636. ACM (2006)Google Scholar
  13. 13.
    Noh, J.D., H. Rieger: Random walks on complex networks. Phys. Rev. Lett. 92(11), 118701 (2004)Google Scholar
  14. 14.
    Raab, J., Milward, H.B.: Dark networks as problems. J. Public Adm. Res. Theory 13(4), 413–439 (2003)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Pivithuru Wijegunawardana
    • 1
  • Vatsal Ojha
    • 2
  • Ralucca Gera
    • 3
  • Sucheta Soundarajan
    • 1
  1. 1.Department of Electrical Engineering & Computer ScienceSyracuse UniversityNew YorkUSA
  2. 2.Dougherty Valley High SchoolSan RamonUSA
  3. 3.Department of Applied MathematicsNaval Postgraduate SchoolMontereyUSA

Personalised recommendations