A random graph model for massive graphs
From MaRDI portal
Recommendations
Cited in
(61)- A scale-free graph model based on bipartite graphs
- Energy efficient randomised communication in unknown AdHoc networks
- Distance realization problems with applications to internet tomography
- The power grid as a complex network: a survey
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- De-anonymization of heterogeneous random graphs in quasilinear time
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Using shortcut edges to maximize the number of triangles in graphs
- Scalable influence maximization for independent cascade model in large-scale social networks
- On the approximability of positive influence dominating set in social networks
- Growth network models with random number of attached links
- The Kronecker-clique model for higher-order clustering coefficients
- Scalable estimation of epidemic thresholds via node sampling
- Analysis and control of epidemics in temporal networks with self-excitement and behavioral changes
- Greed is good for deterministic scale-free networks
- A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
- Parameterized clique on inhomogeneous random graphs
- Scalable percolation search on complex networks
- Synchronization in random networks with given expected degree sequences
- On the hardness of optimization in power-law graphs
- Motifs, coherent configurations and second order network generation
- A Random Graph Model for Power Law Graphs
- The scaling window for a random graph with a given degree sequence
- Minimum expected \(^*\)-cast time in DTNs
- Robustness of power-law networks: its assessment and optimization
- A dynamic topological sort algorithm for directed acyclic graphs
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Approximability of the vertex cover problem in power-law graphs
- On non-progressive spread of influence through social networks
- On the mixing time of geographical threshold graphs
- scientific article; zbMATH DE number 1985299 (Why is no real title available?)
- New techniques for approximating optimal substructure problems in power-law graphs
- Conflict and error prevention and detection in complex networks
- A review of power laws in real life phenomena
- Inapproximability of dominating set on power law graphs
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
- Percolation on random graphs with a fixed degree sequence
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- The three kinds of degree distributions and Nash equilibrium on the limiting random network
- Shortest-path queries in static networks
- From heavy-tailed Boolean models to scale-free Gilbert graphs
- Statistical physics of vaccination
- On positive-influence target-domination
- The diameter of sparse random graphs
- Quasi‐random graphs with given degree sequences
- A Geometric Preferential Attachment Model of Networks II
- On a conditionally Poissonian graph process
- The diameter of sparse random graphs
- The iterative independent model
- From Pareto to Weibull – A Constructive Review of Distributions on ℝ+
- Large random matching markets with localized preference structures can exhibit large cores
- How to determine if a random graph with a fixed degree sequence has a giant component
- Testing for the network small-world property
- Degree-preserving graph dynamics: a versatile process to construct random networks
- Modeling generation of the router-level topology of an ISP network
- Cliques in hyperbolic random graphs
- A denoising diffusion adaptive search for the -domination problem on social graphs
- Measuring the flow of information among cities using the diffusion power
- Social network influence and market instability
- The degree distribution of the generalized duplication model
- Random walks and local cuts in graphs
This page was built for publication: A random graph model for massive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191983)
