Files
@ d0883e1df741
Branch filter:
Location: AENC/switchchain/cpp/switchchain_ccm_cputime.cpp - annotation
d0883e1df741
6.6 KiB
text/x-c++src
Add proper cputime plots
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 | 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 d0883e1df741 d0883e1df741 634d9c963986 634d9c963986 634d9c963986 d0883e1df741 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 d0883e1df741 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 d0883e1df741 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 634d9c963986 | #include "exports.hpp"
#include "graph.hpp"
#include "graph_ccm.hpp"
#include "graph_powerlaw.hpp"
#include "switchchain.hpp"
#include <algorithm>
#include <chrono>
#include <fstream>
#include <iostream>
#include <numeric>
#include <random>
#include <vector>
int main(int argc, char* argv[]) {
// Simulation parameters
const int numVerticesMin = 10000;
const int numVerticesMax = 10000;
const int numVerticesStep = 1000;
//float tauValues[] = {2.1f, 2.2f, 2.3f, 2.4f, 2.5f, 2.6f, 2.7f, 2.8f, 2.9f};
float tauValues[] = {2.1f, 2.5f, 2.9f};
//const int totalDegreeSamples = 10;
const int totalDegreeSamples = 1;
auto getMixingTime = [](int n, float tau) {
return int(1.0f * (50.0f - 10.0f * (tau - 2.0f)) * n);
};
// Output file
std::ofstream outfile;
if (argc >= 2)
outfile.open(argv[1]);
else
outfile.open("graphdata_ccm_cputime.m");
if (!outfile.is_open()) {
std::cout << "ERROR: Could not open output file.\n";
return 1;
}
// Output Mathematica-style comment to indicate file contents
outfile << "(*\n";
outfile << "n from " << numVerticesMin << " to " << numVerticesMax
<< " step " << numVerticesStep << std::endl;
outfile << "tauValues: " << tauValues << std::endl;
//outfile << "degreeSamples: " << totalDegreeSamples << std::endl;
outfile << "canonical ds" << std::endl;
outfile << "mixingTime: 0.5 * (50 - 10 (tau - 2)) n\n";
outfile << "measurements: full time evol\n";
outfile << "data:\n";
outfile << "1: {n,tau}\n";
outfile << "2: edges\n";
outfile << "3: HH timed triangle seq\n";
outfile << "4: {ccm1 failed attempts, timed triangle seq}\n";
outfile << "5: {ccm2 failed attempts, timed triangle seq}\n";
outfile << "6: slow-sort-HH timed triangle seq\n";
outfile << "*)" << std::endl;
// Mathematica does not accept normal scientific notation
outfile << std::fixed;
outfile << '{' << '\n';
bool outputComma = false;
std::mt19937 rng(std::random_device{}());
Graph g;
for (int numVertices = numVerticesMin; numVertices <= numVerticesMax;
numVertices += numVerticesStep) {
for (float tau : tauValues) {
int mixingTime = getMixingTime(numVertices, tau);
// For a single n,tau take samples over several instances of
// the degree distribution.
for (int degreeSample = 0; degreeSample < totalDegreeSamples;
++degreeSample) {
DegreeSequence ds;
//generatePowerlawGraph(numVertices, tau, g, ds, rng);
generateCanonicalPowerlawGraph(numVertices, tau, g, ds);
std::cout << "Running (n,tau) = (" << numVertices << ',' << tau
<< "). " << std::flush;
SwitchChain chain;
std::vector<std::pair<double, unsigned int>> triangleSeq(mixingTime);
{
// record start time
auto start = std::chrono::high_resolution_clock::now();
// Incorporate Havel-Hakimi time
g.createFromDegreeSequence(ds);
if (!chain.initialize(g, true)) {
std::cerr << "Could not initialize Markov chain.\n";
return 1;
}
for (int i = 0; i < mixingTime; ++i) {
auto now = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> dt = now - start;
triangleSeq[i] =
std::make_pair(dt.count(), chain.g.getTrackedTriangles());
chain.doMove(true);
}
}
std::cout << " Finished timed HH time evol." << std::flush;
if (outputComma)
outfile << ',' << '\n';
outputComma = true;
outfile << '{';
outfile << '{' << numVertices << ',' << tau << '}';
outfile << ',' << g.edgeCount();
outfile << ',' << triangleSeq;
for (int ccmType = 1; ccmType <= 2; ++ccmType) {
bool ccmMethod = (ccmType == 1 ? false : true);
// record start time
auto start = std::chrono::high_resolution_clock::now();
bool failed = true;
for (int i = 0; i < 1000; ++i) {
Graph gtemp;
if (constrainedConfigurationModel(ds, gtemp, rng,
ccmMethod)) {
chain.initialize(gtemp, true);
for (int i = 0; i < mixingTime; ++i) {
auto now =
std::chrono::high_resolution_clock::now();
std::chrono::duration<double> dt = now - start;
triangleSeq[i] = std::make_pair(
dt.count(), chain.g.getTrackedTriangles());
chain.doMove(true);
}
outfile << ',' << '{' << i << ',' << triangleSeq << '}';
failed = false;
break;
}
}
if (failed)
outfile << ",{1000,{}}";
}
// Slow sort method
{
// record start time
auto start = std::chrono::high_resolution_clock::now();
// Incorporate Havel-Hakimi time
g.createFromDegreeSequence(ds, true);
if (!chain.initialize(g, true)) {
std::cerr << "Could not initialize Markov chain.\n";
return 1;
}
for (int i = 0; i < mixingTime; ++i) {
auto now = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> dt = now - start;
triangleSeq[i] =
std::make_pair(dt.count(), chain.g.getTrackedTriangles());
chain.doMove(true);
}
}
outfile << ',' << triangleSeq;
outfile << '}' << std::flush;
std::cout << " Finished timed CCM time evols." << std::flush;
std::cout << std::endl;
}
}
}
outfile << '\n' << '}';
return 0;
}
|