Random sampling of 3-colorings in Z 2
By Leslie Ann Goldberg, Russell Martin, M. Paterson. 2004
129 citations recorded by the source corpus.
Subfields: Applied Mathematics, Discrete Mathematics and Combinatorics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/5aaab1702b0310e7ebe159dcb1abf09eca346b4a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
In Discrete Mathematics and Combinatorics
In Numerical Analysis
Citations in the corpus
- Epidemics on Random Graphs with Tunable Clustering (2007, methodology): “In view of the result in Stark (2004) concerning the degree distribution and the characterization of the clustering in Deijfen and Kets (2007), the best choice if we want to use a random intersection graph to describe a social network seems to be α = 1.”
- Random Graphs and Complex Networks (2016, methodology): “This model was introduced in: [230] and further studied in: [121] [162] [239] Willemien and I studied a version where the vertices have random weights and the edge probabilities are determined by these weights (which gives a graph where both the degree distribution and the clustering can be controll”