Network analysis via partial spectral factorization and gauss quadrature

SIAM Journal on Scientific Computing

Volumn 35, Issue 4, 2013, Pages

  Fenu, C ^a   Martin, D ^b   Reichel, L ^b   Rodriguez, G ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Complex networks; Gauss quadrature; Lanczos process; Low rank approximation; Software networks

Indexed keywords

APPLICATION PROGRAMS; APPROXIMATION THEORY; COMPLEX NETWORKS; EXPONENTIAL FUNCTIONS; FUNCTION EVALUATION; GAUSSIAN DISTRIBUTION;

ADJACENCY MATRIX; GAUSS QUADRATURES; LANCZOS PROCESS; LARGE-SCALE NETWORK; LOW RANK APPROXIMATIONS; NONLINEAR FUNCTIONS; NOVEL TECHNIQUES; SOFTWARE NETWORK; SPECTRAL FACTORIZATIONS; UPPER AND LOWER BOUNDS;

VECTORS;

EID: 84886805038     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/130911123     Document Type: Article

References (33)

1. J. Baglama, D. Calvetti, and L. Reichel, IRBL: An implicitly restarted block-Lanczos method for large-scale Hermitian eigenproblems, SIAM J. Sci. Comput., 24 (2003), pp. 1650-1677.
2. J. Baglama, D. Calvetti, and L. Reichel, Algorithm 827: irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix, ACM Trans. Math. Software, 29 (2003), pp. 337-348.
3. V. Batagelj and A. Mrvar, Pajek datasets, http://vlado.fmf.uni-lj.si/pub/ networks/data/ (2006).
4. M. Benzi and P. Boito, Quadrature rule-based bounds for functions of adjacency matrices, Linear Algebra Appl., 433 (2010), pp. 637-652.
5. M. Benzi, E. Estrada, and C. Klymko, Ranking hubs and authorities using matrix functions, Linear Algebra Appl., 431 (2013), pp. 2447-2474.
6. D. A. Bini, G. M. Del Corso, and F. Romani, Evaluating scientific products by means of citation-based models: A first analysis and validation, Electron. Trans. Numer. Anal., 33 (2008), pp. 1-16.
7. D. Calvetti, G. H. Golub, and L. Reichel, Estimation of the L-curve via Lanczos bidiagonalization, BIT, 39 (1999), pp. 603-619.
8. G. Concas, M. Marchesi, A. Murgia, and R. Tonelli, An empirical study of social networks metrics in object oriented software, Adv. Software Eng., 2010 (2010), 729826.
9. G. Concas, M. Marchesi, A. Murgia, R. Tonelli, and I. Turnu, On the distribution of bugs in the Eclipse system, IEEE Trans. Software Eng., 37 (2011), pp. 872-877.
10. J. J. Croft, E. Estrada, D. J. Higham, and A. Taylor, Mapping directed networks, Electron. Trans. Numer. Anal., 37 (2010), pp. 337-350.
11. E. Estrada, The Structure of Complex Networks, Oxford University Press, Oxford, 2012.
12. E. Estrada, N. Hatano, and M. Benzi, The physics of communicability in complex networks, Phys. Rep., 514 (2012), pp. 89-119.
13. E. Estrada and D. J. Higham, Network properties revealed through matrix functions, SIAM Rev., 52 (2010), pp. 696-714.
14. E. Estrada and J. A. Rodríguez-Velázquez, Subgraph centrality in complex networks, Phys. Rev. E, 71 (2005), 056103.
15. E. Estrada and J. A. Rodríguez-Velázquez, Subgraph centrality and clustering in complex hyper-networks, Phys. A, 364 (2006), pp. 581-594.
16. C. Fenu, D. Martin, L. Reichel, and G. Rodriguez, Block Gauss and anti-Gauss quadrature with application to networks, SIAM J. Matrix Anal. Appl., to appear.
17. K. Gallivan, M. Heath, E. Ng, B. Peyton, R. Plemmons, J. Ortega, C. Romine, A. Sameh, and R. Voigt, Parallel Algorithms for Matrix Computations, SIAM, Philadelphia, 1990.
18. G. H. Golub, Some modified matrix eigenvalue problems, SIAM Rev., 15 (1973), pp. 318-334.
19. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Longman, Harlow, Essex, England, 1994, pp. 105-156.
20. G. H. Golub and G. Meurant, Matrices, Moments and Quadrature with Applications, Princeton University Press, Princeton, NJ, 2010.
21. G. H. Golub and Z. Strakoš, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241-268.
22. H. Jeong, S. Mason, A.-L. Barabási, and Z. N. Oltvai, Lethality and centrality of protein networks, Nature, 411 (2001), pp. 41-42.
23. R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK Users' Guide: Solution of Large- Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
24. G. López Lagomasino, L. Reichel, and L. Wunderlich, Matrices, moments, and rational quadrature, Linear Algebra Appl., 429 (2008), pp. 2540-2554.
25. Max Plank Institute for Software Systems, Online Social Networks Research, http:// socialnetworks.mpi-sws.org/data-wosn2009.html.
26. M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA, 98 (2001), pp. 404-409. (Pubitemid 32105053)
27. M. E. J. Newman, Networks: An Introduction, Oxford University Press, Oxford, 2010.
28. M. E. J. Newman, Network Data, http://www-personal.umich.edu/~mejn/ netdata/.
29. M. Penrose, Geometric Random Graphs, Oxford University Press, Oxford, 2003.
30. S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen, Topological structure analysis of the proteinprotein interaction network in budding yeast, Nucleic Acids Res., 31 (2003), pp. 2443-2450. (Pubitemid 37442113)
31. A. Taylor and D. J. Higham, CONTEST: A controllable test toolbox for MATLAB, ACM Trans. Math. Software, 35 (2009), pp. 1-17.
32. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, On the evolution of user interaction in Facebook, Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), Barcelona, Spain, 2009, ACM, New York, 2009, pp. 37-42.
33. D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, 393 (1998), pp. 440-442. (Pubitemid 28292183)