Unicyclic Components in Random Graphs

The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this distribution decays algebraically, Uk (4k)?1 for k 1. As a result, the total number of unicyclic components grows logarithmically with the system size.

• Publication year

  2004

• Venue

  arXiv.org

• Publication date

  2004-03-17

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1088/0305-4470/37/18/L01arXiv cond-mat/0403453
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction To Percolation Theory

  2018cited by this paper
• PHYSIK

  2018cited by this paper
• Random graphs

  2006cited by this paper
• Cycles and Unicyclic Components in Random Graphs

  2003cited by this paper
• Leadership statistics in random structures

  2003cited by this paper
• Random planar lattices and integrated superBrownian excursion

  2002cited by this paper
• Community structure in social and biological networks

  2001cited by this paper
• A dynamic model of social network formation.

  2000cited by this paper
• Random graphs

  2000cited by this paper
• Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists

  1999cited by this paper
• Quantum Geometry: Monte Carlo simulations of random geometry

  1997cited by this paper
• Aggregation with multiple conservation laws.

  1995cited by this paper
• Principles of Polymer Chemistry

  1995cited by this paper
• An introduction to percolation

  1994cited by this paper
• The Birth of the Giant Component

  1993cited by this paper
• Fluctuations in coagulating systems

  1987cited by this paper
• Coagulation equations with gelation

  1983cited by this paper
• Coagulation in finite systems

  1978cited by this paper
• A Census of Planar Maps

  1963cited by this paper
• A Census of Planar Triangulations

  1962cited by this paper
• ON AN INFINITE SET OF NON-LINEAR DIFFERENTIAL EQUATIONS

  1962cited by this paper
• A Census of Slicings

  1962cited by this paper
• ON A RECURRENCE FORMULA IN DIFFERENTIAL EQUATIONS

  1962cited by this paper
• A Census of Hamiltonian Polygons

  1962cited by this paper
• Theory of Molecular Size Distribution and Gel Formation in Branched‐Chain Polymers

  1943cited by this paper
• Molecular Size Distribution in Three Dimensional Polymers. I. Gelation1

  1941cited by this paper
• AND T

  year unknowncited by this paper

• Simple evolving random graphs.

  2023influential citation
• Cyclization in bipartite random graphs.

  2020cites this paper
• Эволюционные уравнения и случайные графы

  2019cites this paper
• Cyclization in finite random graphs

  2018cites this paper
• An exactly solvable model of polymerization

  2017cites this paper
• Native ultrametricity of sparse random ensembles

  2015cites this paper
• Dynamics of random graphs with bounded degrees

  2011cites this paper
• Thèse présentée pour l'obtention du diplôme de Docteur de Télécom & Management SudParis

  2011cites this paper
• Synthèse de réseaux à composantes connexes unicycliques

  2009cites this paper
• Thèse présentée pour l'obtention du diplôme de DOCTEUR DE L'INSTITUT NATIONAL DES TELECOMMUNICATIONS

  2009cites this paper