File: sample_gnm.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1%2Bdeb9u1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 18,232 kB
  • sloc: ansic: 173,538; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (52 lines) | stat: -rw-r--r-- 1,268 bytes parent folder | download | duplicates (2)
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
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/games.R
\name{sample_gnm}
\alias{gnm}
\alias{sample_gnm}
\title{Generate random graphs according to the G(n,m) Erdos-Renyi model}
\usage{
sample_gnm(n, m, directed = FALSE, loops = FALSE)

gnm(...)
}
\arguments{
\item{n}{The number of vertices in the graph.}

\item{m}{The number of edges in the graph.}

\item{directed}{Logical, whether the graph will be directed, defaults to
FALSE.}

\item{loops}{Logical, whether to add loop edges, defaults to FALSE.}

\item{...}{Passed to \code{sample_app}.}
}
\value{
A graph object.
}
\description{
This model is very simple, every possible edge is created with the same
constant probability.
}
\details{
The graph has \sQuote{n} vertices and \sQuote{m} edges,
and the \sQuote{m} edges are chosen uniformly randomly from the set of all
possible edges. This set includes loop edges as well if the \code{loops}
parameter is TRUE.
}
\examples{
g <- sample_gnm(1000, 1000)
degree_distribution(g)
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\references{
Erdos, P. and Renyi, A., On random graphs, \emph{Publicationes
Mathematicae} 6, 290--297 (1959).
}
\seealso{
\code{\link{sample_gnp}}, \code{\link{sample_pa}}
}
\keyword{graphs}