On efficient randomized algorithms for finding the PageRank vector (Q2354453): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5491464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2920268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization-based solution of the PageRank problem for large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using PageRank to Characterize Web Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forest matrices around the Laplacian matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational methods of linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff-type bound for finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacians and the Cheeger inequality for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Markov chain Monte Carlo revolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature, concentration and error estimates for Markov chain Monte Carlo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Aspects of Mixing Times in Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and stochastic stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric estimation. Finite sample theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of a randomized mirror descent algorithm in online optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive aggregation of estimators by the mirror descent algorithm with averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872459 / rank
 
Normal rank

Latest revision as of 11:53, 10 July 2024

scientific article
Language Label Description Also known as
English
On efficient randomized algorithms for finding the PageRank vector
scientific article

    Statements

    On efficient randomized algorithms for finding the PageRank vector (English)
    0 references
    0 references
    0 references
    13 July 2015
    0 references
    mirror descent method
    0 references
    Markov chain Monte Carlo
    0 references
    stochastic optimization
    0 references
    randomization
    0 references
    PageRank
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references