Multi-linear pseudo-PageRank for hypergraph partitioning
DOI10.1007/s10915-024-02460-1arXiv2306.10495OpenAlexW4392167272MaRDI QIDQ6123354
Wen Li, Jingya Chang, Yannan Chen
Publication date: 4 March 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.10495
convergencehypergraphexistenceuniquenessperturbation analysisnetwork analysissplitting algorithmPageRankLaplacian tensorhypergraph partitioningmulti-linear system
Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Unnamed Item
- Spectra of uniform hypergraphs
- A note on certain ergodicity coefficients
- Some bounds for the spectral radius of nonnegative tensors
- Laplacians and the Cheeger inequality for directed graphs
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Non-backtracking PageRank
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- PageRank Beyond the Web
- The perturbation bound for the Perron vector of a transition probability tensor
- Empirical Analysis of an Evolving Social Network
- Perron-based algorithms for the multilinear PageRank
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- Multilinear PageRank
- PageRank Computation, with Special Attention to Dangling Nodes
- Using PageRank to Locally Partition a Graph
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- The uniqueness of multilinear PageRank vectors
- Three Hypergraph Eigenvector Centralities
- Convergence of the fixed‐point iteration for multilinear PageRank
- Ergodicity Coefficients for Higher-Order Stochastic Processes
- A continuum limit for the PageRank algorithm
- Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- Extrapolation methods for fixed‐point multilinear PageRank computations
- Tensor Analysis
- On the limiting probability distribution of a transition probability tensor
- Local Partitioning for Directed Graphs Using PageRank
- A Reordering for the PageRank Problem
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
This page was built for publication: Multi-linear pseudo-PageRank for hypergraph partitioning
