Contact processes on scale-free networks
From MaRDI portal
Publication:1956510
DOI10.1007/s10114-010-7191-yzbMath1202.60153OpenAlexW2011315749MaRDI QIDQ1956510
Publication date: 22 September 2010
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-010-7191-y
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected components in random graphs with given expected degree sequences
- The diameter of a scale-free random graph
- Emergence of Scaling in Random Networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- A general model of web graphs
- The average distances in random graphs with given expected degrees