activity
20122022
most citedOn the swap-distances of different realizations of a graphical degree sequence

28 citations · 43 across the 6 of their papers we have counts for

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO2022★ 2 cited

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…

math.CO2022★ 3 cited

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…

math.CO2016★ 6 cited

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…

math.CO2012

Regular families of forests, antichains and duality pairs of relational structures

Péter L. Erdős, Dömötör Pálvölgyi, Claude Tardif +1

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully char…

math.CO2012★ 28 cited

On the swap-distances of different realizations of a graphical degree sequence

Péter L. Erdős, Zoltán Király, István Miklós

One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the…