36 citations · 216 across the 28 of their papers we have counts for
6 papers · 1 filter
Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov ch…
Navigating Between Packings of Graphic Sequences
Peter L. Erdos, Michael Ferrara, Stephen G. Hartke
Let and be graphic sequences. We say they \emph{pack} if there exist edge-disjoint realizations and $G_…
Exploring the tiers of rooted phylogenetic network space using tail moves
Remie Janssen, Mark Jones, Péter L. Erdős +2
Popular methods for exploring the space of rooted phylogenetic trees use rearrangement moves such as rNNI (rooted Nearest Neighbour Interchange) and rSPR (rooted Subtree Prune and…
Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…
Non-parametric and semi-parametric asset pricing
Peter Erdos, Mihaly Ormos, David Zibriczky
We find that the CAPM fails to explain the small firm effect even if its non-parametric form is used which allows time-varying risk and non-linearity in the pricing function. Furth…
Terminal-Pairability in Complete Bipartite Graphs
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…