Block gauss and anti-gauss quadrature with application to networks

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 4, 2013, Pages 1655-1684

  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

Adjacency matrix; Anti Gauss quadrature; Block Lanczos algorithm; Gauss quadrature; Graph; Network analysis; Nonsymmetric block Lanczos algorithm

Indexed keywords

ADJACENCY MATRICES; ANTI-GAUSS QUADRATURES; BLOCK LANCZOS ALGORITHM; GAUSS QUADRATURES; GRAPH;

ALGORITHMS; ELECTRIC NETWORK ANALYSIS;

GAUSSIAN DISTRIBUTION;

EID: 84892390883     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/120886261     Document Type: Article

References (49)

1. Alex Arena's data sets, http://deim.urv.cat/aarenas/data/welcome.htm.
2. Z. Bai, D. Day, and Q. Ye, ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1060-1082.
3. Z. Bai, M. Fahey, and G. Golub, Some large-scale matrix computation problems, J. Comput. Appl. Math., 74 (1996), pp. 71-89.
4. V. Batagelj and A. Mrvar, Pajek data sets, 2006; available online at http://vlado.fmf.unilj. si/pub/networks/data/.
5. M. Benzi and P. Boito, Quadrature rule-based bounds for functions of adjacency matrices, Linear Algebra Appl., 433 (2010), pp. 637-652.
6. M. Benzi, E. Estrada, and C. Klymko, Ranking hubs and authorities using matrix functions, Linear Algebra Appl., 438 (2013), pp. 2447-2474.
7. M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT, 39 (1999), pp. 417-438.
8. 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.
9. Biological Networks Data Sets of Newcastle University, http://www.biological-networks.org/.
10. F. Bonchi, P. Esfandiar, D. F. Gleich, C. Greif, and L. V. S. Lakshmanan, Fast matrix computations for pairwise and columnwise commute times and Katz scores, Internet Math., 8 (2012), pp. 73-112.
11. A. Bouhamidi, K. Jbilou, L. Reichel, and H. Sadok, A generalized global Arnoldi method for ill-posed matrix equations, J. Comput. Appl. Math., 236 (2012), pp. 2078-2089.
12. C. Brezinski and M. Redivo Zaglia, Rational extrapolation for the PageRank vector, Math. Comp., 77 (2008), pp. 1585-1598.
13. C. Brezinski, M. Redivo Zaglia, and H. Sadok, New look-ahead Lanczos-type algorithms for linear systems, Numer. Math., 83 (1999), pp. 53-85.
14. D. Calvetti, P. C. Hansen, and L. Reichel, L-curve curvature bounds via Lanczos bidiagonalization, Electron. Trans. Numer. Anal., 14 (2002), pp. 20-35.
15. D. Calvetti, L. Reichel, and F. Sgallari, Application of anti-Gauss quadrature rules in linear algebra, in Applications and Computation of Orthogonal Polynomials, W. Gautschi, G. H. Golub, and G. Opfer, eds., Birkhauser, Basel, 1999, pp. 41-56.
16. J. J. Croft, E. Estrada, D. J. Higham, and A. Taylor, Mapping directed networks, Electron. Trans. Numer. Anal., 37 (2010), pp. 337-350.
17. J. Duch and A. Arenas, Community identification using extremal optimization, Phys. Rev. E, 72 (2005), 027104.
18. A. J. Duran and P. Lopez-Rodriguez, Orthogonal matrix polynomials: Zeros and Blumenthal's theorem, J. Approx. Theory, 84 (1996), pp. 96-118.
19. E. Estrada and N. Hatano, Communicability in complex networks, Phys. Rev. E, 77 (2008), 036111.
20. E. Estrada, N. Hatano, and M. Benzi, The physics of communicability in complex networks, Phys. Rep., 514 (2012), pp. 89-119.
21. E. Estrada and D. J. Higham, Network properties revealed through matrix functions, SIAM Rev., 52 (2010), pp. 696-714.
22. E. Estrada, D. J. Higham, and N. Hatano, Communicability betweenness in complex networks, Phys. A, 388 (2009), pp. 764-774.
23. E. Estrada and J. A. Rodŕguez-Veaquez, Subgraph centrality in complex networks, Phys. Rev. E, 71 (2005), 056103.
24. E. Estrada and J. A. Rodŕguez-Veaquez, Subgraph centrality and clustering in complex hyper-networks, Phys. A, 364 (2006), pp. 581-594.
25. C. Fenu, D. Martin, L. Reichel, and G. Rodriguez, Network analysis via partial spectral factorization and Gauss quadrature, SIAM J. Sci. Comput., 35 (2013), pp. A2046-A2068.
26. 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.
27. Gephi Sample Data Sets, http://wiki.gephi.org/index.php/Datasets.
28. G. H. Golub and G. Meurant, Matrices, moments and quadrature, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Longman, Harlow, UK, 1994, pp. 105-156.
29. G. H. Golub and G. Meurant, Matrices, Moments and Quadrature with Applications, Princeton University Press, Princeton, 2010.
30. G. H. Golub and U. von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
31. G. H. Golub and U. von Matt, Generalized cross-validation for large-scale problems, J. Comput. Graph. Statist., 6 (1997), pp. 1-34.
32. R. Guimer̀a, L. Danon, A. D́az-Guilera, F. Giralt, and A. Arenas, Self-similar community structure in a network of human interactions, Phys. Rev. E, 68 (2003), 065103(R).
33. V. E. Henson and G. Sanders, Locally supported eigenvectors and matrices associated with connected and unweighted power-law graphs, Electron. Trans. Numer. Anal., 39 (2012), pp. 353-378.
34. N. J. Higham, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, 2008.
35. H. Jeong, S. Mason, A.-L. Barab'asi, and Z. N. Oltvai, Lethality and centrality of protein networks, Nature, 411 (2001), pp. 41-42.
36. J. V. Lambers, Enhancement of Krylov subspace spectral methods by block Lanczos iteration, Electron. Trans. Numer. Anal., 31 (2008), pp. 86-109.
37. D. P. Laurie, Anti-Gaussian quadrature formulas, Math. Comp., 65 (1996), pp. 739-747.
38. G. opez Lagomasino, L. Reichel, and L. Wunderlich, Matrices, moments, and rational quadrature, Linear Algebra Appl., 429 (2008), pp. 2540-2554.
39. J. Marcelino and M. Kaiser, Critical paths in a metapopulation model of H1N1: Efficiently delaying influenza spreading through flight cancellation, PLoS Currents Influenza, arXiv:1205.3245, 2012.
40. The Max Plank Institute for Software Systems web site, http://socialnetworks.mpi-sws.org/data-wosn2009.html.
41. Lev Muchnik's Data Sets web page, http://www.levmuchnik.net/Content/ Networks/NetworkData.html.
42. M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA, 98 (2001), pp. 404-409.
43. Mark Newman's web page, http://www-personal.umich.edu/mejn/netdata/.
44. L. Reichel, G. Rodriguez, and S. Seatzu, Error estimates for large-scale ill-posed problems, Numer. Algorithms, 51 (2009), pp. 341-361.
45. A. Sinap and W. Van Assche, Polynomial interpolation and Gaussian quadrature for matrixvalued functions, Linear Algebra Appl., 207 (1994), pp. 71-114.
46. S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen, Topological structure analysis of the proteinprotein interaction network in budding yeast, Nucleic Acids Research, 31 (2003), pp. 2443-2450.
47. The University of Florida Sparse Matrix Collection, http://www.cise.ufl. edu/research/sparse/matrices/.
48. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, On the evolution of user interaction in Facebook, in Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), Barcelona, Spain, 2009, pp. 37-42.
49. D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, 393 (1998), pp. 440-442.