Results 21 to 30 of about 16,346,212 (324)
An ensemble of random graphs with identical degree distribution [PDF]
Degree distribution, or equivalently called degree sequence, has been commonly used to study a large number of complex networks in the past few years. This reveals some intriguing results, for instance, the popularity of power-law distribution in most of
Fei Ma, Xiaomin Wang, Ping Wang
semanticscholar +1 more source
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution [PDF]
Even though power-law or close-to-power-law degree distributions are ubiquitously observed in a great variety of large real networks, the mathematically satisfactory treatment of random power-law graphs satisfying basic statistical requirements of ...
Pim van der Hoorn +2 more
semanticscholar +1 more source
Near-optimal distributed degree+1 coloring
We present a new approach to randomized distributed graph coloring that is simpler and more efficient than previous ones. In particular, it allows us to tackle the $(\operatorname{deg}+1)$-list-coloring (D1LC) problem, where each node $v$ of degree $d_v$ is assigned a palette of $d_v+1$ colors, and the objective is to find a proper coloring using these
Halldórsson, Magnús M. +3 more
openaire +2 more sources
Dynamical complexity as a proxy for the network degree distribution. [PDF]
We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the nodes is ...
A. Tlaie +4 more
semanticscholar +1 more source
Inhomogeneous random graphs are commonly used models for complex networks where nodes have varying degrees of connectivity. Computing the degree distribution of such networks is a fundamental problem and has important applications in various fields.
Róbert Pethes, Levente Kovács
doaj +1 more source
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution
Takayuki Nozaki +3 more
openaire +2 more sources
The Structure and First-Passage Properties of Generalized Weighted Koch Networks
Characterizing the topology and random walk of a random network is difficult because the connections in the network are uncertain. We propose a class of the generalized weighted Koch network by replacing the triangles in the traditional Koch network with
Jing Su, Mingjun Zhang, Bing Yao
doaj +1 more source
Influence of reciprocal edges on degree distribution and degree correlations [PDF]
Reciprocal edges represent the lowest-order cycle possible to find in directed graphs without self-loops. Representing also a measure of feedback between vertices, it is interesting to understand how reciprocal edges influence other properties of complex networks.
Štefančić, Hrvoje, Zlatić, Vinko
openaire +2 more sources
Neuronal networks in rodent barrel cortex are characterized by stable low baseline firing rates. However, they are sensitive to the action potentials of single neurons as suggested by recent single-cell stimulation experiments that report quantifiable ...
Juan Carlos Vasquez +2 more
doaj +1 more source
Insights on Streamflow Predictability Across Scales Using Horizontal Visibility Graph Based Networks
Streamflow is a dynamical process that integrates water movement in space and time within basin boundaries. The authors characterize the dynamics associated with streamflow time-series data from 64 U.S.
Ganesh R. Ghimire +4 more
doaj +1 more source

