42 citations · 302 across the 23 of their papers we have counts for
24 papers
Unified framework for asymptotically uniform iterative construction of generalised random graphs with local constraints
Ivan Kryven, Rik Versendaal, Mike de Vries
We develop a unified framework for constructing combinatorial structures under local constraints. Our approach extends the configuration model for random graphs with a prescribed d…
Stable coexistence in indefinitely large systems of competing species
M. N. Mooij, M. Baudena, A. S. von der Heydt +1
The Lotka-Volterra system is a set of ordinary differential equations describing growth of interacting ecological species. This model has gained renewed interest in the context of…
Branching process representation for nonlinear first-order conservation PDEs in 1D
Jochem Hoogendijk, Ivan Kryven
We show that a large class of 1D first-order conservation PDEs can be probabilistically represented using multi-type branching processes. The representation holds when the initial…
Sequential construction of spatial networks with arbitrary degree sequence and edge length distribution
Ivan Kryven, Rik Versendaal
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some…
Critical time-dependent branching process modelling epidemic spreading with containment measures
Hanlin Sun, Ivan Kryven, Ginestra Bianconi
During the COVID pandemic, periods of exponential growth of the disease have been mitigated by containment measures that in different occasions have resulted in a power-law growth…
Giant component in the configuration model under geometric constraints
Ivan Kryven, Rik Versendaal
We study the emergence of a giant component in the configuration model subject to additional constraints on the edges. We partition a -dimensional torus into a cubic lattice wit…
Sequential stub matching for uniform generation of directed graphs with a given degree sequence
Femke van Ieperen, Ivan Kryven
Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised…
Percolation of a strongly connected component in simple directed random graphs with a given degree distribution
Femke van Ieperen, Ivan Kryven
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probabilit…
Contact tracing in configuration models
Ivan Kryven, Clara Stegehuis
Quarantining and contact tracing are popular ad hoc practices for mitigating epidemic outbreaks. However, few mathematical theories are currently available to asses the role of a n…
Effect of different monomer precursors with identical functionality on the properties of the polymer network
Ariana Torres-Knoop, Verena Schamboeck, Nitish Govindarajan +2
Thermo-mechanical properties of polymer networks depend on functionality of the monomer precursors -- an association that is frequently exploited in materials science. We use molec…
Networks with degree-degree correlations is a special case of edge-coloured random graphs
Samuel, G. Balogh, Gergely Palla +1
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 a…
Percolation on branching simplicial and cell complexes and its relation to interdependent percolation
Ginestra Bianconi, Ivan Kryven, Robert M. Ziff
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical pe…
Renormalization group for link percolation on planar hyperbolic manifolds
Ivan Kryven, Robert M. Ziff, Ginestra Bianconi
Network geometry is currently a topic of growing scientific interest as it opens the possibility to explore and interpret the interplay between structure and dynamics of complex ne…
Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
Ivan Kryven, Ginestra Bianconi
Determining design principles that boost robustness of interdependent networks is a fundamental question of engineering, economics, and biology. It is known that maximizing the deg…
Dynamic Networks that Drive the Process of Irreversible Step-Growth Polymerization
Verena Schamboeck, Piet D. Iedema, Ivan Kryven
Many research fields, reaching from social networks and epidemiology to biology and physics, have experienced great advance from recent developments in random graphs and network th…
Learning heterogenous reaction rates from stochastic simulations
Ariana Torres-Knoop, Ivan Kryven
Reaction rate equations are ordinary differential equations that are frequently used to describe deterministic chemical kinetics at the macroscopic scale. At the microscopic scale,…
How does bond percolation happen in coloured networks?
Ivan Kryven
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the c…
Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions
I. Kryven
This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges…
General expression for the component size distribution in infinite configuration networks
Ivan Kryven
In the infinite configuration network the links between nodes are assigned randomly with the only restriction that the degree distribution has to match a predefined function. This…
Random graph approach to multifunctional molecular networks
Ivan Kryven, Jorien Duivenvoorden, Joen Hermans +1
Formation of a molecular network from multifunctional precursors is modelled with a random graph process. The random graph model favours reactivity for monomers that are positioned…
Emergence of the giant weak-component in directed random graphs with arbitrary degree distributions
Ivan Kryven
The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for direc…
Stabilization with residual-free bubbles for advection-dominated transport equations
I. Kryven, V. Kukharskyy, Ya. Savula
An improved numerical scheme is proposed for advection-dominated advection-diffusion problem. The scheme is based on Galerkin finite element method (FEM) with basis enriched with a…
Analytical results on the polymerisation random graph model
Ivan Kryven
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same…
Predicting multidimensional distributive properties of hyperbranched polymer resulting from AB2 polymerization with substitution, cyclization and shielding
Ivan Kryven, Piet D. Iedema
A deterministic mathematical model for the polymerization of hyperbranched molecules accounting for substitution, cyclization, and shielding effect has been developed as a system o…