An Efficient and Scalable Algorithmic Method for Generating Large-Scale Random Graphs

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference for High Performance Computing, Networking, Storage and Analysis

• Publication date

  2016-11-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SC.2016.31
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Markov Graphs

  2018cited by this paper
• Multi-level anomaly detection on time-varying graph data

  2014cited by this paper
• Parallel Algorithms for Generating Random Networks with Given Degree Sequences

  2014influential reference
• A Scalable Generative Graph Model with Community Structure

  2013influential reference
• Defining and evaluating network communities based on ground-truth

  2012cited by this paper
• Community structure and scale-free collections of Erdös-Rényi graphs

  2011cited by this paper
• Constructing and sampling graphs with a prescribed joint degree distribution

  2011cited by this paper
• Efficient Generation of Networks with Given Expected Degrees

  2011cited by this paper
• The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models

  2011influential reference
• What is Twitter, a social network or a news media?

  2010cited by this paper
• GROUPIES IN RANDOM BIPARTITE GRAPHS

  2010cited by this paper
• Generation and analysis of large synthetic social contact networks

  2009cited by this paper
• Dynamics of large networks

  2008cited by this paper
• A large time-aware web graph

  2008cited by this paper
• Planetary-scale views on a large instant-messaging network

  2008cited by this paper
• Kronecker Graphs: An Approach to Modeling Networks

  2008cited by this paper
• An introduction to exponential random graph (p*) models for social networks

  2007cited by this paper
• Scalable modeling of real graphs using Kronecker multiplication

  2007cited by this paper
• Replication, Load Balancing and Efficient Range Query Processing in DHTs

  2006cited by this paper
• Efficient generation of large random networks.

  2005influential reference
• The Average Distance in a Random Graph with Given Expected Degrees

  2004cited by this paper
• R-MAT: A Recursive Model for Graph Mining

  2004cited by this paper
• Error and attacktolerance of complex network s

  2004cited by this paper
• Fast optimal load balancing algorithms for 1D partitioning

  2004cited by this paper
• Power laws and the AS-level internet topology

  2003cited by this paper
• The average distances in random graphs with given expected degrees

  2002cited by this paper
• A Random Graph Model for Power Law Graphs

  2001cited by this paper
• Community structure in social and biological networks

  2001cited by this paper
• On power-law relationships of the Internet topology

  1999cited by this paper
• Emergence of Scaling in Random Networks

  1999influential reference
• Collective dynamics of ‘small-world’ networks

  1998cited by this paper
• Highly optimized tolerance: a mechanism for power laws in designed systems.

  1998cited by this paper
• Efficient Partitioning of Sequences

  1995cited by this paper
• A Critical Point for Random Graphs with a Given Degree Sequence

  1995cited by this paper
• Optimal Partitioning of Sequences

  1995cited by this paper
• Stochastic Blockmodels for Directed Graphs

  1987cited by this paper
• The evolution of random graphs

  1984cited by this paper
• On the evolution of random graphs

  1984influential reference
• Stochastic blockmodels: First steps

  1983cited by this paper
• The Asymptotic Number of Labeled Graphs with Given Degree Sequences

  1978cited by this paper
• On Information and Sufficiency

  1951cited by this paper
• Variabilita e Mutabilita.

  1913cited by this paper
• Methods of Measuring the Concentration of Wealth

  1905cited by this paper

• Correcting Output Degree Sequences in Chung-Lu Random Graph Generation

  2022cites this paper
• A simple method for improving the accuracy of Chung-Lu random graph generation

  2021cites this paper
• Limitations of Chung Lu Random Graph Generation

  2021cites this paper
• Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

  2021influential citation
• Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence

  2021cites this paper
• Generating Massive Scale-free Networks

  2020cites this paper
• Recent Advances in Scalable Network Generation

  2020cites this paper
• Denoising large-scale biological data using network filters

  2020cites this paper
• Parallel Generation of Simple Null Graph Models

  2020cites this paper
• Opinion Dynamics on Co-Evolving Complex Networks

  2020cites this paper
• Scalable Generation of Graphs for Benchmarking HPC Community-Detection Algorithms

  2019influential citation
• Contributions to High-Performance Big Data Computing

  2019cites this paper
• Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks

  2019cites this paper
• Hierarchical Domain Representation in the AlgoWiki Encyclopedia: From Problems to Implementations

  2018cites this paper
• Mining user behavior in location-based social networks

  2017cites this paper
• A Comparison of Graph-Based Synthetic Data Generators for Benchmarking Next-Generation Intrusion Detection Systems

  2017cites this paper