36 citations · 216 across the 28 of their papers we have counts for
4 papers · 1 filter
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
Péter L. Erdős, István Miklós, Zoltán Toroczkai
A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the g…
On Realizations of a Joint Degree Matrix
Éva Czabarka, Aaron Dutle, Péter Erdös +1
The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform…
Modulated String Searching
Alberto Apostolico, Péter L. Erdős, István Miklós +1
In his 1987 paper entitled "Generalized String Matching", Abrahamson introduced {\em pattern matching with character classes} and provided the first efficient algorithm to solve it…
Constructing, sampling and counting graphical realizations of restricted degree sequences
Péter L. Erdös, Sándor Z. Kiss, István Miklós +1
With the current burst of network theory (especially in connection with social and biological networks) there is a renewed interest on realizations of given degree sequences. In th…