Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-24T13:20:19.973Z Has data issue: false hasContentIssue false
  • English
  • Français

COMPLEX NETWORK TOOLS TO ENABLE IDENTIFICATION OF A CRIMINAL COMMUNITY

Part of: Circuits, networks Graph theory

Published online by Cambridge University Press:  16 August 2016

PRITHEEGA MAGALINGAM
PRITHEEGA MAGALINGAM*
Affiliation:
Advanced Informatics School, Level 5, Menara Razak, Universiti Teknologi Malaysia (UTM), Jalan Sultan Yahya Petra, 54100 Kuala Lumpur, Malaysia email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

criminal networktrustshortest pathleave-one-outsuspectinvestigationbetweenness centralityintermediate nodereliance

MSC classification

Primary: 94C15: Applications of graph theory
Secondary: 05C82: Small world graphs, complex networks
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 94 , Issue 2 , October 2016 , pp. 350 - 352
Copyright
© 2016 Australian Mathematical Publishing Association Inc. 

References

Basu, A., ‘Social network analysis: a methodology for studying terrorism’, in: Social Networking (Springer, Switzerland, 2014), 215–242.Google Scholar
Brandes, U., ‘A faster algorithm for betweenness centrality’, J. Math. Soc. 25(2) (2001), 163–177.Google Scholar
Brickey, K. F., ‘From Enron to WorldCom and beyond: life and crime after Sarbanes–Oxley’, Wash. U. L. Q. 81 (2003), 357–402.Google Scholar
Brin, S. and Page, L., ‘The anatomy of a large-scale hypertextual web search engine’, Comput. Networks ISDN Syst. 30(1) (1998), 107–117.CrossRefGoogle Scholar
Cohen, W. W., Enron email dataset (2009) [online]. Available at: http://www.cs.cmu.edu/∼enron/ (accessed 10 March 2012).Google Scholar
Didimo, W., Liotta, G., Montecchiani, F. and Palladino, P., ‘An advanced network visualization system for financial crime detection’, in: Pacific Visualization Symp. (PacificVis) (IEEE, New Jersey, 2011), 203–210.Google Scholar
Geisberger, R., Sanders, P. and Schultes, D., ‘Better approximation of betweenness centrality’, in: ALENEX (SIAM, Philadelphia, PA, 2008), 90–100.Google Scholar
Kamvar, S., Haveliwala, T. and Golub, G., ‘Adaptive methods for the computation of PageRank’, Linear Algebra Appl. 386 (2004), 51–65.CrossRefGoogle Scholar
Magalingam, P., Davis, S. and Rao, A., ‘Using shortest path to discover criminal community’, Digital Investigation 15 (2015), 1–17.Google Scholar
Magalingam, P., Rao, A. and Davis, S., ‘Identifying a criminal’s network of trust’, in: 2014 Tenth Int. Conf. Signal-Image Technology and Internet-Based Systems (SITIS) (IEEE, Washington, DC, 2014), 309–316.Google Scholar
Magalingam, P., Rao, A. and Davis, S., ‘Ranking the importance level of intermediaries to a criminal using a reliance measure’. arXiv:1506.06221v3.Google Scholar
Newman, M., Networks: An Introduction (Oxford University Press, New York, 2009).Google Scholar
Oatley, G. and Crick, T., ‘Measuring UK crime gangs’, in: 2014 IEEE/ACM Int. Conf. Advances in Social Networks Analysis and Mining (ASONAM) (IEEE, New Jersey, 2014), 253–256.Google Scholar
White, S. and Smyth, P., ‘Algorithms for estimating relative importance in networks’, in: Proc. Ninth ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (ACM, New York, 2003), 266–275.Google Scholar