Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
Hostname: page-component-558cb97cc8-fpk9s Total loading time: 0.288 Render date: 2022-10-06T13:09:05.249Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": true, "useSa": true } hasContentIssue true
  • English
Network Science Network Science

Article contents

Random multigraphs and aggregated triads with fixed degrees

Published online by Cambridge University Press:  28 December 2017

OVE FRANK  and
TERMEH SHAFIE
OVE FRANK
Affiliation:
Department of Statistics, Stockholm University, Sweden (e-mail: ove.frank@stat.su.se)
TERMEH SHAFIE
Affiliation:
Department of Computer & Information Science, University of Konstanz, Germany (e-mail: termeh.shafie@uni-konstanz.de)
Get access Rights & Permissions[Opens in a new window]

Abstract

Random multigraphs with fixed degrees are obtained by the configuration model or by so called random stub matching. New combinatorial results are given for the global probability distribution of edge multiplicities and its marginal local distributions of loops and edges. The number of multigraphs on triads is determined for arbitrary degrees, and aggregated triads are shown to be useful for analyzing regular and almost regular multigraphs. Relationships between entropy and complexity are given and numerically illustrated for multigraphs with different number of vertices and specified average and variance for the degrees.

Keywords

multigraphfixed degreesedge multiplicityconfiguration modelrandom stub matchingcomplexity and simplicityentropyaggregated triad
Type
Research Article
Information
Network Science , Volume 6 , Issue 2 , June 2018 , pp. 232 - 250
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bender, E. A, & Canfield, R. E. (1978). The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory Series A, 24 (3), 296–307.CrossRefGoogle Scholar
Cover, T. M., & Thomas, J. A. (2006). Elements of information theory. Hoboken, NJ: John Wiley & Sons.Google Scholar
Frank, O. (1988). Triad count statistics. Annals of Discrete Mathematics, 38, 141–149.CrossRefGoogle Scholar
Frank, O. (2000). Structural plots of multivariate binary data. Journal of Social Structure, 1 (4), 1–19.Google Scholar
Frank, O. (2011). Statistical information tools for multivariate discrete data. In Pardo, L., Balakrishnan, N., & Gil, M. A. (Eds.), Modern mathematical tools and techniques in capturing complexity (pp. 177–190). Berlin Heidelberg: Springer.CrossRefGoogle Scholar
Frank, O., & Shafie, T. (2016). Multivariate entropy analysis of network data. Bulletin of Sociological Methodology/Bulletin de Méthodologie Sociologique, 129 (1), 45–63.CrossRefGoogle Scholar
Frank, O., & Strauss, D. (1986). Markov graphs. Journal of the American Statistical Association, 81 (395), 832–842.CrossRefGoogle Scholar
Holland, P. W., & Leinhardt, S. (1976). Local structure in social networks. Sociological Methodology, 7 (1), 1–46.CrossRefGoogle Scholar
Janson, S. (2009). The probability that a random multigraph is simple. Combinatorics, Probability and Computing, 18 (1–2), 205–225.CrossRefGoogle Scholar
Kolaczyk, E. D. (2009). Statistical analysis of network data: Methods and models. New York, NY: Springer Verlag.CrossRefGoogle Scholar
McKay, B. D., & Wormald, N. C. (1991). Asymptotic enumeration by degree sequence of graphs with degrees o(n 1/2). Combinatorica, 11 (4), 369–382.CrossRefGoogle Scholar
Shafie, T. (2012). Random multigraphs – complexity measures, probability models and statistical inference. Ph.D. thesis, Stockholm University.Google Scholar
Shafie, T. (2015). A multigraph approach to social network analysis. Journal of Social Structure, 16 (1), 21.Google Scholar
Shafie, T. (2016). Analyzing local and global properties of multigraphs. Journal of Mathematical Sociology, 40 (4), 239–264.CrossRefGoogle Scholar
Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge, UK: Cambridge University Press.CrossRefGoogle Scholar
Wormald, N. C. (1999). Models of random regular graphs. London Mathematical Society Lecture Note Series, 239–298.Google Scholar
2
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Random multigraphs and aggregated triads with fixed degrees
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Random multigraphs and aggregated triads with fixed degrees
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Random multigraphs and aggregated triads with fixed degrees
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *