27 citations · 34 across the 5 of their papers we have counts for
5 papers
Half-graphs, other non-stable degree sequences, and the switch Markov chain
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2
One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…
Edge Disjoint Caterpillar Realizations
István Miklós, Geneva Schlafly, Yuheng Wang +1
In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give the necessary and sufficient conditions when two tree degree sequences have…
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…
Degree-based graph construction
Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…
Mathematical Framework for Phylogenetic Birth-And-Death Models
Miklós Csűrös, István Miklós
A phylogenetic birth-and-death model is a probabilistic graphical model for a so-called phylogenetic profile, i.e., the size distribution for a homolog gene family at the terminal…