A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
From MaRDI portal
Publication:6489304
DOI10.1007/S10915-024-02500-WMaRDI QIDQ6489304FDOQ6489304
Authors: Juan A. Acebrón, José R. M. Monteiro 
Publication date: 21 April 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Recommendations
- A Monte Carlo method for computing the action of a matrix exponential on a vector
- A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Approximating spectral sums of large-scale matrices using stochastic Chebyshev approximations
- Estimating the trace of matrix functions with application to complex networks
Cites Work
- Title not available (Why is that?)
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Kronecker graphs: an approach to modeling networks
- Functions of Matrices
- Block Gauss and anti-Gauss quadrature with application to networks
- Network properties revealed through matrix functions
- The Structure and Function of Complex Networks
- A new status index derived from sociometric analysis
- Collective dynamics of `small-world' networks
- Estimating the Estrada index
- Title not available (Why is that?)
- Probability essentials.
- Title not available (Why is that?)
- Ranking hubs and authorities using matrix functions
- Computing the action of the matrix exponential, with an application to exponential integrators
- A Schur-Parlett Algorithm for Computing Matrix Functions
- Quadrature rule-based bounds for functions of adjacency matrices
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Monte Carlo Methods for Applied Scientists
- A new scaling and squaring algorithm for the matrix exponential
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Randomized numerical linear algebra: Foundations and algorithms
- On the limiting behavior of parameter-dependent network centrality measures
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- Convergence analysis of Markov chain Monte Carlo linear solvers using Ulam-von Neumann algorithm
- Networks
- Edge modification criteria for enhancing the communicability of digraphs
- Parallel resolvent Monte Carlo algorithms for linear algebra problems
- Analysis of Monte Carlo accelerated iterative methods for sparse linear systems.
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Mittag-Leffler functions and their applications in network science
- A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- A Monte Carlo method for computing the action of a matrix exponential on a vector
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Limited‐memory polynomial methods for large‐scale matrix functions
- Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization
- A stochastic method for solving time-fractional differential equations
This page was built for publication: A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489304)
