Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2015 (2015), Article ID 580361, 9 pages
http://dx.doi.org/10.1155/2015/580361
Research Article

Computing Assortative Mixing by Degree with the -Metric in Networks Using Linear Programming

1University of Amsterdam, Weesperplein 4, 1018 XA Amsterdam, Netherlands
2Tilburg University, Warandelaan 2, 5037 AB Tilburg, Netherlands

Received 13 May 2014; Accepted 8 February 2015

Academic Editor: Frank Werner

Copyright © 2015 Lourens J. Waldorp and Verena D. Schmittmann. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. E. J. Newman, “Assortative mixing in networks,” Physical Review Letters, vol. 89, no. 20, Article ID 208701, 2002. View at Google Scholar · View at Scopus
  2. P. van Mieghem, H. Wang, X. Ge, S. Tang, and F. A. Kuipers, “Influence of assortativity and degree-preserving rewiring on the spectra of networks,” The European Physical Journal B, vol. 76, no. 4, pp. 643–652, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. M. Piraveenan, M. Prokopenko, and A. Y. Zomaya, “Classifying complex networks using unbiased local assortativity,” in Proceedings of the Alife 12th Conference, pp. 329–336, Odense, Denmark, 2010.
  4. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. A. Barrat, M. Barthelemy, and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  6. D. Borsboom, A. O. J. Cramer, V. D. Schmittmann, S. Epskamp, and L. J. Waldorp, “The small world of psychopathology,” PLoS ONE, vol. 6, no. 11, Article ID e27407, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Li, D. Alderson, J. C. Doyle, and W. Willinger, “Towards a theory of scale-free graphs: definition, properties, and implications,” Internet Mathematics, vol. 2, no. 4, pp. 431–523, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  8. D. L. Alderson and L. Li, “Diversity of graphs with highly variable connectivity,” Physical Review E, vol. 75, no. 4, Article ID 046102, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  9. L. Li, D. Alderson, W. Willinger, and J. Doyle, “A first-principles approach to understanding the internet's router-level topology,” in Proceedings of the 2004 Conference On Applications, Technologies, Architectures, And Protocols For Computer Communications (SIGCOMM '04), pp. 3–14, ACM, Computer Communication Review, vol. 34, no. 4.
  10. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Chichester, UK, 1986. View at MathSciNet
  11. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1999. View at MathSciNet
  12. S. Boyd, The subtour polytope of the travelling salesman problem [Ph.D. thesis], University of Waterloo, 1986.
  13. M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees,” Operations Research, vol. 18, no. 6, pp. 1138–1162, 1970. View at Publisher · View at Google Scholar · View at MathSciNet
  14. M. Piraveenan, M. Prokopenko, and A. Y. Zomaya, “Local assortativity and growth of Internet,” European Physical Journal B—Condensed Matter and Complex Systems, vol. 70, no. 2, pp. 275–285, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. D. Bertsimas and J. Tsitsklis, Introduction to Linear Optimization, Athena Scientific and Dynamic Ideas, Belmont, Mass, USA, 1997.
  16. S. Krumke, Integer Programming, 2007.
  17. A. Schrijver, “Polyhedral proof methods in combinatorial optimization,” Discrete Applied Mathematics, vol. 14, no. 2, pp. 111–133, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  18. M. L. Fisher, “The lagrangian relaxation method for solving integer programming problems,” Management Science, vol. 50, no. 12, pp. 1861–1874, 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Boyd and P. Elliott-Magwood, “Structure of the extreme points of the subtour elimination problem of the stsp,” in Combinatorial Optimization and Discrete Algorithms, S. Iwata, Ed., pp. 33–47, 2010. View at Google Scholar · View at MathSciNet
  20. J. R. Magnus and H. Neudecker, Matrix Differential Calculus with Applications in Statistics and Econometrics, Wiley Series in Probability and Statistics, John Wiley & Sons, Chichester, UK, 1999. View at MathSciNet
  21. M. Held, P. Wolfe, and H. P. Crowder, “Validation of subgradient optimization,” Mathematical Programming, vol. 6, pp. 62–88, 1974. View at Publisher · View at Google Scholar · View at MathSciNet
  22. M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees. Part II,” Mathematical Programming, vol. 1, no. 1, pp. 6–25, 1971. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. R Development Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2012, http://www.R-project.org/.
  24. M. Berkelaar, K. Eikland, and P. Notebaert, lpsolve: Open Source (Mixedinteger) Linear Programming System, GNU Lesser General Public License, 2004.
  25. A. O. J. Cramer, L. J. Waldorp, H. L. J. van der Maas, and D. Borsboom, “Comorbidity: a network perspective,” Behavioral and Brain Sciences, vol. 33, no. 2-3, pp. 137–150, 2010. View at Publisher · View at Google Scholar · View at Scopus