Abstract
This research makes use of evidence that the distribution of crime by census tracts in large cities follows a Power Law. This means that there are few places that concentrate many crimes and many places that concentrate few crimes. In this article we investigate how modeling complex networks and genetic algorithms can help to understand the behavior of samples representing views of part of the map of crimes of a large metropolis. The representation of the network is a planar graph where the nodes are the centroids of census tracts, the edges represent the adjacency between the tracts, and each node has a weight representing the number of crimes recorded in the census tract. The problem of this research lies in the context of the study of sampling distributions that have long tails (e.g. the weight of the nodes of the graph follows a Power Law). In particular, we describe a genetic algorithm to explore the space of possible samples of the initial distribution (plotted crimes throughout the city) so that the maximum number of samples holds features to follow a Power Law with an exponent close to the original distribution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cançado, T.: Alocação e despacho de recursos para o combate à criminalidade. Dissertação de mestrado, Departamento de Ciência da Computação, UFMG (2005)
Clauset, A., Moore, C.: Accuracy and Scaling Phenomena in Internet Mapping. Phys. Rev. Lett. 94(1), 018701 (2005)
Cole, R.M.: Clustring with Genetic Algorithms. Master’s thesis, Department of Computer Science, University of Western Australia (1998)
Datta, D., Figueira, J.R., Fonseca, C.M., Tavares-Pereira, F.: Graph Partitioning Through a Multi-Objective Evolutionary Algorithm: A Preliminary Study. In: Keijzer, M. (ed.) Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO 2008), pp. 625–632. ACM, New York (2008)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2) (2002)
Devroye, L.: Non-Uniform Random Variate Generation. Springer, New York (1986)
Erdős, P., Rényi, A.: On Random Graphs I in Publ. Math. Debrecen 6, 290–297 (1959)
Furtado, V., Ayres, L., de Oliveira, M., Vasconcelos, E., Caminha, C., D’Orleans, J.: Collective In telligence in Law Enforcement: The WikiCrimes System. Information Science 180 (2010)
Gatterbauer, W.: Rules of Thumb for Information Acquisition from Large and Redundant Data. In: Clough, P., Foley, C., Gurrin, C., Jones, G.J.F., Kraaij, W., Lee, H., Mudoch, V. (eds.) ECIR 2011. LNCS, vol. 6611, pp. 479–490. Springer, Heidelberg (2011)
McLafferty, S.: Identification, development and implementation of innovative crime mapping techniques and spatial analysis, p. 27. U.S. Department of Justice, Washington, D.C (2000)
Melo, A.: Um modelo multiagente de simulação criminal bio-inspirado. Dissertação de mestra do, Mestrado em Informática Aplicada. In: UNIFOR (2008)
Pickering, G., Bull, J.M., Sanderson, D.J.: Sampling Power-law Distributions. Tectonophysics 248, 1–20 (1995)
Semaan, G.S., Brito, J.A.M., Ochi, L.S.: Um algoritmo evolutivo híbrido aplicado ao problema de clusterização em grafos com restrições de capacidade e contiguidade. In: Anais do IX Congresso Brasileiro de Redes Neurais e Inteligência Computacional (IX CBRN), Ouro Preto/MG (2009)
Stumpf, M., Wiuf, C., May, R.: Subnets of scale-free networks are not scale-free: Sampling properties of networks. PNAS,102 (March 22, 2005)
Tavares-Pereira, F., Figueira, J.R., Mousseau, V., Roy, B.: Multiple criteria districting problems: The public transportation network pricing system of the Paris region. Annals of Operations Research 154(1), 69–92 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Palheta, R., Furtado, V. (2013). A Genetic Algorithm to Partition Weighted Planar Graphs in Which the Weight of Nodes Follows a Power Law. In: Menezes, R., Evsukoff, A., González, M. (eds) Complex Networks. Studies in Computational Intelligence, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30287-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-30287-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30286-2
Online ISBN: 978-3-642-30287-9
eBook Packages: EngineeringEngineering (R0)