Generalised hypergeometric ensembles of random graphs: the configuration model as an urn problem

@article{Casiraghi2018GeneralisedHE,
  title={Generalised hypergeometric ensembles of random graphs: the configuration model as an urn problem},
  author={G. Casiraghi and V. Nanumyan},
  journal={ArXiv},
  year={2018},
  volume={abs/1810.06495}
}
We introduce a broad class of random graph models: the generalised hypergeometric ensemble (GHypEG). This class enables to solve some long standing problems in random graph theory. First, GHypEG provides an elegant and compact formulation of the well-known configuration model in terms of an urn problem. Second, GHypEG allows to incorporate arbitrary tendencies to connect different vertex pairs. Third, we present the closed-form expressions of the associated probability distribution ensures the… Expand
Analytical Formulation of the Block-Constrained Configuration Model
TLDR
This work provides a novel family of generative block-models for random graphs that naturally incorporates degree distributions and extends the well-known configuration model by enforcing block-constraints on the edge generation process. Expand
The block-constrained configuration model
TLDR
A novel family of generative block-models for random graphs that naturally incorporates degree distributions that provide a new, flexible tool for the study of community structure and for network science in general, where modeling networks with heterogeneous degree distributions is of central importance. Expand
What Is the Entropy of a Social Organization?
TLDR
A social organization is represented as a network in which nodes correspond to individuals and (multi-)edges to their multiple interactions and the Shannon entropy is calculated as a measure of potentiality. Expand
Multiplex Network Regression: How do relations drive interactions?
TLDR
A statistical regression model based on generalised hypergeometric ensembles, which can regress the influence of each relational layer, the explanatory variables, on the interaction counts, the dependent variables and quantify the statistical significance of the relations as explanatory variables for the observed interactions. Expand
Detecting mesoscale structures by surprise
The importance of identifying the presence of mesoscale structures in complex networks can be hardly overestimated. So far, much attention has been devoted to the detection of communities, bipartiteExpand
Quantifying Triadic Closure in Multi-Edge Social Networks
TLDR
This work proposes a novel measure of triadic closure for multi-edge networks based on a shared partner statistic and demonstrates that this measure can detect meaningful closure in synthetic and empirical multi- edge networks, where conventional approaches fail. Expand
Detecting Path Anomalies in Time Series Data on Networks
TLDR
A novel framework for the unsupervised detection of anomalies in large corpora of variable-length temporal paths in a graph is introduced, which provides an efficient analytical method to detect paths with anomalous frequencies that result from nodes being traversed in unexpected chronological order. Expand
MEASURING RESILIENCE OF SOCIAL ORGANIZATIONS USING ENTROPY—A TEMPORAL CASE-STUDY FROM OPEN SOURCE SOFTWARE DEVELOPMENT
Social organizations are ubiquitous in our everyday life, ranging from the project team we are working in to the special interest group we are contributing to, online. For our study, we focus onExpand
The likelihood-ratio test for multi-edge network models
The complexity underlying real-world systems implies that standard statistical hypothesis testing methods may not be adequate for these peculiar applications. Specifically, we show that theExpand
...
1
2
...

References

SHOWING 1-10 OF 20 REFERENCES
A random graph model for massive graphs
TLDR
A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs. Expand
A Critical Point for Random Graphs with a Given Degree Sequence
TLDR
It is shown that if Σ i(i - 2)λi > 0, then such graphs almost surely have a giant component, while if λ0, λ1… which sum to 1, then almost surely all components in such graphs are small. Expand
Generalized Hypergeometric Ensembles: Statistical Hypothesis Testing in Complex Networks
TLDR
This Letter introduces generalized hypergeometric ensembles, a broad class of analytically tractable statistical ensembled of finite, directed and weighted networks, and rests on the introduction of dyadic link propensities, which capture the degree-corrected tendencies of pairs of nodes to form edges between each other. Expand
Connected Components in Random Graphs with Given Expected Degree Sequences
Abstract. We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of itsExpand
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
TLDR
The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i. Expand
The average distances in random graphs with given expected degrees
  • F. Chung, L. Lu
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees. Expand
Multiplex Network Regression: How do relations drive interactions?
TLDR
A statistical regression model based on generalised hypergeometric ensembles, which can regress the influence of each relational layer, the explanatory variables, on the interaction counts, the dependent variables and quantify the statistical significance of the relations as explanatory variables for the observed interactions. Expand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
BIASED SAMPLING; THE NONCENTRAL HYPERGEOMETRIC PROBABILITY DISTRIBUTION
Abstract : Consider a set S of L elements which is dichotomized in some manner (say, by an observable characteristic) into subsets M and N containing m and n = L - m elements, respectively, and aExpand
The Asymptotic Number of Labeled Graphs with Given Degree Sequences
TLDR
Asymptotics are obtained for the number of n × n symmetric non-negative integer matrices subject to the following constraints: each row sum is specified and bounded, and a specified “sparse” set of entries must be zero. Expand
...
1
2
...