469
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Even order uniform hypergraph via the Einstein product

& ORCID Icon
Pages 159-167 | Received 30 May 2023, Accepted 08 Jul 2023, Published online: 25 Jul 2023

References

  • Asadi, M. M., Khosravi, M., Aghdam, A. G., Blouin, S. (2016). “Generalized Algebraic Connectivity for Asymmetric Networks. In: 2016 American Control Conference (ACC), pp. 5531–5536.
  • Ausiello, G., Laura, L. (2016). Directed hypergraphs: Introduction and fundamental algorithms—a survey. Theor. Comput. Sci. 658: 293–306.
  • Bapat, R. B. (2010). Graphs and Matrices, Vol. 27. London: Springer.
  • Barik, S., Pati, S. (2005). On algebraic connectivity and spectral integral variations of graphs. Linear Algebra Appl. 397(2): 209–222.
  • Berman, A., Plemmons, R. J. (1994). Nonnegative Matrices in the Mathematical Sciences. Philadelphia, PA: Society for Industrial and Applied Mathematics.
  • Brazell, M., Li, N., Navasca, C., Tamon, C. (2013). Solving multilinear systems via tensor inversion. SIAM J. Matrix Anal. Appl. 34(2): 542–570.
  • Chang, J., Chen, Y., Qi, L. (2016). Computing eigenvalues of large scale sparse tensors arising from a hypergraph. SIAM J. Sci. Comput. 38(6): A3618–A3643.
  • Chang, J., Chen, Y., Qi, L., Yan, H. (2020). Hypergraph clustering using a new laplacian tensor with applications in image processing. SIAM J. Imaging Sci. 13(3): 1157–1178.
  • Chang, S. Y., Wei, Y. (2022). General tail bounds for random tensors summation: majorization approach. J. Comput. Appl. Math. 416: 114533.
  • Chang, S. Y., Wei, Y. (2022). Sherman-Morrison-Woodbury identity for tensors. Pac. J. Optim. 18(1): 27–53.
  • Chen, C., Surana, A., Bloch, A. M., Rajapakse, I. (2021). Controllability of hypergraphs. IEEE Trans. Netw. Sci. Eng. 8(2): 1646–1657.
  • Chen, C., Rajapakse, I. (2020). Tensor entropy for uniform hypergraphs. IEEE Trans. Netw. Sci. Eng. 7(4): 2889–2900.
  • Che, M., Wei, Y. (2020). Theory and Computation of Complex Tensors and its Applications. Singapore: Springer.
  • Chowdhury, S., Needham, T, Semrad, E., Wang, B., Zhou, Y. (2021). Hypergraph co-optimal transport: Metric and categorical properties. arXiv preprint arXiv:2112.03904.
  • Cooper, J., Dutle, A. (2012). Spectra of uniform hypergraphs. Linear Algebra Appl. 436(9): 3268–3292.
  • Ding, W., Qi, L., Wei, Y. (2013). M-tensors and nonsingular M-tensors. Linear Algebra Appl. 439(10): 3264–3278.
  • Ding, W., Wei, Y. (2015). Generalized tensor eigenvalue problems. SIAM J. Matrix Anal. Appl. 36(3): 1073–1099.
  • Ding, W., Qi, L., Wei, Y. (2013). M-tensors and nonsingular M-tensors. Linear Algebra Appl. 439(10): 3264–3278.
  • Ding, W., Wei, Y. (2016). Solving multi-linear systems with M M-tensors. J. Sci. Comput. 68(2): 689–715.
  • Einstein, A. (1916). Die grundlage der allgemeinen relativitätstheorie. Ann. Phys. 49: 769–822.
  • Feng, K., Li, W.-C. W. (1996). Spectra of hypergraphs and applications. J. Number Theory 60(1): 1–22.
  • Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Math. J. 23(98): 298–305.
  • Gallo, G., Longo, G., Pallottino, S., Nguyen, S. (1993). Directed hypergraphs and applications. Discrete Appl. Math. 42(2–3): 177–201.
  • Hu, S., Qi, L. (2012). Algebraic connectivity of an even uniform hypergraph. J. Comb. Optim. 24(4): 564–579.
  • Ji, J., Wei, Y. (2018). The Drazin inverse of an even-order tensor and its application to singular tensor equations. Comput. Math. Appl. 75(9): 3402–3413.
  • Li, G., Qi, L., Yu, G. (2013). The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory. Numerical Linear Algebra Appl. 20(6): 1001–1029.
  • Liu, T., Wei, Y. (2022). The abstract Laplacian tensor of a hypergraph with applications in clustering. J. Sci. Comput. 93(1): Article 7.
  • Miao, Y., Qi, L., Wei, Y. (2020). Generalized tensor function via the tensor singular value decomposition based on the T-product. Linear Algebra Appl. 590: 258–303.
  • Miao, Y., Qi, L., Wei, Y. (2021). T-Jordan canonical form and T-Drazin inverse based on the T-product. Commun. Appl. Math. Comput. 3(2): 201–220.
  • Miao, Y., Wei, Y., Chen, Z. (2022). Fourth-order tensor Riccati equations with the Einstein product. Linear Multilinear Algebra 70(10): 1831–1853.
  • Mo, C., Wang, X., Wei, Y. (2020). Time-varying generalized tensor eigenanalysis via Zhang neural networks. Neurocomputing 407: 465–479.
  • Qi, L. (2014). H +-eigenvalues of laplacian and signless laplacian tensors. Commun. Math. Sci. 12(6): 1045–1064.
  • Qi, L., Luo, Z. (2017). Tensor Analysis: Spectral Theory and Special Tensors. Philadelphia, PA: Society for Industrial and Applied Mathematics.
  • Qi, L., J.-Y. Shao, Wang, Q. (2014). Regular uniform hypergraphs, s-cycles, s-paths and their largest Laplacian H-eigenvalues. Linear Algebra Appl. 443: 215–227.
  • Rota Bulò, S., Pelillo, M. (2013). A game-theoretic framework for similarity-based data clustering. IEEE Trans Pattern Anal. Mach. Intell. 35: 1312–1327.
  • Rota Bulò, S., Pelillo, M. (2009). A generalization of the Motzkin–Straus theorem to hypergraphs. Optim. Lett. 3(2): 287–295.
  • Rothblum, U. G. (1975). Algebraic eigenspaces of nonnegative matrices. Linear Algebra Appl. 12(3): 281–292.
  • Schneider, H. (1984). Theorems on M-splittings of a singular M-matrix which depend on graph structure. Linear Algebra Appl. 58: 407–424.
  • Sun, L., Zheng, B., Bu, C., Wei, Y. (2016). Moore–Penrose inverse of tensors via Einstein product. Linear Multilinear Algebra 64(4): 686–698.
  • Tudisco, F., Higham, D. J. (2022). Core-periphery detection in hypergraphs. SIAM J. Math. Data Science 5(2023): 1–21.
  • Volpentesta, A. P. 2008. Hypernetworks in a directed hypergraph. Eur. J. Oper. Res. 188(2): 390–405.
  • Wan, J.-C., Wang, Y., Hu, F.-T. (2022). Spectra of weighted uniform hypertrees. Electron. J. Comb. 29(2): P2–40.
  • Wang, X., Mo, C., Qiao, S., Wei, Y. (2022). Predefined-time convergent neural networks for solving the time-varying nonsingular multi-linear tensor equations. Neurocomputing 472: 68–84.
  • Wang, X., Che, M., Mo, C., Wei, Y. (2023). Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method. J. Comput. Appl. Math. 421: 114856.
  • Wang, X., Che, M., Wei, Y. (2020). Neural network approach for solving nonsingular multi-linear tensor systems. J. Comput. Appl. Math. 368: 112569.
  • Wang, X., Che, M., Wei, Y. (2022). Randomized Kaczmarz methods for tensor complementarity problems. Comput. Optim. Appl. 82(3): 595–615.
  • Wang, Y., Wei, Y. (2022). Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems. Comput. Appl. Math. 41(2022): Paper No. 419.
  • Wei, Y., Ding, W. (2016). Theory and Computation of Tensors: Multi-Dimensional Arrays. New York: Academic Press.
  • Wu, C. W. 2005. Algebraic connectivity of directed graphs. Linear Multilinear Algebra 53(3): 203–223.
  • Xie, J., Qi, L. (2016). Spectral directed hypergraph theory via tensors. Linear Multilinear Algebra 64(4): 780–794.
  • Xie, J., Chang, A. (2013). On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs. Linear Algebra Appl. 439(8): 2195–2204.