The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On a General Class of Models for Interaction
Abstract
This paper develops a class of probability models for configurations of interacting points in a domain. The distributions depend on a function which may be viewed as giving the potential energy of the configurations. Examples include models for interaction in a spatial region and on lattices and graphs. New models in the general class arise naturally, an example being a spatial model for points of different categories. Some general methods, including series expansions and a simulation method known from statistical mechanics, can be useful for many of these models. Several applications of this kind are considered, and some connections between the models and with the statistical mechanics are explored.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ripley, B. D. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01615.x · Cited by 2,511
Ripley, B. D. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725218 · Cited by 2,052
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
An introduction to exponential random graph (p*) models for social networks
Robins, G., Pattison, P., Kalish, Y., & Lusher, D. (2007) · Social Networks · doi:10.1016/j.socnet.2006.08.002 · Cited by 1,995
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
New Specifications for Exponential Random Graph Models
Snijders, T. A. B., Pattison, P. E., Robins, G. L., & Handcock, M. S. (2006) · Sociological Methodology · doi:10.1111/j.1467-9531.2006.00176.x · Cited by 1,445
Growing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p
Wasserman, S., & Pattison, P. (1996) · Psychometrika · doi:10.1007/bf02294547 · Cited by 950
Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
Geyer, C. J., & Thompson, E. A. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476590 · Cited by 910
Constrained Monte Carlo Maximum Likelihood for Dependent Data
Geyer, C. J., & Thompson, E. A. (1992) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1992.tb01443.x · Cited by 874
Recent developments in exponential random graph (p*) models for social networks
Robins, G., Snijders, T., Wang, P., Handcock, M., & Pattison, P. (2007) · Social Networks · doi:10.1016/j.socnet.2006.08.003 · Cited by 832
Statistical mechanics of networks
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066117 · Cited by 673
Social network analysis: A methodological introduction
Butts, C. T. (2008) · Asian Journal of Social Psychology · doi:10.1111/j.1467-839x.2007.00241.x · Cited by 546
Revisiting the Foundations of Network Analysis
Butts, C. T. (2009) · Science · doi:10.1126/science.1171022 · Cited by 536
4. A Relational Event Framework for Social Action
Butts, C. T. (2008) · Sociological Methodology · doi:10.1111/j.1467-9531.2008.00203.x · Cited by 477
Pseudolikelihood Estimation for Social Networks
Strauss, D., & Ikeda, M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10475327 · Cited by 440
Self-citationThe statistical physics of real-world networks
Cimini, G., Squartini, T., Saracco, F., Garlaschelli, D., Gabrielli, A., & Caldarelli, G. (2019) · Nature Reviews Physics · doi:10.1038/s42254-018-0002-6 · Cited by 378
Detection of topological patterns in complex networks: correlation profile of the internet
Maslov, S., Sneppen, K., & Zaliznyak, A. (2004) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2003.06.002 · Cited by 364
A p* primer: logit models for social networks
Anderson, C. J., Wasserman, S., & Crouch, B. (1999) · Social Networks · doi:10.1016/s0378-8733(98)00012-4 · Cited by 332
Logit models and logistic regressions for social networks: II. Multivariate relations
Pattison, P., & Wasserman, S. (1999) · British Journal of Mathematical and Statistical Psychology · doi:10.1348/000711099159053 · Cited by 327
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J., & Diaconis, P. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 291
Börner, K., Sanyal, S., & Vespignani, A. (2007) · Annual Review of Information Science and Technology · doi:10.1002/aris.2007.1440410119 · Cited by 279
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Exponential random simplicial complexes
Zuev, K., Eisenberg, O., & Krioukov, D. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/46/465002 · Cited by 49
Metadata
- Authors
- Strauss, D.
- Venue
- SIAM Review
- Published
- 1986-12
- Volume
- 28
- Issue
- 4
- Pages
- 513-527
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2078578908
- Cited by
- 247
- References
- 2
- FWCI
- 1.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.