Fetching the paper…
Reading the bibliography…
In the last 15 years, statistical physics has been a very successful framework to model complex networks.
J. Neyman and E. S. Pearson, “On the problem of the most efficient tests of statistical hypotheses,” Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 231
1933
Earlier work this paper cites.
E. T. Jaynes, “Information theory and statistical mechanics,” Physical Review 106
1957
Earlier work this paper cites.
P. Erdős and A. Rényi, “On random graphs,” Publicationes Mathematicae Debrecen 6
1959
Earlier work this paper cites.
W. K. Hastings, “Monte carlo sampling methods using markov chains and their applications,” Biometrika 57
1970
Earlier work this paper cites.
H. Akaike, “A new look at the statistical model identification,” IEEE Transactions on Automatic Control 19
1974
Earlier work this paper cites.
J. Shore and R. Johnson, “Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy,” IEEE Transactions on Information Theory 26
1980
Earlier work this paper cites.
P. W. Holland and S. Leinhardt, “An exponential family of probability distributions for directed graphs,” Journal of the American Statistical Association 76
1981
Earlier work this paper cites.
E. T. Jaynes, “On the rationale of maximum-entropy methods,” Proceedings of the IEEE 70
1982
Earlier work this paper cites.
O. Frank and D. Strauss, “Markov graphs,” Journal of the American Statistical Association 81
1986
Earlier work this paper cites.
D. Strauss, “On a general class of models for interaction,” SIAM Review 28
1986
Earlier work this paper cites.
D. Strauss and M. Ikeda, “Pseudolikelihood estimation for social networks,” Journal of the American Statistical Association 85
1990
Earlier work this paper cites.
S. Wasserman and P. Pattison, “Logit models and logistic regressions for social networks: I. an introduction to markov graphs and p p ,” Psychometrika 61
1996
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of small-world networks,” Nature 393
1998
Earlier work this paper cites.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science 286
1999
Earlier work this paper cites.
C. J. Anderson, S. Wasserman, and B. Crouch, “A p* primer: Logit models for social networks,” Social Networks 21
1999
Earlier work this paper cites.
L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, “Classes of small-world networks,” Proceedings of the National Academy of Sciences 97
2000
Earlier work this paper cites.
S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, “Structure of growing networks with preferential linking,” Physical Review Letters 85
2000
Earlier work this paper cites.
S. H. Yook, H. Jeong, A.-L. Barabási, and Y. Tu, “Weighted evolving networks,” Physical Review Letters 86
2001
Earlier work this paper cites.
G. Bianconi and A.L. Barabási, “Bose-einstein condensation in complex network,” Physical Review Letters 86
2001
Earlier work this paper cites.
Fugao Wang and D. P. Landau, “Efficient, multiple-range random walk algorithm to calculate the density of states,” Physical Review Letters 86
2001
Earlier work this paper cites.
M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Random graphs with arbitrary degree distributions and their applications,” Physical Review E 64
2001
Earlier work this paper cites.
R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics 74
2002
Earlier work this paper cites.
G. Caldarelli, A. Capocci, P. De Los Rios, and M. a Muñoz, “Scale-free networks from varying vertex intrinsic fitness,” Physical Review Letters 89
2002
Earlier work this paper cites.
S. Maslov and K. Sneppen, “Specificity and stability in topology of protein networks,” Science 296
2002
Earlier work this paper cites.
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: Simple building blocks of complex networks,” Science 298
2002
Earlier work this paper cites.
S. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon, “Network motifs in the transcriptional regulation network of escherichia coli,” Nature Genetics 31
2002
Earlier work this paper cites.
J. Berg and M. Lässig, “Correlated random networks,” Physical Review Letters 89
2002
Earlier work this paper cites.
K. P. Burnham and D. R. Anderson, Model Selection and Multimodel Inference: A Practical Information-Theoretic Approach (Springer-Verlag New York, 2002)
2002
Earlier work this paper cites.
M. E. J. Newman, “The structure and function of complex networks,” SIAM Review 45
2003
Earlier work this paper cites.
J. Park and M. E. J. Newman, “Origin of degree correlations in the internet and other networks,” Physical Review E 68
2003
Earlier work this paper cites.
M. Á. Serrano and M. Boguñá, “Topology of the world trade web,” Physical Review E 68
2003
Earlier work this paper cites.
P. Holme, F. Liljeros, C. R. Edling, and B. J. Kim, “Network bipartivity,” Physical Review E 68
2003
Earlier work this paper cites.
D. S. Goldberg and F. P. Roth, “Assessing experimentally derived interactions in a small world,” Proceedings of the National Academy of Sciences 100
2003
Earlier work this paper cites.
M. Boguñá and R. Pastor-Satorras, “Class of correlated random networks with hidden variables,” Physical Review E 68
2003
Earlier work this paper cites.
Z. Burda and A. Krzywicki, “Uncorrelated random networks,” Physical Review E 67
2003
Earlier work this paper cites.
M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E 69
2004
Earlier work this paper cites.
J. Park and M. E. J. Newman, “Statistical mechanics of networks,” Physical Review E 70
2004
Earlier work this paper cites.
S. Maslov, K. Sneppen, and A. Zaliznyak, “Detection of topological patterns in complex networks: Correlation profile of the internet,” Physica A: Statistical Mechanics and its Applications 333
2004
Earlier work this paper cites.
M. E. J. Newman, “Analysis of weighted networks,” Physical Review E 70
2004
Earlier work this paper cites.
R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, “Modularity from fluctuations in random graphs and complex networks,” Physical Review E 70
2004
Earlier work this paper cites.
S. J. Wells, Financial interlinkages in the United Kingdom’s interbank market and the risk of contagion , Working Paper 230 (Bank of England, 2004)
2004
Earlier work this paper cites.
M. E. J. Park, J.and Newman, “Solution of the two-star model of a network,” Physical Review E 70
2004
Earlier work this paper cites.
S. Itzkovitz, R. Milo, N. Kashtan, M. E. J. Newman, and U. Alon, “Reply to “comment on ‘subgraphs in random networks’ ”,” Physical Review E 70
2004
Earlier work this paper cites.
M. Boguñá, R. Pastor-Satorras, and A. Vespignani, “Cut-offs and finite size effects in scale-free networks,” The European Physical Journal B 38
2004
Earlier work this paper cites.
E.-J. Wagenmakers and S. Farrell, “Aic model selection using akaike weights,” Psychonomic Bulletin & Review 11
2004
Earlier work this paper cites.
K. P. Burnham and D. R. Anderson, “Multimodel inference: Understanding aic and bic in model selection,” Sociological Methods & Research 33
2004
Earlier work this paper cites.
M. Á. Serrano and M. Boguñá, “Weighted configuration model,” AIP Conference Proceedings 776
2005
Earlier work this paper cites.
D. Garlaschelli and M. I. Loffredo, “Structure and evolution of the world trade network,” Physica A: Statistical Mechanics and its Applications 355
2005
Earlier work this paper cites.
M. Tumminello, T. Aste, T. Di Matteo, and R. N. Mantegna, “A tool for filtering information in complex systems,” Proceedings of the National Academy of Sciences 102
2005
Earlier work this paper cites.
D. Garlaschelli, S. Battiston, M. Castri, V. D.P. Servedio, and G. Caldarelli, “The scale-free topology of market investments,” Physica A: Statistical Mechanics and its Applications 350
2005
Earlier work this paper cites.
J. Park and M. E. J. Newman, “Solution for the properties of a clustered network,” Physical Review E 72
2005
Earlier work this paper cites.
Y. Artzy-Randrup and L. Stone, “Generating uniformly distributed random networks,” Physical Review E 72
2005
Earlier work this paper cites.
M. Catanzaro, M. Boguñá, and R. Pastor-Satorras, “Generation of uncorrelated random scale-free networks,” Physical Review E 71
2005
Earlier work this paper cites.
L. Demetrius and T. Manke, “Robustness and network evolution–an entropic principle,” Physica A: Statistical Mechanics and its Applications 346
2005
Earlier work this paper cites.
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, “Complex networks: Structure and dynamics,” Physics Reports 424
2006
Earlier work this paper cites.
T. A. B. Snijders, P. E. Pattison, G. L. Robins, and M. S. Handcock, “New specifications for exponential random graph models,” Sociological Methodology 36
2006
Earlier work this paper cites.
V. Colizza, A. Flammini, M. A. Serrano, and A. Vespignani, “Detecting rich-club ordering in complex networks,” Nature Physics 2
2006
Earlier work this paper cites.
M. Á. Serrano, M. Boguñá, and R. Pastor-Satorras, “Correlations in weighted networks,” Physical Review E 74
2006
Cited alongside, same era.
R. Guimerá, M. Sales-Pardo, and L. A. N. Amaral, “Classes of complex networks defined by role-to-role connectivity profiles,” Nature Physics 3
2006
Cited alongside, same era.
D. Garlaschelli and M. I. Loffredo, “Multispecies grand-canonical models for networks with reciprocity,” Physical Review E 73
2006
Cited alongside, same era.
G. Kossinets, “Effects of missing data in social networks,” Social Networks 28
2006
Cited alongside, same era.
G. De Masi, G. Iori, and G. Caldarelli, “Fitness model for the italian interbank money market,” Physical Review E 74
2006
Cited alongside, same era.
L. Tabourier, C. Roth, and J.-P. Cointet, “Generating constrained random graphs using multiple edge switches,” Journal of Experimental Algorithmics 16
2011
Later among the works it cites.
J. Blitzstein and P. Diaconis, “A sequential importance sampling algorithm for generating random graphs with prescribed degrees,” Internet Mathematics 6
2011
Later among the works it cites.
S. Melnik, A. Hackett, M. A. Porter, P. J. Mucha, and J. P. Gleeson, “The unreasonable effectiveness of tree-based theory for networks with clustering,” Physical Review E 83
2011
Later among the works it cites.
K. Anand, G. Bianconi, and S. Severini, “Shannon and von neumann entropy of random networks with heterogeneous expected degree,” Physical Review E 83
2011
Later among the works it cites.
T. Squartini and D. Garlaschelli, “Triadic motifs and dyadic self-organization in the world trade network,” in Self-Organizing Systems , edited by F. A. Kuipers and P. E. Heegaard (Springer Berlin Heidelberg, 2012) pp. 24–35
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, “Systematic topology analysis and generation using degree correlations,” SIGCOMM Comput. Commun. Rev. 36
2006
Cited alongside, same era.
S. L. Braunstein, S. Ghosh, and S. Severini, “The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states,” Annals of Combinatorics 10
2006
Cited alongside, same era.
G. Robins, P. Pattison, Y. Kalish, and D. Lusher, “An introduction to exponential random graph (p*) models for social networks,” Social Networks 29
2007
Cited alongside, same era.
S. E. Ahnert, D. Garlaschelli, T. M. A. Fink, and G. Caldarelli, “Ensemble approach to the analysis of weighted networks,” Physical Review E 76
2007
Cited alongside, same era.
J. Saramäki, M. Kivelä, J.-P. Onnela, K. Kaski, and J. Kertész, “Generalizations of the clustering coefficient to weighted complex networks,” Physical Review E 75
2007
Cited alongside, same era.
D. B. Stouffer, J. Camacho, W. Jiang, and L. A. N. Amaral, “Evidence for the existence of a robust pattern of prey selection in food webs,” Proceedings of the Royal Society of London B: Biological Sciences 274
2007
Cited alongside, same era.
J. Reichardt and S. Bornholdt, “Partitioning and modularity of graphs with arbitrary degree distribution,” Physical Review E 76
2007
Cited alongside, same era.
2012
Later among the works it cites.
T. P. Peixoto, “Entropy of stochastic blockmodel ensembles,” Physical Review E 85
2012
Later among the works it cites.
A. Tacchella, M. Cristelli, G. Caldarelli, A. Gabrielli, and L. Pietronero, “A new metrics for countries’ fitness and products’ complexity,” Scientific Reports 2
2012
Later among the works it cites.
G. Caldarelli, M. Cristelli, A. Gabrielli, L. Pietronero, A. Scala, and A. Tacchella, “A network analysis of countries’ export flows: Firm grounds for the building blocks of the economy,” PLoS ONE 7
2012
Later among the works it cites.
M. Tumminello, F. Lillo, J. Piilo, and R. N. Mantegna, “Identification of clusters of investors from their real trading activity in a financial market,” New Journal of Physics 14
2012
Later among the works it cites.
E. S. Roberts and A. C. C. Coolen, “Unbiased degree-preserving randomization of directed binary networks,” Physical Review E 85
2012
Later among the works it cites.
B. A. Desmarais and S. J. Cranmer, “Statistical mechanics of networks: Estimation and uncertainty,” Physica A: Statistical Mechanics and its Applications 391
2012
Later among the works it cites.
H. Kim, C. I. Del Genio, K. E. Bassler, and Z. Toroczkai, “Constructing and sampling directed graphs with given degree sequences,” New Journal of Physics 14
2012
Later among the works it cites.
S. Pressé, K. Ghosh, J. Lee, and K. A. Dill, “Principles of maximum entropy and maximum caliber in statistical physics,” Reviews of Modern Physics 85
2013
Later among the works it cites.
T. Squartini, I. van Lelyveld, and D. Garlaschelli, “Early-warning signals of topological collapse in interbank networks,” Scientific Reports 3
2013
Later among the works it cites.
P. Fronczak, A. Fronczak, and M. Bujok, “Exponential random graph models for networks with community structure,” Physical Review E 88
2013
Later among the works it cites.
Z. Neal, “Identifying statistically significant edges in one-mode projections,” Social Network Analysis and Mining 3
2013
Later among the works it cites.
E.-Á. Horvát and K. A. Zweig, “A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs,” Social Network Analysis and Mining 3
2013
Later among the works it cites.
N. Musmeci, S. Battiston, G. Caldarelli, M. Puliga, and A. Gabrielli, “Bootstrapping topological properties and systemic risk of complex networks using the fitness model,” Journal of Statistical Physics 151
2013
Later among the works it cites.
S. Chatterjee and P. Diaconis, “Estimating and understanding exponential random graph models,” 41
2013
Later among the works it cites.
G. Bianconi, “Statistical mechanics of multiplex networks: Entropy and overlap,” Physical Review E 87
2013
Later among the works it cites.
O. Sagarra, C. J. Pérez Vicente, and A. Díaz-Guilera, “Statistical mechanics of multiedge networks,” Physical Review E 88
2013
Later among the works it cites.
Z. Neal, “The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors,” Social Networks 39
2014
Later among the works it cites.
R. J. Mondragón, “Network null-model based on maximal entropy and the rich-club,” Journal of Complex Networks 2
2014
Later among the works it cites.
E. S. Roberts and A. C. C. Coolen, “Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods,” Journal of Physics A: Mathematical and Theoretical 47
2014
Later among the works it cites.
M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, “Multilayer networks,” Journal of Complex Networks 2
2014
Later among the works it cites.
S. Boccaletti, G. Bianconi, R. Criado, C. I. Del Genio, J. Gómez-Gardeñes, M. Romance, I. Sendiña-Nadal, Z. Wang, and M. Zanin, “The structure and dynamics of multilayer networks,” Physics Reports 544
2014
Later among the works it cites.
O. Sagarra, F. Font-Clos, C. J. Pérez-Vicente, and A. Díaz-Guilera, “The configuration multi-edge model: Assessing the effect of fixing node strengths on weighted network magnitudes,” Europhysics Letters 107
2014
Later among the works it cites.
K. Anand, D. Krioukov, and G. Bianconi, “Entropy distribution and condensation in random networks with a given degree distribution,” Physical Review E 89
2014
Later among the works it cites.
F. Saracco, R. Di Clemente, A. Gabrielli, and T. Squartini, “Randomizing bipartite networks: The case of the world trade web,” Scientific Reports 5
2015
Later among the works it cites.
R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, “Epidemic processes in complex networks,” Reviews of Modern Physics 87
2015
Later among the works it cites.
S. Horvát, É. Czabarka, and Z. Toroczkai, “Reducing degeneracy in maximum entropy models of networks,” Physical Review Letters 114
2015
Later among the works it cites.
C. Orsini, M. M. Dankulov, P. Colomer-de Simón, A. Jamakovic, P. Mahadevan, A. Vahdat, K. E. Bassler, Z. Toroczkai, M. Boguñá, G. Caldarelli, S. Fortunato, and D. Krioukov, “Quantifying randomness in real networks,” Nature Communications 6
2015
Later among the works it cites.
R. Fischer, J. C. Leitão, T. P. Peixoto, and E. G. Altmann, “Sampling motif-constrained ensembles of networks,” Physical Review Letters 115
2015
Later among the works it cites.
V. Gemmetto and D. Garlaschelli, “Multiplexity versus correlation: the role of local constraints in real multiplexes,” Scientific Reports 5
2015
Later among the works it cites.
O. Sagarra, C. J. Pérez Vicente, and A. Díaz-Guilera, “Role of adjacency-matrix degeneracy in maximum-entropy-weighted network models,” Physical Review E 92
2015
Later among the works it cites.
K. Zuev, O. Eisenberg, and D. Krioukov, “Exponential random simplicial complexes,” Journal of Physics A: Mathematical and Theoretical 48
2015
Later among the works it cites.
J.-C. Delvenne, R. Lambiotte, and L. E. C. Rocha, “Diffusion on networked systems is a question of time or structure,” Nature Communications 6
2015
Later among the works it cites.
R. Sandhu, T. Georgiou, E. Reznik, L. Zhu, I. Kolesov, Y. Senbabaoglu, and A. Tannenbaum, “Graph curvature for differentiating cancer networks,” Scientific Reports 5
2015
Later among the works it cites.
F. Saracco, R. Di Clemente, A. Gabrielli, and T. Squartini, “Detecting early signs of the 2007-2008 crisis in the world trade,” Scientific Reports 6
2016
Later among the works it cites.
S. Gualdi, G. Cimini, K. Primicerio, R. Di Clemente, and D. Challet, “Statistically validated network of portfolio overlaps and systemic risk,” Scientific Reports 6
2016
Later among the works it cites.
Mei Yin and Lingjiong Zhu, “Reciprocity in directed networks,” Physica A: Statistical Mechanics and its Applications 447
2016
Later among the works it cites.
M. De Domenico, C. Granell, M. A. Porter, and A. Arenas, “The physics of spreading processes in multilayer networks,” Nature Physics 12
2016
Later among the works it cites.
O. T. Courtney and G. Bianconi, “Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes,” Physical Review E 93
2016
Later among the works it cites.
M. De Domenico and J. Biamonte, “Spectral entropies as information-theoretic tools for complex network comparison,” Physical Review X 6
2016
Later among the works it cites.
R. Sandhu, T. Georgiou, and A. Tannenbaum, “Ricci curvature: An economic indicator for market fragility and systemic risk,” Science Advances 2
2016
Later among the works it cites.
2017
Later among the works it cites.
F. Saracco, M. J. Straka, R. Di Clemente, A. Gabrielli, G. Caldarelli, and T. Squartini, “Inferring monopartite projections of bipartite networks: An entropy-based approach,” New Journal of Physics 19
2017
Later among the works it cites.
M. J. Straka, G. Caldarelli, and F. Saracco, “Grand canonical validation of the bipartite international trade network,” Physical Review E 96
2017
Later among the works it cites.
2017
Later among the works it cites.
K. Anand, I. van Lelyveld, Á. Banai, S. Friedrich, R. Garratt, G. Hałaj, J. Fique, I. Hansen, S. Martínez-Jaramillo, H. Lee, J. L. Molina-Borboa, S. Nobili, S. Rajan, D. Salakhova, T. C. Silva, L. Silvestri, and S. R. Stancato de Souza, “The missing links: A global study on uncovering financial network structures from partial data,” Journal of Financial Stability , (in press) (2017)
2017
Later among the works it cites.
J.-G. Young, G. Petri, F. Vaccarino, and A. Patania, “Construction of and efficient sampling from the simplicial configuration model,” Physical Review E 96
2017
Later among the works it cites.
C. J. Carstens and K. J. Horadam, “Switching edges to randomize networks: what goes wrong and how to fix it,” Journal of Complex Networks 5
2017
Later among the works it cites.
N. Masuda, M. A. Porter, and R. Lambiotte, “Random walks and diffusion on networks,” Physics Reports 716-717
2017
Later among the works it cites.
2018
Closest in time.
T. Squartini, G. Caldarelli, G. Cimini, A. Gabrielli, and D. Garlaschelli, “Reconstruction methods for networks: The case of economic and financial systems,” Physics Reports 757
2018
Closest in time.
P. D. Dixit, J. Wagoner, C. Weistuch, S. Pressé, K. Ghosh, and K. A. Dill, “Perspective: Maximum caliber is a general variational principle for dynamical systems,” The Journal of Chemical Physics 148
2018
Closest in time.