Items where Author is "Miklós, István"

Article

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István (2024) Approximate Sampling and Counting of Graphs with Near-P-stable Degree Intervals. ANNALS OF COMBINATORICS. ISSN 0218-0006

Hubai, András Gábor and Mezei, Tamás Róbert and Béres, Ferenc and Benczúr, András, ifj and Miklós, István (2024) Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. PLOS ONE, 19 (5). ISSN 1932-6203

Čibej, U. and Li, A. and Miklós, István and Nasir, S. and Srikanth, V. (2023) Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. DISCRETE APPLIED MATHEMATICS, 332. pp. 47-61. ISSN 0166-218X

Hong, L. and Miklós, István (2023) A Markov chain on the solution space of edge colorings of bipartite graphs. DISCRETE APPLIED MATHEMATICS, 332. pp. 7-22. ISSN 0166-218X

Ecker, András and Bagi, Bence and Vértes, Eszter and Steinbach-Németh, Orsolya and Karlócai, Mária R. and Papp, Orsolya I. and Miklós, István and Hájos, Norbert and Freund, Tamás F. and Gulyás, Attila I. and Káli, Szabolcs (2022) Hippocampal Sharp Wave-Ripples and the Associated Sequence Replay Emerge from Structured Synaptic Interactions in a Network Model of Area CA3. ELIFE, 11. pp. 1-29. ISSN 2050-084X

Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos (2022) The mixing time of switch Markov chains: A unified approach. EUROPEAN JOURNAL OF COMBINATORICS, 99. No.-103421. ISSN 0195-6698

Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2021) Half-graphs, other non-stable degree sequences, and the switch Markov chain. ELECTRONIC JOURNAL OF COMBINATORICS, 28 (3). ISSN 1097-1440

Miklós, István and Schlafly, G. and Wang, Y. and Wei, Z. (2020) Edge Disjoint Caterpillar Realizations. DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X

Bérczi, Kristóf and Király, Zoltán and Liu, Changshuo and Miklós, István (2020) Packing tree degree sequences. GRAPHS AND COMBINATORICS. pp. 1-7. ISSN 0911-0119 (print); 1435-5914 (online)

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2018) Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. PLOS ONE, 13 (8). ISSN 1932-6203

Erdős, Péter and Miklós, István (2018) Not all simple looking degree sequence problems are easy. JOURNAL OF COMBINATORICS, 9 (2). pp. 553-566. ISSN 2156-3527

Erdős, Péter and Hartke, S. G. and van Iersel, Leo and Miklós, István (2017) Graph realizations constrained by skeleton graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 24 (2). #P2.47. ISSN 1097-1440

Aksen, Mark and Miklós, István and Zhou, Kathleen (2017) Half-regular factorizations of the complete bipartite graph. DISCRETE APPLIED MATHEMATICS, 230. pp. 21-33. ISSN 0166-218X

Erdős, Péter and Miklós, István and Toroczkai, Zoltán (2017) New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. COMBINATORICS PROBABILITY & COMPUTING. pp. 1-22. ISSN 0963-5483 (In Press)

Bixby, Eliot and Flint, Toby and Miklós, István (2016) Proving the Pressing Game Conjecture on Linear Graphs. INVOLVE: A JOURNAL OF MATHEMATICS, 9 (1). pp. 41-56. ISSN 1944-4176

Erdős, Péter and Kiss, Sándor and Miklós, István and Soukup, Lajos (2015) Approximate Counting of Graphical Realizations. PLOS ONE, 10 (7). e0131300. ISSN 1932-6203

Bassler, K. E. and Del Genio, C. I. and Erdős, Péter and Miklós, István and Toroczkai, Zoltán (2015) Exact sampling of graphs with prescribed degree correlations. New Journal of Physics, 17. pp. 1-25. ISSN 1367-2630

Czabarka, É. and Dutle, A. and Erdős, Péter and Miklós, István (2015) On Realizations of a Joint Degree Matrix. DISCRETE APPLIED MATHEMATICS, 181. pp. 283-288. ISSN 0166-218X

Miklós, István and Smith, Heather (2015) The computational complexity of calculating partition functions of optimal medians with hamming distance. ADVANCES IN APPLIED MATHEMATICS, 102. pp. 18-82. ISSN 0196-8858

Erdős, Péter and Miklós, István and Toroczkai, Zoltán (2015) A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (1). pp. 481-499. ISSN 0895-4801

Apostolico, A. and Erdős, Péter and Miklós, István and Siemons, J. (2013) Modulated String Searching. THEORETICAL COMPUTER SCIENCE. pp. 1-8. ISSN 0304-3975

Erdős, Péter and Király, Zoltán and Miklós, István (2013) On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. COMBINATORICS PROBABILITY AND COMPUTING, 22 (3). pp. 366-383. ISSN 0963-5483

Miklós, István and Erdős, Péter and Soukup, Lajos (2013) Towards random uniform sampling of bipartite graphs with given degree sequence. ELECTRONIC JOURNAL OF COMBINATORICS, 20 (1). ISSN 1077-8926

Erdős, Péter and Miklós, István and Toroczkai, Z. (2010) A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 17 (1). ISSN 1077-8926

Kim, Hyunju and Toroczkai, Zoltán and Erdős, Péter and Miklós, István and Székely, László A. (2009) Degree-based graph construction. JOURNAL OF PHYSICS A: MATHEMATICAL AND THEORETICAL, 42 (39). pp. 1-10. ISSN 1751-8113

Monograph

Miklós, István (2010) Sztochasztikus modellek a bioinformatikában és többváltozós ökológiai adatfeltárásban = Stochastic models in bioinformatics and multivariate ecological analysis. Project Report. OTKA.

Podani, János and Miklós, István (2008) Többváltozós ökológiai mintázatok értékelése: új módszerek = New methods for the analysis of multivariate data in ecology. Project Report. OTKA.