Potential induced random teleportation on finite graphs (Q493692): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
CorrectionBot (talk | contribs)
Changed label, description and/or aliases in en, and other parts
 
(3 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6478552
Property / DOI
 
Property / DOI: 10.1007/s10589-015-9727-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Cover time of a random graph with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Network Data Analytics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric interpretation of the Metropolis-Hastings algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified logarithmic Sobolev inequalities in discrete settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs: ideas, techniques and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on weighted graphs and applications to on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deeper Inside PageRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3224016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walk: A Modern Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing versus Metropolis for a TSP instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of simulated annealing cooling strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of Markov Chain Monte Carlo Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of simulated annealing as a tool for single and multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4748912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partition and effective dynamics of complex networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-015-9727-7 / rank
 
Normal rank

Latest revision as of 09:04, 3 July 2025

scientific article; zbMATH DE number 6478552
Language Label Description Also known as
English
Potential induced random teleportation on finite graphs
scientific article; zbMATH DE number 6478552

    Statements

    Potential induced random teleportation on finite graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2015
    0 references
    random walk
    0 references
    random teleportation
    0 references
    potential
    0 references
    intermittent diffusion
    0 references
    Gibbs distribution
    0 references
    Metropolis-Hastings algorithm
    0 references
    finite graphs
    0 references

    Identifiers