Walk based Laplacians for modeling diffusion on complex networks
From MaRDI portal
Cites work
- A Theorem on Boolean Matrices
- A Theory for Backtrack-Downweighted Walks
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Algorithm 919: A Krylov subspace algorithm for evaluating the -functions appearing in exponential integrators
- Computing the action of the matrix exponential, with an application to exponential integrators
- Discrete maximum principle for finite-difference operators
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Estimating the trace of matrix functions with application to complex networks
- Exponential integrators
- Functions of Matrices
- Functions Preserving Nonnegativity of Matrices
- scientific article; zbMATH DE number 3150488 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3335806 (Why is no real title available?)
- Matrix functions preserving sets of generalized nonnegative matrices
- Mittag-Leffler functions and their applications in network science
- Multigrid smoothers for ultraparallel computing
- Network properties revealed through matrix functions
- Non-backtracking walk centrality for directed networks
- Non-local network dynamics via fractional graph Laplacians
- Nonlocal pagerank
- On the exponential generating function for non-backtracking walks
- On the limiting behavior of parameter-dependent network centrality measures
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
- Random multi-hopper model: super-fast random walks on graphs
- Random walks and diffusion on networks
- Randomized numerical linear algebra: Foundations and algorithms
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Rational Krylov methods for fractional diffusion problems on graphs
- The AAA algorithm for rational approximation
- The Block Rational Arnoldi Method
- The deformed consensus protocol
- The deformed graph Laplacian and its applications to network centrality analysis
- The scaling and modified squaring method for matrix functions related to the exponential
- The University of Florida sparse matrix collection
- Time and space generalized diffusion equation on graph/networks
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
- Zeta functions of finite graphs and coverings
This page was built for publication: Walk based Laplacians for modeling diffusion on complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7327235)
