Pages that link to "Item:Q3191983"
From MaRDI portal
The following pages link to A random graph model for massive graphs (Q3191983):
Displayed 50 items.
- Robustness of power-law networks: its assessment and optimization (Q326464) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- On the mixing time of geographical threshold graphs (Q409397) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- Conflict and error prevention and detection in complex networks (Q445880) (← links)
- A review of power laws in real life phenomena (Q450333) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks (Q498452) (← links)
- Statistical physics of vaccination (Q521790) (← links)
- On positive-influence target-domination (Q526426) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- Modeling generation of the router-level topology of an ISP network (Q708834) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Measuring the flow of information among cities using the diffusion power (Q763787) (← links)
- Social network influence and market instability (Q845606) (← links)
- The degree distribution of the generalized duplication model (Q861264) (← links)
- Random walks and local cuts in graphs (Q876299) (← links)
- A scale-free graph model based on bipartite graphs (Q1026182) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- Distance realization problems with applications to internet tomography (Q1604199) (← links)
- The power grid as a complex network: a survey (Q1672969) (← links)
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points (Q1692737) (← links)
- De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- Scalable influence maximization for independent cascade model in large-scale social networks (Q1945007) (← links)
- On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
- Growth network models with random number of attached links (Q2069208) (← links)
- The Kronecker-clique model for higher-order clustering coefficients (Q2078699) (← links)
- Scalable estimation of epidemic thresholds via node sampling (Q2121712) (← links)
- Analysis and control of epidemics in temporal networks with self-excitement and behavioral changes (Q2198741) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices (Q2272497) (← links)
- Parameterized clique on inhomogeneous random graphs (Q2341758) (← links)
- Scalable percolation search on complex networks (Q2368965) (← links)
- Synchronization in random networks with given expected degree sequences (Q2477314) (← links)
- On the hardness of optimization in power-law graphs (Q2481967) (← links)
- Motifs, coherent configurations and second order network generation (Q2670211) (← links)
- A Random Graph Model for Power Law Graphs (Q2729376) (← links)
- The scaling window for a random graph with a given degree sequence (Q2909244) (← links)
- Minimum Expected *-Cast Time in DTNs (Q3006019) (← links)
- A dynamic topological sort algorithm for directed acyclic graphs (Q3507767) (← links)
- Percolation on Random Graphs with a Fixed Degree Sequence (Q5020830) (← links)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) (Q5090451) (← links)
- The three kinds of degree distributions and nash equilibrium on the limiting random network (Q5133909) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- The diameter of sparse random graphs (Q5433273) (← links)
- Quasi‐random graphs with given degree sequences (Q5436973) (← links)