How to calculate the main characteristics of random graphs - a new approach
Agata Fronczak, Piotr Fronczak, Janusz A. Holyst
Abstract
The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the main network characteristics like: the position of the phase transition at which a giant component first forms, the mean component size below the phase transition, the size of the giant component and the average path length above the phase transition. Although most of the enumerated properties were previously calculated by means of generating functions, we think that our derivations are conceptually much simpler.
Create a lesson
Related papers
Dynamically Reentrant Skyrmion Phase in Oscillating Magnetic Fields
Z. Demir Vatansever, E. Vatansever, A. Vasilopoulos et al.
Mutual linearity in semi-Markov networks
Julian B. Voits, Ulrich S. Schwarz
Steady states in asymmetric exclusion processes with reactions: Fluctuations and non-mean field behaviour
Rohn Chatterjee, Atri Goswami, Sudip Mukherjee
Marginal Operator Deformations and Pseudocriticality in Baxter--Wu Models
Hyun-Yong Lee, Naoki Kawashima, Nikolaos G. Fytas et al.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
Yansheng Liu, Daoguang Li, Kaixiang Lu et al.
Brownian gyrator model with stochastic resetting
Satya N. Majumdar, Gregory Schehr, Pascal Viot et al.