Files @ eba8261885e8
Branch filter:

Location: AENC/switchchain/cpp/switchchain_successrates.cpp - annotation

Tom Bannink
Change trimeevol plot for thesis
c95330463954
c95330463954
c9c22e41130d
be2f7fe6b220
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
b9486351acf3
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
b9486351acf3
c9c22e41130d
c9c22e41130d
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c02bb6630c20
c02bb6630c20
c02bb6630c20
c02bb6630c20
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c02bb6630c20
c95330463954
c95330463954
c95330463954
c02bb6630c20
c02bb6630c20
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
b9486351acf3
b9486351acf3
b9486351acf3
b9486351acf3
b9486351acf3
b9486351acf3
b9486351acf3
c95330463954
b9486351acf3
c02bb6630c20
c02bb6630c20
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
c95330463954
#include "exports.hpp"
#include "graph.hpp"
#include "graph_powerlaw.hpp"
#include "switchchain.hpp"
#include <algorithm>
#include <array>
#include <fstream>
#include <iostream>
#include <numeric>
#include <random>
#include <vector>

int main(int argc, char* argv[]) {
    // Generate a random degree sequence
    std::mt19937 rng(std::random_device{}());

    // Goal:
    // Degrees follow a power-law distribution with some parameter tau
    // Expect:  #tri = const * n^{ something }
    // The goal is to find the 'something' by finding the number of triangles
    // for different values of n and tau
    //float tauValues[] = {2.5f};
    float tauValues[] = {2.1f, 2.2f, 2.3f, 2.4f, 2.5f, 2.6f, 2.7f, 2.8f, 2.9f};

    Graph g;

    std::ofstream outfile;

    if (argc >= 2)
        outfile.open(argv[1]);
    else   
        outfile.open("graphdata_successrates.m");

    if (!outfile.is_open()) {
        std::cout << "ERROR: Could not open output file.\n";
        return 1;
    }

    outfile << '{';
    bool outputComma = false;

    for (int numVertices = 1000; numVertices <= 1000; numVertices += 1000) {
        for (float tau : tauValues) {
            // For a single n,tau take samples over several instances of
            // the degree distribution.
            for (int degreeSample = 0; degreeSample < 2000; ++degreeSample) {
                DegreeSequence ds;
                generatePowerlawGraph(numVertices, tau, g, ds, rng);

                SwitchChain chain;
                if (!chain.initialize(g)) {
                    std::cerr << "Could not initialize Markov chain.\n";
                    return 1;
                }

                std::cout << "Running n = " << numVertices << ", tau = " << tau
                          << ". \t" << std::flush;

                // Non time evol
                int mixingTime = 32*(32.0f - 15.0f*(tau - 2.0f)) * numVertices; //40000;
                constexpr int measurements = 50;
                constexpr int measureSkip =
                    200; // Take a sample every ... steps

                // Time Evol
                //int mixingTime = 0;
                //constexpr int measurements = 500;
                //constexpr int measureSkip = 100;


                int movesTotal = 0;
                int movesSuccess = 0;

                int triangles[measurements];

                for (int i = 0; i < mixingTime; ++i) {
                    ++movesTotal;
                    if (chain.doMove()) {
                        ++movesSuccess;
                    }
                }

                // Time Evol
                //std::vector<int> successRates;
                //successRates.reserve(measurements);
                //int successrate = 0;
                for (int i = 0; i < measurements; ++i) {
                    for (int j = 0; j < measureSkip; ++j) {
                        ++movesTotal;
                        if (chain.doMove()) {
                            ++movesSuccess;
                            //++successrate;
                        }
                    }
                    triangles[i] = chain.g.countTriangles();
                    //successRates.push_back(successrate);
                    //successrate = 0;
                }

                std::cout << '('
                          << 100.0f * float(movesSuccess) / float(movesTotal)
                          << "% successrate). " << std::flush;
                // std::cout << std::endl;

                if (outputComma)
                    outfile << ',' << '\n';
                outputComma = true;

                long long trianglesTotal = 0;
                for (int i = 0; i < measurements; ++i)
                    trianglesTotal += triangles[i];

                float avgTriangles =
                    float(trianglesTotal) / float(measurements);

                outfile << '{' << '{' << numVertices << ',' << tau << '}';
                outfile << ',' << avgTriangles;
                //outfile << ',' << successRates;
                outfile << ',' << float(movesSuccess) / float(movesTotal);
                outfile << '}' << std::flush;

                std::cout << std::endl;
            }
        }
    }
    outfile << '}';
    return 0;
}