IGraph/M Library - ConfigurationModel












6












$begingroup$


I am trying to reproduce a network generated by a configuration model given degree vector truncated power law distribution.



I am relying on the following function from the IGraph/M package for Mathematica:



IGDegreeSequenceGame[yy, Method -> "FastSimple"];


where yy is the data and FastSimple is the method option.



An example degree sequence is



yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


Method doesn't converge; the dimension of yy is 25, and I would like to use it on bigger networks.



Is there a fast way I can generate a network from a configuration model (without loops) with Mathematica?










share|improve this question









New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    Can you give a concrete example for yy?
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
    $endgroup$
    – Alberto Artoni
    17 hours ago








  • 1




    $begingroup$
    Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
    $endgroup$
    – Szabolcs
    17 hours ago
















6












$begingroup$


I am trying to reproduce a network generated by a configuration model given degree vector truncated power law distribution.



I am relying on the following function from the IGraph/M package for Mathematica:



IGDegreeSequenceGame[yy, Method -> "FastSimple"];


where yy is the data and FastSimple is the method option.



An example degree sequence is



yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


Method doesn't converge; the dimension of yy is 25, and I would like to use it on bigger networks.



Is there a fast way I can generate a network from a configuration model (without loops) with Mathematica?










share|improve this question









New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    Can you give a concrete example for yy?
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
    $endgroup$
    – Alberto Artoni
    17 hours ago








  • 1




    $begingroup$
    Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
    $endgroup$
    – Szabolcs
    17 hours ago














6












6








6





$begingroup$


I am trying to reproduce a network generated by a configuration model given degree vector truncated power law distribution.



I am relying on the following function from the IGraph/M package for Mathematica:



IGDegreeSequenceGame[yy, Method -> "FastSimple"];


where yy is the data and FastSimple is the method option.



An example degree sequence is



yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


Method doesn't converge; the dimension of yy is 25, and I would like to use it on bigger networks.



Is there a fast way I can generate a network from a configuration model (without loops) with Mathematica?










share|improve this question









New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




I am trying to reproduce a network generated by a configuration model given degree vector truncated power law distribution.



I am relying on the following function from the IGraph/M package for Mathematica:



IGDegreeSequenceGame[yy, Method -> "FastSimple"];


where yy is the data and FastSimple is the method option.



An example degree sequence is



yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


Method doesn't converge; the dimension of yy is 25, and I would like to use it on bigger networks.



Is there a fast way I can generate a network from a configuration model (without loops) with Mathematica?







graphs-and-networks igraphm






share|improve this question









New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited 16 hours ago









Szabolcs

163k14447944




163k14447944






New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 17 hours ago









Alberto ArtoniAlberto Artoni

311




311




New contributor




Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Alberto Artoni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • $begingroup$
    Can you give a concrete example for yy?
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
    $endgroup$
    – Alberto Artoni
    17 hours ago








  • 1




    $begingroup$
    Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
    $endgroup$
    – Szabolcs
    17 hours ago


















  • $begingroup$
    Can you give a concrete example for yy?
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
    $endgroup$
    – Alberto Artoni
    17 hours ago








  • 1




    $begingroup$
    Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
    $endgroup$
    – Szabolcs
    17 hours ago










  • $begingroup$
    Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
    $endgroup$
    – Szabolcs
    17 hours ago
















$begingroup$
Can you give a concrete example for yy?
$endgroup$
– Szabolcs
17 hours ago




$begingroup$
Can you give a concrete example for yy?
$endgroup$
– Szabolcs
17 hours ago












$begingroup$
yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
$endgroup$
– Alberto Artoni
17 hours ago






$begingroup$
yy is sampled from degree vector truncated power law distribution. An example could be: {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12} , where the degree distribution has k0 = 6 as lower cutoff, gamma = 2.5 as power law coefficient, and kmax is the natural cutoff
$endgroup$
– Alberto Artoni
17 hours ago






1




1




$begingroup$
Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
$endgroup$
– Szabolcs
17 hours ago




$begingroup$
Thanks. Next time please edit all such information into the question itself. I did the edit this time to illustrate what I mean.
$endgroup$
– Szabolcs
17 hours ago












$begingroup$
With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
$endgroup$
– Szabolcs
17 hours ago




$begingroup$
With FastSimple and the example yy that you provided, I get an immediate output. However, FastSimple does not implement the configuration model, and does not sample uniformly. Did you mean ConfigurationModelSimple? Was it not clear from the documentation that FastSimple is not the configuration model? I welcome all suggestion to improve the documentation.
$endgroup$
– Szabolcs
17 hours ago












$begingroup$
Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
$endgroup$
– Szabolcs
17 hours ago




$begingroup$
Also, make sure you are using the latest version of IGraph/M (currently 0.3.108)
$endgroup$
– Szabolcs
17 hours ago










1 Answer
1






active

oldest

votes


















7












$begingroup$

Exact sampling with a given degree sequence



The example degree sequence that you provided is:



yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


With this degree sequence,



IGDegreeSequenceGame[yy, Method -> "FastSimple"]


returns immediately, contrary to your claim.





However, Method -> "FastSimple" does not implement the configuration model. It implements a similar algorithm that is much faster but does not sample graphs uniformly. In other words, not all graphs that have this degree sequence will be generated with the same probability.



To use the configuration model to generate simple graphs, use



IGDegreeSequenceGame[yy, Method -> "ConfigurationModelSimple"]


As you say, this will not return. It takes too long. This algorithm (i.e. the configuration model) is simply too slow on this degree sequence, whether implemented in IGraph/M or another package.



I am not aware of any method which is capable of the exact and uniform sampling of simple graphs with such a degree sequence (if you are, let me know).



Approximate sampling with MCMC



One alternative option you have is to use Markov-Chain based sampling. First, create a single realization of the degree sequence then "shuffle its edges around" while keeping the degree sequence with IGRewire. Provided that enough rewiring steps are made, this method will sample approximately uniformly. It would sample uniformly for an infinite number of rewiring steps.



g = IGRealizeDegreeSequence[yy]
IGRewire[g, 1000]


You can use some heuristics to decide on how many rewiring steps are sufficient for the degree sequence you are working with. For example, correlations seem to be lost with less than 1000 rewiring steps for the sequence you quoted.



am = AdjacencyMatrix[g];
ListLogLinearPlot@Table[
{k, Flatten[am].Flatten@AdjacencyMatrix@IGRewire[g, k]},
{k, Round[2^Range[0, 15, 0.1]]}
]


enter image description here



You can also use Method -> "VigerLatapy" in IGDegreeSequenceGame, which implements a similar method for sampling connected graphs specifically. See the documentation for a reference to the paper.



Sampling graphs with power-law degree distributions



If your goal is to generate a graph with a power-law degree distribution (not a specific degree sequence), also take a look at IGStaticPowerLawGame. See the references within the C/igraph documentation for how it works. It implements a variation of the Chung-Lu model.



A note about the built-in DegreeGraphDistribution



A note about RandomGraph[DegreeGraphDistribution[...]]: it does not sample uniformly and I was not able to get information from Wolfram Support about how this method works. I would be cautious when using it.






share|improve this answer











$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "387"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });






    Alberto Artoni is a new contributor. Be nice, and check out our Code of Conduct.










    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193983%2figraph-m-library-configurationmodel%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    7












    $begingroup$

    Exact sampling with a given degree sequence



    The example degree sequence that you provided is:



    yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


    With this degree sequence,



    IGDegreeSequenceGame[yy, Method -> "FastSimple"]


    returns immediately, contrary to your claim.





    However, Method -> "FastSimple" does not implement the configuration model. It implements a similar algorithm that is much faster but does not sample graphs uniformly. In other words, not all graphs that have this degree sequence will be generated with the same probability.



    To use the configuration model to generate simple graphs, use



    IGDegreeSequenceGame[yy, Method -> "ConfigurationModelSimple"]


    As you say, this will not return. It takes too long. This algorithm (i.e. the configuration model) is simply too slow on this degree sequence, whether implemented in IGraph/M or another package.



    I am not aware of any method which is capable of the exact and uniform sampling of simple graphs with such a degree sequence (if you are, let me know).



    Approximate sampling with MCMC



    One alternative option you have is to use Markov-Chain based sampling. First, create a single realization of the degree sequence then "shuffle its edges around" while keeping the degree sequence with IGRewire. Provided that enough rewiring steps are made, this method will sample approximately uniformly. It would sample uniformly for an infinite number of rewiring steps.



    g = IGRealizeDegreeSequence[yy]
    IGRewire[g, 1000]


    You can use some heuristics to decide on how many rewiring steps are sufficient for the degree sequence you are working with. For example, correlations seem to be lost with less than 1000 rewiring steps for the sequence you quoted.



    am = AdjacencyMatrix[g];
    ListLogLinearPlot@Table[
    {k, Flatten[am].Flatten@AdjacencyMatrix@IGRewire[g, k]},
    {k, Round[2^Range[0, 15, 0.1]]}
    ]


    enter image description here



    You can also use Method -> "VigerLatapy" in IGDegreeSequenceGame, which implements a similar method for sampling connected graphs specifically. See the documentation for a reference to the paper.



    Sampling graphs with power-law degree distributions



    If your goal is to generate a graph with a power-law degree distribution (not a specific degree sequence), also take a look at IGStaticPowerLawGame. See the references within the C/igraph documentation for how it works. It implements a variation of the Chung-Lu model.



    A note about the built-in DegreeGraphDistribution



    A note about RandomGraph[DegreeGraphDistribution[...]]: it does not sample uniformly and I was not able to get information from Wolfram Support about how this method works. I would be cautious when using it.






    share|improve this answer











    $endgroup$


















      7












      $begingroup$

      Exact sampling with a given degree sequence



      The example degree sequence that you provided is:



      yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


      With this degree sequence,



      IGDegreeSequenceGame[yy, Method -> "FastSimple"]


      returns immediately, contrary to your claim.





      However, Method -> "FastSimple" does not implement the configuration model. It implements a similar algorithm that is much faster but does not sample graphs uniformly. In other words, not all graphs that have this degree sequence will be generated with the same probability.



      To use the configuration model to generate simple graphs, use



      IGDegreeSequenceGame[yy, Method -> "ConfigurationModelSimple"]


      As you say, this will not return. It takes too long. This algorithm (i.e. the configuration model) is simply too slow on this degree sequence, whether implemented in IGraph/M or another package.



      I am not aware of any method which is capable of the exact and uniform sampling of simple graphs with such a degree sequence (if you are, let me know).



      Approximate sampling with MCMC



      One alternative option you have is to use Markov-Chain based sampling. First, create a single realization of the degree sequence then "shuffle its edges around" while keeping the degree sequence with IGRewire. Provided that enough rewiring steps are made, this method will sample approximately uniformly. It would sample uniformly for an infinite number of rewiring steps.



      g = IGRealizeDegreeSequence[yy]
      IGRewire[g, 1000]


      You can use some heuristics to decide on how many rewiring steps are sufficient for the degree sequence you are working with. For example, correlations seem to be lost with less than 1000 rewiring steps for the sequence you quoted.



      am = AdjacencyMatrix[g];
      ListLogLinearPlot@Table[
      {k, Flatten[am].Flatten@AdjacencyMatrix@IGRewire[g, k]},
      {k, Round[2^Range[0, 15, 0.1]]}
      ]


      enter image description here



      You can also use Method -> "VigerLatapy" in IGDegreeSequenceGame, which implements a similar method for sampling connected graphs specifically. See the documentation for a reference to the paper.



      Sampling graphs with power-law degree distributions



      If your goal is to generate a graph with a power-law degree distribution (not a specific degree sequence), also take a look at IGStaticPowerLawGame. See the references within the C/igraph documentation for how it works. It implements a variation of the Chung-Lu model.



      A note about the built-in DegreeGraphDistribution



      A note about RandomGraph[DegreeGraphDistribution[...]]: it does not sample uniformly and I was not able to get information from Wolfram Support about how this method works. I would be cautious when using it.






      share|improve this answer











      $endgroup$
















        7












        7








        7





        $begingroup$

        Exact sampling with a given degree sequence



        The example degree sequence that you provided is:



        yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


        With this degree sequence,



        IGDegreeSequenceGame[yy, Method -> "FastSimple"]


        returns immediately, contrary to your claim.





        However, Method -> "FastSimple" does not implement the configuration model. It implements a similar algorithm that is much faster but does not sample graphs uniformly. In other words, not all graphs that have this degree sequence will be generated with the same probability.



        To use the configuration model to generate simple graphs, use



        IGDegreeSequenceGame[yy, Method -> "ConfigurationModelSimple"]


        As you say, this will not return. It takes too long. This algorithm (i.e. the configuration model) is simply too slow on this degree sequence, whether implemented in IGraph/M or another package.



        I am not aware of any method which is capable of the exact and uniform sampling of simple graphs with such a degree sequence (if you are, let me know).



        Approximate sampling with MCMC



        One alternative option you have is to use Markov-Chain based sampling. First, create a single realization of the degree sequence then "shuffle its edges around" while keeping the degree sequence with IGRewire. Provided that enough rewiring steps are made, this method will sample approximately uniformly. It would sample uniformly for an infinite number of rewiring steps.



        g = IGRealizeDegreeSequence[yy]
        IGRewire[g, 1000]


        You can use some heuristics to decide on how many rewiring steps are sufficient for the degree sequence you are working with. For example, correlations seem to be lost with less than 1000 rewiring steps for the sequence you quoted.



        am = AdjacencyMatrix[g];
        ListLogLinearPlot@Table[
        {k, Flatten[am].Flatten@AdjacencyMatrix@IGRewire[g, k]},
        {k, Round[2^Range[0, 15, 0.1]]}
        ]


        enter image description here



        You can also use Method -> "VigerLatapy" in IGDegreeSequenceGame, which implements a similar method for sampling connected graphs specifically. See the documentation for a reference to the paper.



        Sampling graphs with power-law degree distributions



        If your goal is to generate a graph with a power-law degree distribution (not a specific degree sequence), also take a look at IGStaticPowerLawGame. See the references within the C/igraph documentation for how it works. It implements a variation of the Chung-Lu model.



        A note about the built-in DegreeGraphDistribution



        A note about RandomGraph[DegreeGraphDistribution[...]]: it does not sample uniformly and I was not able to get information from Wolfram Support about how this method works. I would be cautious when using it.






        share|improve this answer











        $endgroup$



        Exact sampling with a given degree sequence



        The example degree sequence that you provided is:



        yy = {10, 7, 6, 6, 7, 8, 9, 11, 8, 7, 6, 9, 13, 8, 13, 19, 6, 12, 11, 11, 6, 7, 6, 6, 12};


        With this degree sequence,



        IGDegreeSequenceGame[yy, Method -> "FastSimple"]


        returns immediately, contrary to your claim.





        However, Method -> "FastSimple" does not implement the configuration model. It implements a similar algorithm that is much faster but does not sample graphs uniformly. In other words, not all graphs that have this degree sequence will be generated with the same probability.



        To use the configuration model to generate simple graphs, use



        IGDegreeSequenceGame[yy, Method -> "ConfigurationModelSimple"]


        As you say, this will not return. It takes too long. This algorithm (i.e. the configuration model) is simply too slow on this degree sequence, whether implemented in IGraph/M or another package.



        I am not aware of any method which is capable of the exact and uniform sampling of simple graphs with such a degree sequence (if you are, let me know).



        Approximate sampling with MCMC



        One alternative option you have is to use Markov-Chain based sampling. First, create a single realization of the degree sequence then "shuffle its edges around" while keeping the degree sequence with IGRewire. Provided that enough rewiring steps are made, this method will sample approximately uniformly. It would sample uniformly for an infinite number of rewiring steps.



        g = IGRealizeDegreeSequence[yy]
        IGRewire[g, 1000]


        You can use some heuristics to decide on how many rewiring steps are sufficient for the degree sequence you are working with. For example, correlations seem to be lost with less than 1000 rewiring steps for the sequence you quoted.



        am = AdjacencyMatrix[g];
        ListLogLinearPlot@Table[
        {k, Flatten[am].Flatten@AdjacencyMatrix@IGRewire[g, k]},
        {k, Round[2^Range[0, 15, 0.1]]}
        ]


        enter image description here



        You can also use Method -> "VigerLatapy" in IGDegreeSequenceGame, which implements a similar method for sampling connected graphs specifically. See the documentation for a reference to the paper.



        Sampling graphs with power-law degree distributions



        If your goal is to generate a graph with a power-law degree distribution (not a specific degree sequence), also take a look at IGStaticPowerLawGame. See the references within the C/igraph documentation for how it works. It implements a variation of the Chung-Lu model.



        A note about the built-in DegreeGraphDistribution



        A note about RandomGraph[DegreeGraphDistribution[...]]: it does not sample uniformly and I was not able to get information from Wolfram Support about how this method works. I would be cautious when using it.







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 16 hours ago

























        answered 17 hours ago









        SzabolcsSzabolcs

        163k14447944




        163k14447944






















            Alberto Artoni is a new contributor. Be nice, and check out our Code of Conduct.










            draft saved

            draft discarded


















            Alberto Artoni is a new contributor. Be nice, and check out our Code of Conduct.













            Alberto Artoni is a new contributor. Be nice, and check out our Code of Conduct.












            Alberto Artoni is a new contributor. Be nice, and check out our Code of Conduct.
















            Thanks for contributing an answer to Mathematica Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193983%2figraph-m-library-configurationmodel%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum

            He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

            Slayer Innehåll Historia | Stil, komposition och lyrik | Bandets betydelse och framgångar | Sidoprojekt och samarbeten | Kontroverser | Medlemmar | Utmärkelser och nomineringar | Turnéer och festivaler | Diskografi | Referenser | Externa länkar | Navigeringsmenywww.slayer.net”Metal Massacre vol. 1””Metal Massacre vol. 3””Metal Massacre Volume III””Show No Mercy””Haunting the Chapel””Live Undead””Hell Awaits””Reign in Blood””Reign in Blood””Gold & Platinum – Reign in Blood””Golden Gods Awards Winners”originalet”Kerrang! Hall Of Fame””Slayer Looks Back On 37-Year Career In New Video Series: Part Two””South of Heaven””Gold & Platinum – South of Heaven””Seasons in the Abyss””Gold & Platinum - Seasons in the Abyss””Divine Intervention””Divine Intervention - Release group by Slayer””Gold & Platinum - Divine Intervention””Live Intrusion””Undisputed Attitude””Abolish Government/Superficial Love””Release “Slatanic Slaughter: A Tribute to Slayer” by Various Artists””Diabolus in Musica””Soundtrack to the Apocalypse””God Hates Us All””Systematic - Relationships””War at the Warfield””Gold & Platinum - War at the Warfield””Soundtrack to the Apocalypse””Gold & Platinum - Still Reigning””Metallica, Slayer, Iron Mauden Among Winners At Metal Hammer Awards””Eternal Pyre””Eternal Pyre - Slayer release group””Eternal Pyre””Metal Storm Awards 2006””Kerrang! Hall Of Fame””Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Bullet-For My Valentine booed at Metal Hammer Golden Gods Awards””Unholy Aliance””The End Of Slayer?””Slayer: We Could Thrash Out Two More Albums If We're Fast Enough...””'The Unholy Alliance: Chapter III' UK Dates Added”originalet”Megadeth And Slayer To Co-Headline 'Canadian Carnage' Trek”originalet”World Painted Blood””Release “World Painted Blood” by Slayer””Metallica Heading To Cinemas””Slayer, Megadeth To Join Forces For 'European Carnage' Tour - Dec. 18, 2010”originalet”Slayer's Hanneman Contracts Acute Infection; Band To Bring In Guest Guitarist””Cannibal Corpse's Pat O'Brien Will Step In As Slayer's Guest Guitarist”originalet”Slayer’s Jeff Hanneman Dead at 49””Dave Lombardo Says He Made Only $67,000 In 2011 While Touring With Slayer””Slayer: We Do Not Agree With Dave Lombardo's Substance Or Timeline Of Events””Slayer Welcomes Drummer Paul Bostaph Back To The Fold””Slayer Hope to Unveil Never-Before-Heard Jeff Hanneman Material on Next Album””Slayer Debut New Song 'Implode' During Surprise Golden Gods Appearance””Release group Repentless by Slayer””Repentless - Slayer - Credits””Slayer””Metal Storm Awards 2015””Slayer - to release comic book "Repentless #1"””Slayer To Release 'Repentless' 6.66" Vinyl Box Set””BREAKING NEWS: Slayer Announce Farewell Tour””Slayer Recruit Lamb of God, Anthrax, Behemoth + Testament for Final Tour””Slayer lägger ner efter 37 år””Slayer Announces Second North American Leg Of 'Final' Tour””Final World Tour””Slayer Announces Final European Tour With Lamb of God, Anthrax And Obituary””Slayer To Tour Europe With Lamb of God, Anthrax And Obituary””Slayer To Play 'Last French Show Ever' At Next Year's Hellfst””Slayer's Final World Tour Will Extend Into 2019””Death Angel's Rob Cavestany On Slayer's 'Farewell' Tour: 'Some Of Us Could See This Coming'””Testament Has No Plans To Retire Anytime Soon, Says Chuck Billy””Anthrax's Scott Ian On Slayer's 'Farewell' Tour Plans: 'I Was Surprised And I Wasn't Surprised'””Slayer””Slayer's Morbid Schlock””Review/Rock; For Slayer, the Mania Is the Message””Slayer - Biography””Slayer - Reign In Blood”originalet”Dave Lombardo””An exclusive oral history of Slayer”originalet”Exclusive! Interview With Slayer Guitarist Jeff Hanneman”originalet”Thinking Out Loud: Slayer's Kerry King on hair metal, Satan and being polite””Slayer Lyrics””Slayer - Biography””Most influential artists for extreme metal music””Slayer - Reign in Blood””Slayer guitarist Jeff Hanneman dies aged 49””Slatanic Slaughter: A Tribute to Slayer””Gateway to Hell: A Tribute to Slayer””Covered In Blood””Slayer: The Origins of Thrash in San Francisco, CA.””Why They Rule - #6 Slayer”originalet”Guitar World's 100 Greatest Heavy Metal Guitarists Of All Time”originalet”The fans have spoken: Slayer comes out on top in readers' polls”originalet”Tribute to Jeff Hanneman (1964-2013)””Lamb Of God Frontman: We Sound Like A Slayer Rip-Off””BEHEMOTH Frontman Pays Tribute To SLAYER's JEFF HANNEMAN””Slayer, Hatebreed Doing Double Duty On This Year's Ozzfest””System of a Down””Lacuna Coil’s Andrea Ferro Talks Influences, Skateboarding, Band Origins + More””Slayer - Reign in Blood””Into The Lungs of Hell””Slayer rules - en utställning om fans””Slayer and Their Fans Slashed Through a No-Holds-Barred Night at Gas Monkey””Home””Slayer””Gold & Platinum - The Big 4 Live from Sofia, Bulgaria””Exclusive! Interview With Slayer Guitarist Kerry King””2008-02-23: Wiltern, Los Angeles, CA, USA””Slayer's Kerry King To Perform With Megadeth Tonight! - Oct. 21, 2010”originalet”Dave Lombardo - Biography”Slayer Case DismissedArkiveradUltimate Classic Rock: Slayer guitarist Jeff Hanneman dead at 49.”Slayer: "We could never do any thing like Some Kind Of Monster..."””Cannibal Corpse'S Pat O'Brien Will Step In As Slayer'S Guest Guitarist | The Official Slayer Site”originalet”Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Kerrang! Awards 2006 Blog: Kerrang! Hall Of Fame””Kerrang! Awards 2013: Kerrang! Legend”originalet”Metallica, Slayer, Iron Maien Among Winners At Metal Hammer Awards””Metal Hammer Golden Gods Awards””Bullet For My Valentine Booed At Metal Hammer Golden Gods Awards””Metal Storm Awards 2006””Metal Storm Awards 2015””Slayer's Concert History””Slayer - Relationships””Slayer - Releases”Slayers officiella webbplatsSlayer på MusicBrainzOfficiell webbplatsSlayerSlayerr1373445760000 0001 1540 47353068615-5086262726cb13906545x(data)6033143kn20030215029