summaryrefslogtreecommitdiff
path: root/doc/conf_model_deg_nocheck.md
blob: e4131d922edb41e096ea7389353e4138d30b00d6 (plain)
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
conf_model_deg_nocheck(1) -- Sample a multigraph from the configuration model
======

## SYNOPSIS

`conf_model_deg_nocheck` <degs> 

## DESCRIPTION

`conf_model_deg_nocheck` samples an undirected multigraph (i.e., a
graph that might contain self-loops multiple edges) from the
configuration model associated to the degree sequence provided in the
input file <degs>.

## PARAMETERS

* <degs>: 
    The name of the file containing the degree sequence. If <degs> is
    equal to '-' (dash) the degree sequence is read from STDIN
    (standard input).

## OUTPUT

`conf_model_deg_nocheck` prints on output the edge list of the sampled
graph.


## EXAMPLES

Let us assume that the file `AS-20010316.net_degs` contains the degree
sequence of the data set `AS-20010316.net` (the graph of the Internet
at AS level in March 2001). In this case, the degree sequence is too
constrained, since the maximum degree (2277) is much larger than the
structural cut-off (see [REFERENCES][] below). However, since
`conf_model_deg_nocheck` allows for self-loops and multiple edges, it
always finds a multigraph: 

        $ conf_model_deg_nocheck AS-20010316.net_degs > AS_20010316_rand.net
        $

## SEE ALSO

conf_model_deg(1), power_law(1), hv_net(1)

## REFERENCES

* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles,
  Methods and Applications", Chapter 5, Cambridge University Press
  (2017)

* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles,
  Methods and Applications", Appendix 12, Cambridge University Press
  (2017)


## AUTHORS

(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 `<v.nicosia@qmul.ac.uk>`.