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 QIDQ6489304
Juan A. Acebrón, José R. M. Monteiro, Unnamed Author
Publication date: 21 April 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Quadrature rule-based bounds for functions of adjacency matrices
- Probability essentials.
- Ranking hubs and authorities using matrix functions
- A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- A Monte Carlo method for computing the action of a matrix exponential on a vector
- Estimating the Estrada index
- A new status index derived from sociometric analysis
- Edge Modification Criteria for Enhancing the Communicability of Digraphs
- Convergence Analysis of Markov Chain Monte Carlo Linear Solvers Using Ulam--von Neumann Algorithm
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Network Properties Revealed through Matrix Functions
- Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- A New Scaling and Squaring Algorithm for the Matrix Exponential
- The Structure and Function of Complex Networks
- A Schur-Parlett Algorithm for Computing Matrix Functions
- Networks
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Mittag--Leffler Functions and their Applications in Network Science
- Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
- On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Collective dynamics of ‘small-world’ networks
- Analysis of Monte Carlo accelerated iterative methods for sparse linear systems
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Monte Carlo Methods for Applied Scientists
- Functions of Matrices
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Randomized numerical linear algebra: Foundations and algorithms
- Parallel resolvent Monte Carlo algorithms for linear algebra problems
- Limited‐memory polynomial methods for large‐scale matrix functions
- Randomized Sketching for Krylov Approximations of 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