A continuous-time N -interaction random graph model
From MaRDI portal
Publication:6647799
DOI10.1080/17442508.2023.2281585MaRDI QIDQ6647799
Publication date: 3 December 2024
Published in: Stochastics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
- Growth of preferential attachment random graphs via continuous-time branching processes
- Spatial preferential attachment networks: power laws and clustering coefficients
- Random graphs and complex networks. Volume 1
- A random graph model based on 3-interactions
- Emergence of Scaling in Random Networks
- On the convergence of supercritical general (C-M-J) branching processes
- A general model of web graphs
- Some Typical Properties of the Spatial Preferred Attachment Model
- TheN-star network evolution model
- Branching Processes
- Random trees and general branching processes
This page was built for publication: A continuous-time N -interaction random graph model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647799)