On a characteristic of a conditional distribution of configuration graph

Abstract We consider configuration graphs with N vertices. The vertex degrees are independent identically distributed random variables and for any vertex of the graph the distribution of its degree η satisfies the following condition: <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block"> <m:mrow> <m:mi mathvariant="bold">P</m:mi> </m:mrow> <m:mo fence="false" stretchy="false">{</m:mo> <m:mi>η</m:mi> <m:mo>=</m:mo> <m:mi>k</m:mi> <m:mo fence="false" stretchy="false">}</m:mo> <m:mo>∼</m:mo> <m:mfrac> <m:mi>d</m:mi> <m:mrow> <m:msup> <m:mi>k</m:mi> <m:mi>g</m:mi> </m:msup> <m:mrow> <m:msup> <m:mo form="prefix">ln</m:mo> <m:mi>h</m:mi> </m:msup> </m:mrow> <m:mi>k</m:mi> </m:mrow> </m:mfrac> <m:mo>,</m:mo> <m:mspace width="1em"/> <m:mi>k</m:mi> <m:mo stretchy="false">→</m:mo> <m:mi mathvariant="normal">∞</m:mi> <m:mo>,</m:mo> </m:math> $$\mathbf{P}\{\eta=k\} \sim \frac{d}{k^g \ln ^h k}, \quad k \rightarrow \infty,$$ where d &gt; 0, h ⩾ 0, 2 &lt; g &lt; 3. We obtain the limit distributions of the maximal degree of vertices in the configuration graph as N , n → ∞and n / N (3 g −4)/(2 g −2) → ∞under the conditions that the sum of vertex degrees is n .

Authors

Institutions

Publication Details

Journal
Discrete Mathematics and Applications
Published
2025-10-01
DOI
https://doi.org/10.1515/dma-2025-0022
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On a characteristic of a conditional distribution of configuration graph

Irina Aleksandrovna Cheplyukova
Discrete Mathematics and Applications
Complex Network Analysis Techniques
article

On a characteristic of a conditional distribution of configuration graph

Irina Aleksandrovna Cheplyukova
article en

Abstract

Abstract We consider configuration graphs with N vertices. The vertex degrees are independent identically distributed random variables and for any vertex of the graph the distribution of its degree η satisfies the following condition: <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block"> <m:mrow> <m:mi mathvariant="bold">P</m:mi> </m:mrow> <m:mo fence="false" stretchy="false">{</m:mo> <m:mi>η</m:mi> <m:mo>=</m:mo> <m:mi>k</m:mi> <m:mo fence="false" stretchy="false">}</m:mo> <m:mo>∼</m:mo> <m:mfrac> <m:mi>d</m:mi> <m:mrow> <m:msup> <m:mi>k</m:mi> <m:mi>g</m:mi> </m:msup> <m:mrow> <m:msup> <m:mo form="prefix">ln</m:mo> <m:mi>h</m:mi> </m:msup> </m:mrow> <m:mi>k</m:mi> </m:mrow> </m:mfrac> <m:mo>,</m:mo> <m:mspace width="1em"/> <m:mi>k</m:mi> <m:mo stretchy="false">→</m:mo> <m:mi mathvariant="normal">∞</m:mi> <m:mo>,</m:mo> </m:math> $$\mathbf{P}\{\eta=k\} \sim \frac{d}{k^g \ln ^h k}, \quad k \rightarrow \infty,$$ where d &gt; 0, h ⩾ 0, 2 &lt; g &lt; 3. We obtain the limit distributions of the maximal degree of vertices in the configuration graph as N , n → ∞and n / N (3 g −4)/(2 g −2) → ∞under the conditions that the sum of vertex degrees is n .

Discrete Mathematics and ApplicationsVol. 35(5)
Karelian Research Centre (RU)
Openalex Percentile: Top 27%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On a characteristic of a conditional distribution of configuration graph — Irina Aleksandrovna Cheplyukova · Discrete Mathematics and Applications (2025) | TGRS Research Map | TGRS