A random graph model for massive graphs
From MaRDI portal
Publication:3191983
DOI10.1145/335305.335326zbMath1296.05172OpenAlexW2097147952MaRDI QIDQ3191983
Linyuan Lu, Fan R. K. Chung, William Aiello
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.5527
Related Items
Scalable estimation of epidemic thresholds via node sampling, Scalable percolation search on complex networks, Social network influence and market instability, The scaling window for a random graph with a given degree sequence, Robustness of power-law networks: its assessment and optimization, Triangle counting in dynamic graph streams, The degree distribution of the generalized duplication model, Random walks and local cuts in graphs, The power grid as a complex network: a survey, Approximability of the vertex cover problem in power-law graphs, Motifs, coherent configurations and second order network generation, On non-progressive spread of influence through social networks, The iterative independent model, From Pareto to Weibull – A Constructive Review of Distributions on ℝ+, On the mixing time of geographical threshold graphs, On limit behavior of maximum vertex degree in a conditional configuration graph near critical points, A dynamic topological sort algorithm for directed acyclic graphs, Analysis and control of epidemics in temporal networks with self-excitement and behavioral changes, Scalable influence maximization for independent cascade model in large-scale social networks, Greed is good for deterministic scale-free networks, 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, The three kinds of degree distributions and nash equilibrium on the limiting random network, Inapproximability of dominating set on power law graphs, A Random Graph Model for Power Law Graphs, Minimum Expected *-Cast Time in DTNs, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, A Geometric Preferential Attachment Model of Networks II, How to determine if a random graph with a fixed degree sequence has a giant component, Statistical physics of vaccination, Synchronization in random networks with given expected degree sequences, De-anonymization of heterogeneous random graphs in quasilinear time, On positive-influence target-domination, On the hardness of optimization in power-law graphs, Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem, Shortest-path queries in static networks, The diameter of sparse random graphs, Modeling generation of the router-level topology of an ISP network, On the approximability of positive influence dominating set in social networks, A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices, Quasi‐random graphs with given degree sequences, Using shortcut edges to maximize the number of triangles in graphs, Cliques in hyperbolic random graphs, On a conditionally Poissonian graph process, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), A scale-free graph model based on bipartite graphs, Energy efficient randomised communication in unknown AdHoc networks, Measuring the flow of information among cities using the diffusion power, Growth network models with random number of attached links, The Kronecker-clique model for higher-order clustering coefficients, Parameterized clique on inhomogeneous random graphs, Percolation on Random Graphs with a Fixed Degree Sequence, Distance realization problems with applications to internet tomography, The diameter of sparse random graphs
