2011
DOI: 10.1088/1367-2630/13/8/083001
|View full text |Cite
|
Sign up to set email alerts
|

Analytical maximum-likelihood method to detect patterns in real networks

Abstract: In order to detect patterns in real networks, randomized graph ensembles that preserve only part of the topology of an observed network are systematically used as fundamental null models. However, their generation is still problematic. The existing approaches are either computationally demanding and beyond analytic control, or analytically accessible but highly approximate. Here we propose a solution to this long-standing problem by introducing a fast method that allows to obtain expectation values and standar… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

10
590
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 246 publications
(606 citation statements)
references
References 48 publications
(136 reference statements)
10
590
0
Order By: Relevance
“…For example, sequential algorithms based on the properties of graphical sequences were proposed for undirected networks [9,10] and directed networks [11]. Another example is a grand-canonical model in [12] that generates a graph with given average degrees using a maximum-entropy method. However, to the best of our knowledge, none of these methods has an efficient implementation.…”
Section: Introductionmentioning
confidence: 99%
“…For example, sequential algorithms based on the properties of graphical sequences were proposed for undirected networks [9,10] and directed networks [11]. Another example is a grand-canonical model in [12] that generates a graph with given average degrees using a maximum-entropy method. However, to the best of our knowledge, none of these methods has an efficient implementation.…”
Section: Introductionmentioning
confidence: 99%
“…This can be done analytically, by means of the probabilities appearing in eq. (1.8) [28]. The effectiveness of the degree sequence in reproducing other topological properties of the ITN is shown in fig.…”
Section: Fermi-dirac Statisticsmentioning
confidence: 98%
“…The resulting model is known as the Configuration Model, and is defined as a maximum-entropy ensemble of graphs with given degree sequence [26,28]. The degree sequence, which is the constraint defining the model, is nothing but the ordered vector k of degrees of all vertices (where the ith component k i is the degree of vertex i).…”
Section: Fermi-dirac Statisticsmentioning
confidence: 99%
See 1 more Smart Citation
“…We expect, for example, the Netherlands to trade abundantly with Germany not just because of their geographic proximity, but because Germany is a hub in the European trading network. Therefore, to carve out the purely spatial information found in trading relationships, we need to disentangle spatial and non-spatial (topological effects) using a null model based on exponential random graph theory and maximum entropy graph ensembles [49]. A maximum entropy graph ensemble is, in essence, a sample of randomized networks that conserve some desired properties similar to the network under investigation, say the in and out degree sequence (or in and out strength sequence for weighted networks).…”
Section: Modelling Rebound Effect With Network Theorymentioning
confidence: 99%