obelix.phys.nd.eduZoltán Toroczkai

| Last Updated: Feb. 11, 2018 Home ▶ Teaching Statistical Mechanics, Spring 2020  Classical Mechanics, Fall 2017  --  Intro to Networks, Spring 2017  --  Classical Electrodynamics  -- ▶ Research Highlights  Agent-based Systems    Biological Systems   Statistical Physics   Nonlinear Dynamics  -- ▶ Publications Journal Articles  Working papers  -- Edited books, issues Book Chapters Proceedings Other publications Google Scholar  CV  -- The Entropy Hut (Blog) "A fact is a simple statement that everyone believes. It is innocent unless found guilty. A hypothesis is a novel suggestion that no one wants to believe. It is guilty until found effective." -- Edward Teller I work in the general area of complex systems research, bringing and developing tools from mathematics, equilibrium and non-equilibrium statistical physics, nonlinear dynamics and chaos theory to bear on problems in network science, neuroscience, biophysics, fluid dynamics, processes in solids, social sciences and foundations of computing. Recent papers • S.R. Kharel, T.R. Mezei, S. Chung, D. Soltész, P.L. Erdős and Z. Toroczkai. " Degree-preserving network growth " submitted (2019). • S. Dutta, A. Khanna, J. Gomez, K. Ni, Z. Toroczkai, S. Datta. " Experimental Demonstration of Phase Transition Nano-Oscillator Based Ising Machine. " 2019 IEEE International Electron Devices Meeting (IEDM19) accepted. • H. Yamashita, H. Suzuki, Z. Toroczkai and K. Aihara. " Bounded Continuous-Time Satisfiability Solver " 2019 International Symposium on Nonlinear Theory and its Applications (NOLTA2019) accepted. • B. Molnár, F. Molnár, M. Varga, Z. Toroczkai, M. Ercsey-Ravasz. " A continuous-time Max-SAT solver with high analog performance. " Nature Comm. 9 4864 (2018) | arXiv:1801.06620 [cs.CC] | DOI: 10.1038/s41467-018-07327-2 • R. Gamanut, H. Kennedy, Z. Toroczkai, M. Ercsey-Ravasz, D.C. Van Essen, K. Knoblauch and A. Burkhalter " The Mouse Cortical Connectome, Characterized by an Ultra-Dense Cortical Graph, Maintains Specificity by Distinct Connectivity Profiles " Neuron 97 , 698-715 (2018) | DOI: 10.1016/j.neuron.2017.12.037 • X.Yin, B. Sedighi, M. Varga, M. Ercsey-Ravasz, Z. Toroczkai, X. S. Hu. " Efficient analog circuits for Boolean Satisfiability. " IEEE Transactions on Very Large Scale Integration Systems (TVLSI) 26 (1), 155--167 (2018)| DOI: 10.1109/TVLSI.2017.2754192 | arXiv:1606.07467 [cs.ET] • Czabarka, L.A. Székely, Z. Toroczkai, S. Walker " An algebraic Monte-Carlo algorithm for the Bipartite Partition Adjacency Matrix realization problem " , submitted (2017). | arXiv:1708.08242 [math.CO] • P.L. Erdős, I. Miklós, Z. Toroczkai " New classes of degree sequences with fast mixing swap Markov chain sampling. " Combinatorics Probability and Computing , published online 02 Nov, 22 pages (2017) | DOI: 10.1017/S0963548317000499 | arXiv:1601.08224 [cs.DM, math.CO] • H.R. Noori, J. Schöttler, M. Ercsey-Ravasz, A. Cosa-Linan, M. Varga, Z. Toroczkai, R. Spanagel. " A Multi-scale Cerebral Neurochemical Connectome of the Rat Brain. " PLoS Biol. , 15 (7), e2002612 (2017). • Sz. Horváth, R. Gămănuț, M. Ercsey-Ravasz, L. Magrou, B. Gămănuț, D.C. Van Essen, A. Burkhalter, K. Knoblauch, Z. Toroczkai, H. Kennedy. " Spatial Embedding and Wiring Cost Constrain the Functional Layout of the Cortical Network of Rodents and Primates " PLOS Biology , 14 (7), e1002512 (2016). • M. Varga, R. Sumi, Z. Toroczkai, M. Ercsey-Ravasz. " Order-to-chaos transition in the hardness of random Boolean satisfiability problems. " Phys. Rev. E , 93 052211 (2016). | arXiv:1602.05152 [cs.CC, cond-mat.stat-mech] Selected publications • Sz. Horvát, É. Czabarka and Z. Toroczkai. " Reducing Degeneracy in Maximum Entropy Models of Networks. " Phys. Rev. Lett. , 114 158701 (2015) | doi:10.1103/PhysRevLett.114.158701 | arXiv:1407.0991 [cond-mat.stat-mech] • Y. Ren, M. Ercsey-Ravasz, P. Wang, M. C. González and Z. Toroczkai. " Predicting commuter flows in spatial networks using a radiation model based on temporal ranges. " Nature Comm. 5 , 5347 (2014) | doi: 10.1038/ncomms6347 | arXiv:1410.4849 [physics.soc-ph] • N.T. Markov, M. Ercsey-Ravasz, D.C. Van Essen, K. Knoblauch, Z. Toroczkai and H. Kennedy. " Cortical high-density counter-stream architectures. " Science 342 (6158), 1238406 (2013). | Link to journal | | doi: 10.1126/science.1238406 • H. Kim, C.I. Del Genio, K.E. Bassler and Z. Toroczkai. " Constructing and sampling directed graphs with given degree sequences. " New J. Phys. 14 , 023012 (2012). arxiv.org/1109.4590 • M. Ercsey-Ravasz and Z. Toroczkai. " The Chaos Within Sudoku. " Scientific Reports , 2 , 725 (2012). | doi:10.1038/srep00725 | arxiv.org: 1208.0370 ♣ M. Ercsey-Ravasz and Z. Toroczkai. " Optimization hardness as transient chaos in an analog approach to constraint satisfaction. " Nature Physics 7 , 966-970 (2011). Cover-page article. | doi:10.1038/nphys2105 | arxiv.org: 1208.0526v1 • S. Eubank, H. Guclu, V.S.A. Kumar, M. Marathe, A. Srinivasan, Z. Toroczkai, N. Wang. " Modelling disease outbreaks in realistic urban social networks. " Nature 429 (6988), 180 (2004). • M. Anghel, Z. Toroczkai, K.E. Bassler, G. Korniss " Competition-driven Network Dynamics: Emergence of a Scale-free Leadership Structure and Collective Efficiency. " Phys.Rev.Lett. 92 , 058701 (2004). • G. Korniss, M.A. Novotny, H. Guclu, Z. Toroczkai, P.A. Rikvold " Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations " Science 299 , 677 (2003). • I.J. Benczik, Z. Toroczkai and T. Tél. " Selective Sensitivity of Open Chaotic Flows on Inertial Tracer Advection: Catching Particles with a Stick " Phys.Rev.Lett. 89 , 164501 (2002). • Z. Toroczkai " Topological classification of the Horton-Strahler index on binary trees " Phys.Rev.E 65 , 016130 (2001). | arxiv.org: cond-mat/0108448 • G. Károlyi, Á. Péntek, I. Sheuring, T. Tél, and Z. Toroczkai " Chaotic flow: the physics of species coexistence " Proc.Natl.Acad.Sci.USA 97 (25), 13661-13665 (2000). For Fun: solving hard Sudokus with a continuous-time solver: Sudoku is an exact cover type of constraint satisfaction problem and can be formulated as a Boolean Satisfiability problem (+1-in-9 SAT) and in turn transformed into conjunctive normal form (CNF). Our analog and deterministic solver published in ♣ above can be used to efficiently solve CNF SAT problems, and thus Sudoku as well. Here, Mária Ercsey-Ravasz with Erzsébet Regan have generated a movie about the "flow of thoughts" in some of the number fields (the right frame of the movie) by the solver, when solving one of the hardest Sudoku puzzles on record (the puzzle is from Elser et.al., PNAS , 104 (2) 418-423 (2007), Fig 5 of the Supporting Info). The movie can also be downloaded in wmv format and in mp4 format. Also see: arxiv.org: 1208.0370 Postdoctoral position opening: Update (Aug 3rd, 2012): One position has been filled. However, there is a possibility for a second position, with a start date not earlier than January 2013. The position is in network science and requires good programming skills, strong analytical skills (including graph theory) and experience in network research. Send me an email for more information (work description, salary, etc.). To apply, please send me a) a cover letter in which you describe one of your accomplishments that you are most proud of b) a current CV with publication list included, and b) names and contact info for two (2) references. -- Professor, Physics Department, Concurrent Professor, Computer Science and Engineering, University of Notre Dame -- Erdős nr: 2 ♣ Twitter: @zoltantoroczkai Contact Info Snail Mail: 225 Nieuwland Science Hall (NSH), Department of Physics , University of Notre Dame , Notre Dame , IN 46556-5670, U.S.A. Phone: +1-574-631-2618 (Office) Office: 384D, NSH (iCeNSA) iCeNSA University of Notre Dame Bldg. 1050, Suite. 384 Contact Ms. Yentl Ceballo, Rm 384E Phone: +1 (574) 631-7095 FAX: +1 (574) 631-5...