Exactly solvable random graph ensemble with extensively many short cycles

DOI10.1088/1751-8121/aaa555zbMath1388.37052arXiv1705.03743OpenAlexW3099496226MaRDI QIDQ5373939

A. C. C. Coolen, Fabián Aguirre López, Mathilde Fekom, Paolo Barucca

Publication date: 6 April 2018

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.03743

zbMATH Keywords

transitivity2-regular random graphrandom graph ensemble

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (2)

Early warning indicators of epidemics on a coupled behaviour-disease model with vaccine hesitance and incomplete data ⋮ Imaginary replica analysis of loopy regular random graphs

Cites Work

• Unnamed Item
• A detailed investigation into near degenerate exponential random graphs
• Constrained Markovian dynamics of random graphs
• The expected eigenvalue distribution of a large regular graph
• The asymptotic number of labeled graphs with given degree sequences
• Estimating and understanding exponential random graph models
• Generating Random Networks and Graphs
• Sparse random graphs with clustering
• On a General Class of Models for Interaction
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• A critical point for random graphs with a given degree sequence
• The random triangle model
• The rise and fall of a networked society: A formal model

This page was built for publication: Exactly solvable random graph ensemble with extensively many short cycles