Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
暂无分享,去创建一个
Sergey N. Dorogovtsev | Jose F. F. Mendes | S. Yoon | Alexander V. Goltsev | S. N. Dorogovtsev | A. Goltsev | J. Mendes | S. Yoon
[1] R. Palmer,et al. Solution of 'Solvable model of a spin glass' , 1977 .
[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[3] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[4] U. Alon. Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.
[5] Lenka Zdeborová,et al. Belief propagation for graph partitioning , 2009, ArXiv.
[6] S. Shen-Orr,et al. Superfamilies of Evolved and Designed Networks , 2004, Science.
[7] W. Marsden. I and J , 2012 .
[8] Sergey N. Dorogovtsev,et al. Ising Model on Networks with an Arbitrary Distribution of Connections , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] Joel C. Miller,et al. Percolation and epidemics in random clustered networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] R. Zecchina,et al. Ferromagnetic ordering in graphs with arbitrary degree distribution , 2002, cond-mat/0203416.
[11] Sergey N. Dorogovtsev,et al. Critical phenomena in complex networks , 2007, ArXiv.
[12] M. V. Rossum,et al. In Neural Computation , 2022 .
[13] Michael Chertkov,et al. Loop Calculus in Statistical Physics and Information Science , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[14] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.
[15] S. N. Dorogovtsev,et al. Evolution of networks , 2001, cond-mat/0106144.
[16] M. Marsili,et al. Loops of any size and Hamilton cycles in random scale-free networks , 2005, cond-mat/0502552.
[17] S. Shen-Orr,et al. Network motifs: simple building blocks of complex networks. , 2002, Science.
[18] S N Dorogovtsev,et al. Percolation on correlated networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[19] M. Newman. Properties of highly clustered networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[20] R. Baxter. Exactly solved models in statistical mechanics , 1982 .
[21] S. Brenner,et al. The structure of the nervous system of the nematode Caenorhabditis elegans. , 1986, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.
[22] Brendan J. Frey,et al. Graphical Models for Machine Learning and Digital Communication , 1998 .
[23] Marián Boguñá,et al. Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[24] G. Bianconi. Entropy of network ensembles. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[25] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[26] O. Sporns,et al. Motifs in Brain Networks , 2004, PLoS biology.
[27] G. Parisi,et al. Loop expansion around the Bethe–Peierls approximation for lattice models , 2005, cond-mat/0512529.
[28] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.
[29] Yoshiyuki Kabashima,et al. Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[30] Brian Karrer,et al. Message passing approach for general epidemic models. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[31] A. Hartmann. Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics , 2005 .
[32] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[33] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[34] Alessandro Pelizzola,et al. Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models , 2005, ArXiv.
[35] M. Pretti,et al. Stable propagation algorithm for the minimization of the Bethe free energy , 2003 .
[36] G. Bianconi,et al. Number of loops of size h in growing scale-free networks. , 2002, Physical review letters.
[37] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .
[38] M. Serrano,et al. Percolation and epidemic thresholds in clustered networks. , 2006, Physical review letters.
[39] Wolfgang Maass,et al. Belief Propagation in Networks of Spiking Neurons , 2009, Neural Computation.
[40] Hilbert J. Kappen,et al. On the properties of the Bethe approximation and loopy belief propagation on binary networks , 2004 .
[41] Marián Boguñá,et al. Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[42] Michael Chertkov,et al. Loop series for discrete statistical models on graphs , 2006, ArXiv.
[43] M E J Newman,et al. Random graphs with clustering. , 2009, Physical review letters.
[44] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[45] Mark E. J. Newman,et al. Random graphs containing arbitrary distributions of subgraphs , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[46] Ginestra Bianconi,et al. Algorithm for counting large directed loops , 2007, 0709.1446.
[47] A. Montanari,et al. How to compute loop corrections to the Bethe approximation , 2005, cond-mat/0506769.
[48] Jun Ohkubo,et al. Statistical-mechanical iterative algorithms on complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.