Degree-preserving graph dynamics: a versatile process to construct random networks.

Zoltán Toroczkai

Péter L. Erdös Shubha R. Kharel Tamás Róbert Mezei Zoltán Toroczkai Degree-preserving graph dynamics: a versatile process to construct random networks. 2023 September 11 J. Complex Networks 5 https://doi.org/10.1093/comnet/cnad046 db/journals/compnet/compnet11.html#ErdosKMT23

David H. Wolpert Jan Korbel Christopher Lynn Farita Tasnim Joshua A. Grochow Gülce Kardes James B. Aimone Vijay Balasubramanian Eric De Giuli David Doty Nahuel Freitas Matteo Marsili Thomas E. Ouldridge Andréa W. Richa Paul M. Riechers Édgar Roldán Brenda M. Rubenstein Zoltán Toroczkai Joseph A. Paradiso Is stochastic thermodynamics the key to understanding the energy costs of computation? 2023 abs/2311.17166 CoRR https://doi.org/10.48550/arXiv.2311.17166 db/journals/corr/corr2311.html#abs-2311-17166

Muya Chang Xunzhao Yin Zoltán Toroczkai Xiaobo Hu 0001 Arijit Raychowdhury An Analog Clock-free Compute Fabric base on Continuous-Time Dynamical System for Solving Combinatorial Optimization Problems. 1-2 2022 CICC https://doi.org/10.1109/CICC53496.2022.9772850 conf/cicc/2022 db/conf/cicc/cicc2022.html#ChangYTHR22

Péter L. Erdös Shubha R. Kharel Tamás Róbert Mezei Zoltán Toroczkai Degree-preserving graph dynamics - a versatile process to construct random networks. 2021 abs/2111.11994 CoRR https://arxiv.org/abs/2111.11994 db/journals/corr/corr2111.html#abs-2111-11994

Ferenc Molnár Shubha R. Kharel Xiaobo Sharon Hu Zoltán Toroczkai Accelerating a continuous-time analog SAT solver using GPUs. 107469 2020 256 Comput. Phys. Commun. https://doi.org/10.1016/j.cpc.2020.107469 db/journals/cphysics/cphysics256.html#MolnarKHT20

Péter L. Erdös István Miklós Zoltán Toroczkai New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. 186-207 2018 27 Comb. Probab. Comput. 2 https://doi.org/10.1017/S0963548317000499 db/journals/cpc/cpc27.html#ErdosMT18

Xunzhao Yin Behnam Sedighi Melinda Varga Mária Ercsey-Ravasz Zoltán Toroczkai Xiaobo Sharon Hu Efficient Analog Circuits for Boolean Satisfiability. 155-167 2018 26 IEEE Trans. Very Large Scale Integr. Syst. 1 https://doi.org/10.1109/TVLSI.2017.2754192 http://doi.ieeecomputersociety.org/10.1109/TVLSI.2017.2754192 db/journals/tvlsi/tvlsi26.html#YinSVETH18

Botond Molnár Melinda Varga Zoltán Toroczkai Mária Ercsey-Ravasz A high-performance analog Max-SAT solver and its application to Ramsey numbers. 2018 abs/1801.06620 CoRR http://arxiv.org/abs/1801.06620 db/journals/corr/corr1801.html#abs-1801-06620

Xunzhao Yin Zoltán Toroczkai Xiaobo Sharon Hu An analog SAT solver based on a deterministic dynamical system: (Invited paper). 794-799 2017 ICCAD https://doi.org/10.1109/ICCAD.2017.8203858 http://dl.acm.org/citation.cfm?id=3199806 conf/iccad/2017 db/conf/iccad/iccad2017.html#YinTH17

Péter L. Erdös István Miklós Zoltán Toroczkai New classes of degree sequences with fast mixing swap Markov chain sampling. 2016 abs/1601.08224 CoRR http://arxiv.org/abs/1601.08224 db/journals/corr/corr1601.html#ErdosMT16

Róbert Sumi Melinda Varga Zoltán Toroczkai Mária Ercsey-Ravasz Order-to-chaos transition in the hardness of random Boolean satisfiability problems. 2016 abs/1602.05152 CoRR http://arxiv.org/abs/1602.05152 db/journals/corr/corr1602.html#SumiVTE16

Xunzhao Yin Behnam Sedighi Melinda Varga Mária Ercsey-Ravasz Zoltán Toroczkai Xiaobo Sharon Hu Efficient Analog Circuits for Boolean Satisfiability. 2016 abs/1606.07467 CoRR http://arxiv.org/abs/1606.07467 db/journals/corr/corr1606.html#YinSVETH16

Péter L. Erdös István Miklós Zoltán Toroczkai A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. 481-499 2015 29 SIAM J. Discret. Math. 1 https://doi.org/10.1137/130929874 db/journals/siamdm/siamdm29.html#ErdosMT15

Kevin E. Bassler Charo I. Del Genio Péter L. Erdös István Miklós Zoltán Toroczkai Exact sampling of graphs with prescribed degree correlations. 2015 abs/1503.06725 CoRR http://arxiv.org/abs/1503.06725 db/journals/corr/corr1503.html#BasslerGEMT15

Chiara Orsini 0001 Marija Mitrovic Dankulov Almerima Jamakovic Priya Mahadevan Pol Colomer-de-Simon Amin Vahdat Kevin E. Bassler Zoltán Toroczkai Marián Boguñá Guido Caldarelli Santo Fortunato Dmitri V. Krioukov How random are complex networks. 2015 abs/1505.07503 CoRR http://arxiv.org/abs/1505.07503 db/journals/corr/corr1505.html#OrsiniDJMCVBTBC15

Yihui Ren 0003 Mária Ercsey-Ravasz Pu Wang Marta C. González Zoltán Toroczkai Predicting commuter flows in spatial networks using a radiation model based on temporal ranges. 2014 abs/1410.4849 CoRR http://arxiv.org/abs/1410.4849 db/journals/corr/corr1410.html#RenEWGT14

Henry Kennedy 0002 Kenneth Knoblauch Zoltán Toroczkai Why data coherence and quality is critical for understanding interareal cortical networks. 37-45 2013 80 NeuroImage https://doi.org/10.1016/j.neuroimage.2013.04.031 https://www.wikidata.org/entity/Q30619257 db/journals/neuroimage/neuroimage80.html#KennedyKT13

Péter L. Erdös István Miklós Zoltán Toroczkai A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. 2013 CoRR http://arxiv.org/abs/1307.5295 abs/1307.5295 db/journals/corr/corr1307.html#ErdosMT13

Mária Ercsey-Ravasz Zoltán Toroczkai The Chaos Within Sudoku http://arxiv.org/abs/1208.0370 2012 CoRR abs/1208.0370 db/journals/corr/corr1208.html#abs-1208-0370

Mária Ercsey-Ravasz Zoltán Toroczkai Optimization hardness as transient chaos in an analog approach to constraint satisfaction http://arxiv.org/abs/1208.0526 2012 CoRR abs/1208.0526 db/journals/corr/corr1208.html#abs-1208-0526

Nitesh V. Chawla David Hachen Omar Lizardo Zoltán Toroczkai Anthony Strathman Cheng Wang 0010 Weighted reciprocity in human communication networks http://arxiv.org/abs/1108.2822 2011 CoRR abs/1108.2822 db/journals/corr/corr1108.html#abs-1108-2822

Hyunju Kim Charo I. Del Genio Kevin E. Bassler Zoltán Toroczkai Constructing and sampling directed graphs with given degree sequences http://arxiv.org/abs/1109.4590 2011 CoRR abs/1109.4590 db/journals/corr/corr1109.html#abs-1109-4590

Mária Ercsey-Ravasz Ryan Lichtenwalter Nitesh V. Chawla Zoltán Toroczkai Range-limited Centrality Measures in Complex Networks http://arxiv.org/abs/1111.5382 2011 CoRR abs/1111.5382 db/journals/corr/corr1111.html#abs-1111-5382

Péter L. Erdös István Miklós Zoltán Toroczkai A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. 2010 17 Electron. J. Comb. 1 https://doi.org/10.37236/338 db/journals/combinatorics/combinatorics17.html#ErdosMT10

Charo I. Del Genio Hyunju Kim Zoltán Toroczkai Kevin E. Bassler Efficient and exact sampling of simple graphs with given arbitrary degree sequence http://arxiv.org/abs/1002.2975 2010 CoRR abs/1002.2975 db/journals/corr/corr1002.html#abs-1002-2975

Zoltán Toroczkai György Korniss Mark A. Novotny Hasan Guclu Scalability, Random Surfaces, and Synchronized Computing Networks. 249-270 2006 Computational Complexity and Statistical Physics books/ox/06/PIM2006 db/books/collections/PIM2006.html#ToroczkaiKNG06

Bogdan Danila Yong Yu 0004 Samuel Earl John A. Marsh Zoltán Toroczkai Kevin E. Bassler Congestion-gradient driven transport on complex networks http://arxiv.org/abs/cond-mat/0603861 2006 CoRR abs/cond-mat/0603861 db/journals/corr/corr0603.html#abs-cond-mat-0603861

Sameet Sreenivasan Reuven Cohen Eduardo López Zoltán Toroczkai Harry Eugene Stanley Communication Bottlenecks in Scale-Free Networks http://arxiv.org/abs/cs/0604023 2006 CoRR abs/cs/0604023 db/journals/corr/corr0604.html#abs-cs-0604023

György Korniss Mark A. Novotny Hasan Guclu Zoltán Toroczkai Per Arne Rikvold Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations http://arxiv.org/abs/cond-mat/0302050 2003 CoRR cond-mat/0302050 db/journals/corr/corr0302.html#cond-mat-0302050

István Miklós Zoltán Toroczkai An Improved Model for Statistical Alignment. 1-10 2001 conf/wabi/2001 WABI https://doi.org/10.1007/3-540-44696-6_1 db/conf/wabi/wabi2001.html#MiklosT01

György Korniss Mark A. Novotny Per Arne Rikvold Hasan Guclu Zoltán Toroczkai Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability http://arxiv.org/abs/cond-mat/0112103 2001 CoRR cond-mat/0112103 db/journals/corr/corr0112.html#cond-mat-0112103

György Korniss Mark A. Novotny Zoltán Toroczkai Per Arne Rikvold Non-equilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems http://arxiv.org/abs/cond-mat/0002469 2000 CoRR cond-mat/0002469 db/journals/corr/corr0002.html#cond-mat-0002469

György Korniss Zoltán Toroczkai Mark A. Novotny Per Arne Rikvold From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth http://arxiv.org/abs/cond-mat/9909114 1999 CoRR cond-mat/9909114 db/journals/corr/corr9909.html#cond-mat-9909114

James B. Aimone Vijay Balasubramanian Kevin E. Bassler Marián Boguñá Guido Caldarelli Muya Chang Nitesh V. Chawla Reuven Cohen Pol Colomer-de-Simon Bogdan Danila David Doty Samuel Earl Mária Ercsey-Ravasz Péter L. Erdös Santo Fortunato Nahuel Freitas Charo I. Del Genio Eric De Giuli Marta C. González Joshua A. Grochow Hasan Guclu David Hachen Xiaobo Sharon HuXiaobo Hu 0001 Almerima Jamakovic Gülce Kardes Henry Kennedy 0002 Shubha R. Kharel Hyunju Kim Kenneth Knoblauch Jan Korbel György Korniss Dmitri V. Krioukov Ryan Lichtenwalter Omar Lizardo Eduardo López Christopher Lynn Priya Mahadevan John A. Marsh Matteo Marsili Tamás Róbert Mezei István Miklós Marija MitrovicMarija Mitrovic Dankulov Botond Molnár Ferenc Molnár Mark A. Novotny Chiara Orsini 0001 Thomas E. Ouldridge Joseph A. Paradiso Arijit Raychowdhury Yihui Ren 0003 Andréa W. Richa Paul M. Riechers Per Arne Rikvold Édgar Roldán Brenda M. Rubenstein Behnam Sedighi Sameet Sreenivasan Harry Eugene Stanley Anthony Strathman Róbert Sumi Farita Tasnim Amin Vahdat Melinda Varga Cheng Wang 0010 Pu Wang David H. Wolpert Xunzhao Yin Yong Yu 0004