Coupling Online and Offline Analyses for Random Power Law Graphs
From MaRDI portal
Recommendations
Cited in
(23)- Graph sampling for Internet topologies using normalized Laplacian spectral features
- Justifying the small-world phenomenon via random recursive trees
- Random networks with preferential growth and vertex death
- On the degree sequence of an evolving random graph process and its critical phenomenon
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Characterization of Graphs Using Degree Cores
- A generalization of the Buckley-Osthus model for web graphs
- Correlation between weighted spectral distribution and average path length in evolving networks
- Asymptotic degree distribution of a duplication-deletion random graph model
- The three kinds of degree distributions and Nash equilibrium on the limiting random network
- On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness
- Robustness of Preferential Attachment Under Deletion of Edges
- Phase transition on the degree sequence of a random graph process with vertex copying and deletion
- Stochastic resetting in a networked multiparticle system with correlated transitions
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Open problems in stochastic reinforcement models
- Generating complex networks through a vertex merging mechanism: empirical and analytical analysis
- An edge deletion model for complex networks
- Dynamic random graphs with vertex removal
- Preferential deletion in dynamic models of web-like networks
- Degree correlations in growing networks with deletion of nodes
- The diameter of protean graphs
- Diameters in preferential attachment models
This page was built for publication: Coupling Online and Offline Analyses for Random Power Law Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4672748)
