Copertina

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Guidotti, Nicolas L., Acebrón, Juan A., Monteiro, José
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms 65C05, 68W20, 65F60, 05C90
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
di: Epperly, Ethan N.
Pubblicazione: (2025)

BOLT: Block-Orthonormal Lanczos for Trace estimation of matrix functions
di: Yeon, Kingsley, et al.
Pubblicazione: (2025)

Accelerating a restarted Krylov method for matrix functions with randomization
di: Guidotti, Nicolas L., et al.
Pubblicazione: (2025)

On some randomized algorithms and their evaluation
di: Yordzhev, Krasimir
Pubblicazione: (2024)

On the fast convergence of minibatch heavy ball momentum
di: Bollapragada, Raghu, et al.
Pubblicazione: (2022)

An asymptotically optimal algorithm for generating bin cardinalities
di: Devroye, Luc, et al.
Pubblicazione: (2024)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
di: Matti, Fabio, et al.
Pubblicazione: (2025)

A general framework for Krylov ODE residuals with applications to randomized Krylov methods
di: Krieger, Emil, et al.
Pubblicazione: (2025)

XTrace: Making the most of every sample in stochastic trace estimation
di: Epperly, Ethan N., et al.
Pubblicazione: (2023)

Two Variations on the XTrace Algorithm
di: Hallman, Eric
Pubblicazione: (2025)

Optimal non-adaptive algorithm for edge estimation
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)

Correcting the Foundational Analysis of Karp--Vazirani--Vazirani (STOC 1990): A Rigorous Revision of the $1-1/e$ Upper Bound
di: Xu, Pan
Pubblicazione: (2025)

Detecting when one probe vector is enough for preconditioned log-determinant approximation
di: Cortinovis, Alice, et al.
Pubblicazione: (2026)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
di: Persson, David, et al.
Pubblicazione: (2023)

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
di: Haxell, Penny, et al.
Pubblicazione: (2022)

FlexTrace: Exchangeable Randomized Trace Estimation for Matrix Functions
di: Madhavan, Madhusudan, et al.
Pubblicazione: (2026)

Optimal Krylov On Average
di: Luo, Qi, et al.
Pubblicazione: (2025)

Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
di: Ferreira, Inês, et al.
Pubblicazione: (2024)

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

Quenched large deviations for Monte Carlo integration with Coulomb gases
di: Bardenet, Rémi, et al.
Pubblicazione: (2025)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
di: Walwil, Iyad, et al.
Pubblicazione: (2025)

Ballistic Convergence in Hit-and-Run Monte Carlo and a Coordinate-free Randomized Kaczmarz Algorithm
di: Bou-Rabee, Nawaf, et al.
Pubblicazione: (2024)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
di: Persson, David, et al.
Pubblicazione: (2025)

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
di: Palitta, Davide, et al.
Pubblicazione: (2023)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
di: Yeon, Kingsley, et al.
Pubblicazione: (2025)

Sampling elements of a finite group: efficiency of the product replacement algorithm with an accumulator
di: Marcinkowski, Michał, et al.
Pubblicazione: (2025)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
di: He, Xin, et al.
Pubblicazione: (2026)

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
di: Chen, Guan-Yu, et al.
Pubblicazione: (2025)

Spectrum Estimation through Kirchhoff Random Forests
di: Barthelmé, Simon, et al.
Pubblicazione: (2025)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
di: Bauschke, Heinz H., et al.
Pubblicazione: (2025)

A high-order recombination algorithm for weak approximation of stochastic differential equations
di: Ninomiya, Syoiti, et al.
Pubblicazione: (2025)

A simple Path-based LP Relaxation for Directed Steiner Tree
di: Pashkovich, Kanstantsin, et al.
Pubblicazione: (2026)

High order weak approximation of Stochastic Differential Equations for bounded and measurable test functions
di: Rey, Clément
Pubblicazione: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

Large deviations of the greedy independent set algorithm on sparse random graphs
di: Kolesnik, Brett
Pubblicazione: (2020)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2026)

Acceleration and restart for the randomized Bregman-Kaczmarz method
di: Tondji, Lionel, et al.
Pubblicazione: (2023)

Zero-free regions of partition functions with applications to algorithms and graph limits
di: Regts, Guus
Pubblicazione: (2015)

Bayesian D-Optimal Experimental Designs via Column Subset Selection
di: Eswar, Srinivas, et al.
Pubblicazione: (2024)