4 citations · 9 across the 3 of their papers we have counts for
4 papers
Approximate Sampling of Graphs with Near--stable Degree Intervals
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One…
New results on graph matching from degree preserving growth
Péter L. Erdős, Shubha R. Kharel, Tamás Róbert Mezei +1
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into th…
Rooted NNI moves on tree-based phylogenetic networks
Péter L. Erdős, Andrew Francis, Tamás Róbert Mezei
We show that the space of rooted tree-based phylogenetic networks is connected under rooted nearest-neighbour interchange (rNNI) moves.
New classes of degree sequences with fast mixing swap Markov chain sampling
Péter L. Erdős, István Miklós, Zoltán Toroczkai
In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in form of graph measures. A mu…