• ergm

  • Referenced in 48 articles [sw06777]
  • simulate networks based on exponential-family random graph models (ERGM). ”ergm” is a part...
  • SNAP

  • Referenced in 39 articles [sw04184]
  • calculates structural properties, generates regular and random graphs, and supports attributes on nodes and edges...
  • t-SNE

  • Referenced in 88 articles [sw22300]
  • random walks on neighborhood graphs to allow the implicit structure of all of the data...
  • QUALEX

  • Referenced in 49 articles [sw04742]
  • efficient on the DIMACS benchmark graphs and various random maximum weight clique problem instances...
  • Algorithm 447

  • Referenced in 137 articles [sw12877]
  • paths. The algorithm for partitioning of a graph into simple paths of iterative and each ... when executed on a random access computer...
  • CONTEST

  • Referenced in 19 articles [sw12738]
  • many challenging matrix computational tasks. Several random graph models have been proposed that capture ... solvers. CONTEST (CONtrollable TEST matrices) is a random network toolbox for MATLAB that implements nine ... models produce unweighted directed or undirected graphs; that is, symmetric or unsymmetric matrices with elements...
  • sna

  • Referenced in 18 articles [sw07318]
  • methods, structural equivalence detection, network regression, random graph generation, and 2D/3D network visualization...
  • GraphBase

  • Referenced in 122 articles [sw01555]
  • graphs such as book (“homer”, 280, 0, 1, 0, 0, 1, 1, 0) and random...
  • Bergm

  • Referenced in 9 articles [sw14577]
  • Bergm: Bayesian analysis for exponential random graph models. Set of tools to analyse Bayesian exponential ... random graph models...
  • JUNG

  • Referenced in 11 articles [sw12112]
  • implementations of a number of algorithms from graph theory, data mining, and social network analysis ... routines for clustering, decomposition, optimization, random graph generation, statistical analysis, and calculation of network distances...
  • PNet

  • Referenced in 7 articles [sw19725]
  • Estimation and Simulation of p* Exponential Random Graph Models. PNet is a software ... social network data using Exponential Random Graph Models (ERGM) and Auto-logistic Actor Attribute Models...
  • TABARIS

  • Referenced in 16 articles [sw02534]
  • graph. A technique for finding in a graph an independent set with maximum cardinality ... algorithm is obtained; the case of randomly generated graphs having...
  • Mixnet

  • Referenced in 9 articles [sw22900]
  • Networks, a probabilistic model for random graphs. This model is a clustering model based...
  • Hyperbolic graph generator

  • Referenced in 5 articles [sw19944]
  • networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper ... like networks, the program can generate random graphs from other well-known graph ensembles, such ... soft configuration model, random geometric graphs ... circle, or Erdős-Rényi random graphs. The simulations show a good match between the expected...
  • TGFF

  • Referenced in 15 articles [sw17689]
  • TGFF: task graphs for free. Task Graphs For Free (TGFF) was designed to provide ... standard way of generating pseudo-random task-graphs for use in scheduling and allocation research...
  • tergm

  • Referenced in 5 articles [sw24886]
  • Network Evolution Based on Exponential-Family Random Graph Models. An integrated set of extensions ... network evolution based on exponential-family random graph models (ERGM). ’tergm’ is a part...
  • mixer

  • Referenced in 4 articles [sw12288]
  • package mixer: Random graph clustering. Routines for the analysis (unsupervised clustering) of networks using MIXtures ... Erdos-Renyi random graphs...
  • EpiModel

  • Referenced in 6 articles [sw16142]
  • robust statistical methods of exponential-family random graph models (ERGMs) from the Statnet suite...
  • UnitWalk

  • Referenced in 34 articles [sw00993]
  • this paper we present a new randomized algorithm for SAT, i.e., the satisfiability problem ... from graph coloring problems to microprocessor verification. Our algorithm is inspired by two randomized algorithms...