Ergodicity Coefficients for Higher-Order Stochastic Processes
DOI10.1137/19M1285214zbMath1483.60105arXiv1907.04841MaRDI QIDQ5037573
Francesco Tudisco, Dario Fasino
Publication date: 1 March 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04841
nonnegative tensorsvertex-reinforced random walk\(Z\)-eigenvectorergodicity coefficienthigher-order Markov chainmultilinear PageRankstochastic tensorsspacey random walk
Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solutions to stochastic differential and integral equations (65C30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of a second order Markov chain
- A note on certain ergodicity coefficients
- Perron-Frobenius theorem for nonnegative tensors
- D-eigenvalues of diffusion kurtosis tensors
- Non-negative matrices and Markov chains. 2nd ed
- Vertex-reinforced random walk
- Vertex-reinforced random walks and a conjecture of Pemantle
- Random walks and diffusion on networks
- Markov chains with memory, tensor formulation, and the dynamics of power iteration
- On the uniqueness of the positive Z-eigenvector for nonnegative tensors
- Fluctuations of the empirical measure of freezing Markov chains
- The mixture transition distribution model for high-order Markov chains and non-Gaussian time series
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Ergodicity of $p$-majorizing nonlinear Markov operators on the finite dimensional space
- Non-backtracking PageRank
- Stationary probability vectors of higher-order Markov chains
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Block Tensor Unfoldings
- Tensor decompositions for learning latent variable models
- The perturbation bound for the Perron vector of a transition probability tensor
- Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector
- Spectral redemption in clustering sparse networks
- Ergodicity Coefficients Defined by Vector Norms
- Perron-based algorithms for the multilinear PageRank
- Shifted Power Method for Computing Tensor Eigenpairs
- Extensions of Jentzsch's Theorem
- Multilinear PageRank
- Perturbation of the stationary distribution measured by ergodicity coefficients
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The uniqueness of multilinear PageRank vectors
- An elementary proof of the Birkhoff-Hopf theorem
- Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model
- Three Hypergraph Eigenvector Centralities
- A framework for second-order eigenvector centralities and clustering coefficients
- Extrapolation methods for fixed‐point multilinear PageRank computations
- The Perron--Frobenius Theorem for Multihomogeneous Mappings
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- The contractivity of cone-preserving multilinear mappings
- Tensor Analysis
- Most Tensor Problems Are NP-Hard
- On the limiting probability distribution of a transition probability tensor
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
