Discursive voter models on the supercritical scale-free network
From MaRDI portal
Publication:6490282
Recommendations
Cites work
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- A model for spatial conflict
- An old approach to the giant component problem
- Anatomy of the giant component: the strictly supercritical regime
- Chernoff and Berry–Esséen inequalities for Markov processes
- Cover time of a random graph with given degree sequence
- Discordant Voting Processes on Finite Graphs
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mean field conditions for coalescing random walks
- On a conditionally Poissonian graph process
- On the convergence of densities of finite voter models to the Wright-Fisher diffusion
- Probability Inequalities for Sums of Bounded Random Variables
- Probability approximations via the Poisson clumping heuristic
- Random graphs and complex networks. Volume 1
- The diameter of sparse random graphs
- The evolution of the mixing rate of a simple random walk on the giant component of a random graph
- The mixing time of the giant component of a random graph
- The phase transition in inhomogeneous random graphs
- The probabilistic method
- Time to Stationarity for a Continuous-Time Markov Chain
- Voter models on subcritical scale‐free random graphs
This page was built for publication: Discursive voter models on the supercritical scale-free network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490282)