Mixing time of exponential random graphs (Q657693): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105584278, #quickstatements; #temporary_batch_1712201099914 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0812.2265 / rank | |||
Normal rank | |||
Revision as of 15:54, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mixing time of exponential random graphs |
scientific article |
Statements
Mixing time of exponential random graphs (English)
0 references
10 January 2012
0 references
Sampling in exponential random graphs is typically carried out by using Markov chain Monte Carlo methods like the Glauber dynamics or the Metropolis-Hastings procedure. High and low temperature regimes are characterized, and for each regime the order of the mixing time of the sampling procedure is specified in terms of the number of vertices in the graph. The results are used to determine whether or not specific exponential random graph models possess a desired reciprocity property.
0 references
Mixing times
0 references
exponential random graphs
0 references
path coupling
0 references
