On the number of circuits in random graphs Export

@article{citeulike:566072, abstract = {We apply in this paper (non-rigorous) statistical mechanics methods to the problem of counting long circuits in graphs. The outcomes of this approach have two complementary flavours. On the algorithmic side, we propose an approximate counting procedure, valid in principle for a large class of graphs. On a more theoretical side, we study the typical number of long circuits in random graph ensembles, reproducing rigorously known results and stating new conjectures.}, archivePrefix = {arXiv}, author = {{Marinari}, E. and {Semerjian}, G.}, citeulike-article-id = {566072}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0603657}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0603657}, citeulike-linkout-2 = {http://dx.doi.org/10.1088/1742-5468/2006/06/P06019}, citeulike-linkout-3 = {http://adsabs.harvard.edu/cgi-bin/nph-bib_query?bibcode=2006JSMTE..06..019M}, day = {24}, doi = {10.1088/1742-5468/2006/06/P06019}, eprint = {cond-mat/0603657}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, keywords = {graphs, random}, month = {June}, posted-at = {2009-10-29 12:47:08}, priority = {2}, title = {On the number of circuits in random graphs}, url = {http://dx.doi.org/10.1088/1742-5468/2006/06/P06019}, volume = {6}, year = {2006} }

TY - JOUR ID - citeulike:566072 L3 - citeulike-article-id:566072 N2 - We apply in this paper (non-rigorous) statistical mechanics methods to the problem of counting long circuits in graphs. The outcomes of this approach have two complementary flavours. On the algorithmic side, we propose an approximate counting procedure, valid in principle for a large class of graphs. On a more theoretical side, we study the typical number of long circuits in random graph ensembles, reproducing rigorously known results and stating new conjectures. JF - Journal of Statistical Mechanics: Theory and Experiment TI - On the number of circuits in random graphs VL - 6 KW - graphs KW - random AU - {Marinari}, E AU - {Semerjian}, G PY - 2006/June/24/ UR - http://dx.doi.org/10.1088/1742-5468/2006/06/P06019 ER -