Results 21 to 30 of about 595,721 (280)
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
On comparing configuration graphs robustness in a random environment
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with vertex degrees distributed independently according to the power law, with a truncated parameter τ normally distributed on the interval (a, b).
Marina Leri
doaj +1 more source
Configurations graphs of neighbourhood geometries
Contributions to Discrete Mathematics, 2008 Contributions to Discrete Mathematics, Vol 3, No 1 (2008)
ABREU M +3 more
openaire +2 more sources
Limit distributions of vertex degrees in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices.
Irina Chepliukova, Yuri Pavlov
doaj +1 more source
Limit theorems for assortativity and clustering in null models for scale-free networks [PDF]
, 2019 An important problem in modeling networks is how to generate a randomly sampled graph with given degrees. A popular model is the configuration model, a network with assigned degrees and random connections.
Litvak, Nelly +3 more
core +3 more sources
On coherent configuration of circular-arc graphs [PDF]
Communications in Combinatorics and OptimizationFor any graph, Weisfeiler and Leman assigned the smallest matrix algebra which contains the adjacency matrix of the graph. The coherent configuration underlying this algebra for a graph $\Gamma$ is called the coherent configuration of $\Gamma ...
Fatemeh Raei Barandagh +1 more
doaj +1 more source
Partitioning Complex Networks via Size-constrained Clustering [PDF]
, 2014 The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until ...
B. Hendrickson +10 more
core +1 more source
A Self-Adapting IoT Network Configuration Supported by Distributed Graph Transformations
Applied Sciences, 2023 The research described in this article aims to propose the creation of a framework that would enable the self-optimization of IoT device networks.
Leszek Jaskierny, Leszek Kotulski
doaj +1 more source
ON THE MAXIMUM OF THE MODULARITY OF RANDOM CONFIGURATION GRAPHS
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 Configuration graphs with random independent identically distributed vertex degrees are considered. The degrees are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
Bounds for the pebbling number of product graphs [PDF]
Transactions on Combinatorics, 2022 Let $G$ be a connected graph. Given a configuration of a fixed number of pebbles on the vertex set of $G$, a pebbling move on $G$ is the process of removing two pebbles from a vertex and adding one pebble on an adjacent vertex. The pebbling number of $G$,
Nopparat Pleanmani +2 more
doaj +1 more source