Quick search Find article
Quick search
Find article

Cycles in sparse random graphs

E Marinari and V V Kerrebroeck

Show affiliations


We study the cycles in sparse random graphs by treating them as a constraint satisfaction problem. We discuss how the model is defined, and the results that can be obtained in this way. In particular, we introduce and discuss an approximation to the self-avoiding walk-sum which emerges naturally from a slightly engineered version of the original problem.


PACS

05.40.Fb Random walks and Levy flights

02.10.Ox Combinatorics; graph theory

02.10.Yn Matrix theory

Subjects

Mathematical physics

Statistical physics and nonlinear systems

Dates

Issue 1 (2008)



Users also read

What's this?
This innovative new feature generates a list of articles 'also read' by other users based on them reading the original article. Article abstracts citations and references are all considered and weighted accordingly. We hope that this will help you find relevant papers for your research.

  1. On the number of circuits in random graphs
  2. Algorithm for counting large directed loops

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.