++ed by:

1 non-PAUSE user.

Darko Obradovic

NAME

SNA::Network::Generator::MCMC - Generate random networks by a series of edge swaps according to the Markov Chain Monte Carlo principle

SYNOPSIS

    use SNA::Network;

    my $net = SNA::Network->new_from_pajek_net($filename);
    $net->shuffle;
    ...
    for (1.100) {
        say $net->shuffle->identify_weakly_connected_components;
    }

METHODS

The following methods are added to SNA::Network.

shuffle

Generates a random networks by a series of edge swaps on an existing network according to the Markov Chain Monte Carlo principle. This means that the initial network will be changed and have a totally new, random edge structure.

This method will exactly preserve all in- and outdegrees, and is guaranteed to sample uniformly at random from all possible simple graph configurations.

You may optionally pass the number of steps to perform. By default, the currently best known number is used, namely the number of edges in the network multiplied by its logarithm.

Returns the network reference again, in order to enable method chaining.

AUTHOR

Darko Obradovic, <dobradovic at gmx.de>

BUGS

Please report any bugs or feature requests to bug-sna-network-node at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=SNA-Network. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.

SUPPORT

You can find documentation for this module with the perldoc command.

    perldoc SNA::Network

You can also look for information at:

ACKNOWLEDGEMENTS

COPYRIGHT & LICENSE

Copyright 2009 Darko Obradovic, all rights reserved.

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.