Voter models on subcritical scale‐free random graphs (Q6074869): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/rsa.21107 / 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: Probability approximations via the Poisson clumping heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing time of the giant component of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of densities of finite voter models to the Wright-Fisher diffusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5489870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discordant Voting Processes on Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anatomy of the giant component: the strictly supercritical regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time to Stationarity for a Continuous-Time Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability: A Graduate Course / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest component in a subcritical random graph with a power law degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condensation in nongeneric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics on and of complex networks. Volume 2. Applications to time-varying dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conditionally Poissonian graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coalescence time of reversible random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean field conditions for coalescing random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and mixing times for reversible chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/RSA.21107 / rank
 
Normal rank

Latest revision as of 18:12, 30 December 2024

scientific article; zbMATH DE number 7752403
Language Label Description Also known as
English
Voter models on subcritical scale‐free random graphs
scientific article; zbMATH DE number 7752403

    Statements

    Voter models on subcritical scale‐free random graphs (English)
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    inhomogeneous random graphs
    0 references
    interacting particle systems
    0 references
    random walks on random graphs
    0 references
    scale-free networks
    0 references
    voter model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references