Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions.

@article{Kryven2017FiniteCC,
  title={Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions.},
  author={Ivan Kryven},
  journal={Physical review. E},
  year={2017},
  volume={96 5-1},
  pages={
          052304
        }
}
  • I. Kryven
  • Published 2017
  • Mathematics, Medicine, Physics
  • Physical review. E
This work presents exact expressions for size distributions of weak and multilayer connected components in two generalizations of the configuration model: networks with directed edges and multiplex networks with an arbitrary number of layers. The expressions are computable in a polynomial time and, under some restrictions, are tractable from the asymptotic theory point of view. If first partial moments of the degree distribution are finite, the size distribution for two-layer connected… Expand
Networks with degree-degree correlations is a special case of edge-coloured random graphs
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary jointExpand
Networks with degree–degree correlations are special cases of the edge-coloured random graph
In complex networks, the degrees of adjacent nodes may often appear dependent—which presents a modelling challenge. We present a working framework for studying networks with an arbitrary jointExpand
Connectivity of a general class of inhomogeneous random digraphs
TLDR
It is shown that by choosing the joint distribution of the vertex attributes according to a multivariate regularly varying distribution, one can obtain scale-free graphs with arbitrary in-degree/outdegree dependence. Expand
Effect of volume growth on the percolation threshold in random directed acyclic graphs with a given degree distribution.
TLDR
It is proved that for a given degree distribution the percolation threshold for weakly connected components is not affected by the volume growth function, and it is shown that the size of the giant component and the cyclomatic number areNot affected by volume scaling. Expand
Large deviation theory of percolation on multiplex networks
  • G. Bianconi
  • Mathematics, Physics
  • Journal of Statistical Mechanics: Theory and Experiment
  • 2019
Recently, increasing attention has been paid to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize theExpand
Universality for the directed configuration model with random degrees: metric space convergence of the strongly connected components at criticality
We consider the strongly connected components (SCCs) of a uniform directed graph on n vertices with i.i.d. degree tuples distributed as (D−, D), with E[D] = E[D−] = μ. We condition on the totalExpand
Bond percolation in coloured and multiplex networks
  • I. Kryven
  • Medicine, Physics
  • Nature Communications
  • 2019
TLDR
A generic analytic theory is established that describes how structure and sizes of all connected components in the network are affected by simple and colour-dependent bond percolations in coloured networks. Expand
Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions.
TLDR
It is shown that increased robustness might also come at the expense of introducing multiple phase transitions, revealing yet another possible source of fragility of multiplex networks that has to be taken into the account during network optimization and design. Expand
Dynamic Networks that Drive the Process of Irreversible Step-Growth Polymerization
TLDR
This paper proposes a generic model of step-growth polymerisation as a promising application of the percolation on a directed random graph, used to manufacture a broad range of polymeric materials, including: polyesters, polyurethanes, polyamides, and many others. Expand
Automated reaction generation for polymer networks
TLDR
A new modeling approach to complex polymerization is introduced that automatically constructs a reaction network, solves kinetic model, and retrieves such topological properties of the final polymer network as, for instance, distribution of molecular weight. Expand
...
1
2
...

References

SHOWING 1-10 OF 45 REFERENCES
MATH
Abstract: About a decade ago, biophysicists observed an approximately linear relationship between the combinatorial complexity of knotted DNA and the distance traveled in gel electrophoresisExpand
Mathematical Proceedings of the Cambridge Philosophical Society
The main purpose is to characterise continuous maps that are n-branched coverings in terms of induced maps on the rings of functions. The special properties of Frobenius nhomomorphisms between twoExpand
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
Phys
  • Rev. E 94, 012315
  • 2016
Phys
  • Rev. E 64, 026118
  • 2001
Physical review E 64
  • 026118
  • 2001
in Mathematical Proceedings of the Cambridge Philosophical Society
  • Vol. 56
  • 1960
Chem
  • 2017
Journal of Mathematical Chemistry
  • 10.1007/s10910
  • 2017
Journal of Mathematical Chemistry
  • 10.1007/s10910
  • 2017
...
1
2
3
4
5
...