Voter models on subcritical scale‐free random graphs-Reference-Cited by-同舟云学术

Voter models on subcritical scale‐free random graphs

Published:2022-07-23 Issue:2 Volume:62 Page:376-429
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Algorithms

Author:

Fernley John¹,Ortgiese Marcel²

Affiliation:

1. École Normale Supérieure de Lyon Unité de Mathématiques Pures et Appliquées Lyon France

2. Department of Mathematical Sciences University of Bath Claverton Down Bath UK

Funder

Society for Ambulatory Anesthesia

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21107

Reference28 articles.

1. Cover time of a random graph with given degree sequence

2. Probability Approximations via the Poisson Clumping Heuristic

3. D.AldousandJ. A.Fill Reversible Markov chains and random walks on graphs 2002 Unfinished monograph recompiled 2014.http://www.stat.berkeley.edu/∼aldous/RWG/book.html.

4. The mixing time of the giant component of a random graph

5. Random walks on the random graph

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cover and hitting times of hyperbolic random graphs;Random Structures & Algorithms;2024-07-26

2. Discursive Voter Models on the Supercritical Scale-Free Network;SIAM Journal on Discrete Mathematics;2024-04-16

3. Discordant edges for the voter model on regular random graphs;Latin American Journal of Probability and Mathematical Statistics;2024

4. The Evolution of Pluralistic Ignorance;2024