research
∙
07/09/2023
On the Small Quasi-kernel conjecture
The Chvátal-Lovász theorem from 1974 establishes in every finite digraph...
share
research
∙
04/20/2022
Approximate Sampling of Graphs with Near-P-stable Degree Intervals
The approximate uniform sampling of graph realizations with a given degr...
research
∙
11/23/2021
Degree-preserving graph dynamics – a versatile process to construct random networks
Real-world networks evolve over time via additions or removals of nodes ...
research
∙
11/01/2021
Algorithms for Interference Minimization in Future Wireless Network Decomposition
We propose a simple and fast method for providing a high quality solutio...
research
∙
09/05/2019
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing
One of the simplest methods of generating a random graph with a given de...
research
∙
03/15/2019
The mixing time of the swap (switch) Markov chains: a unified approach
Since 1997 a considerable effort has been spent to study the mixing time...
research
∙
08/25/2017