A continuous-time N -interaction random graph model

DOI10.1080/17442508.2023.2281585MaRDI QIDQ6647799zbMATH OpenFDO

Authors Bettina Porvázsnyik

Publication date 3 December 2024

Published in Stochastics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17442508.2023.2281585

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85)

Recommendations

• Limit theorems for the weights and the degrees in an N-interactions random graph model
• Continuous-time independent edge-Markovian random graph process
• A random graph model based on 3-interactions
• scientific article; zbMATH DE number 3173143
• Weights of cliques in a random graph model based on three-interactions

Cites work

• A general model of web graphs
• A random graph model based on 3-interactions
• A random graph model driven by time-dependent branching dynamics
• Branching Processes
• Emergence of Scaling in Random Networks
• Growth of preferential attachment random graphs via continuous-time branching processes
• scientific article; zbMATH DE number 3555176 (Why is no real title available?)
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• On the convergence of supercritical general (C-M-J) branching processes
• Random graph dynamics
• Random graphs and complex networks. Volume 1
• Random trees and general branching processes
• Scale-free property for degrees and weights in an \(N\)-interactions random graph model
• Some typical properties of the spatial preferred attachment model
• Spatial preferential attachment networks: power laws and clustering coefficients
• The \(N\)-star network evolution model

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)