Biography

Tamás Róbert Mezei is a mathematician at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. To learn more, please read my Curriculum Vitae. For a list of publications, click here.

Interests

  • Combinatorics, Graph Theory
  • Computational Geometry
  • Algorithms

Education

  • PhD in Mathematics (with an Advanced Certificate in Network Science), 2017

    Central European University

  • MSc in Mathematics, 2013

    Eötvös Loránd University

  • BSc in Mathematics, 2011

    Eötvös Loránd University

Recent Publications

Quickly discover relevant content by filtering publications.

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain …

The mixing time of the swap (switch) Markov chains: a unified approach

We show that the swap Markov chain is rapidly mixing on $P$-stable degree sequences of simple, bipartite, and directed graphs. …

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard

Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have …

Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs

Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. All of …

Mobile vs. point guards

We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, …

Recent & Upcoming Talks

Mixing time of the swap Markov chain and P-stability

The aim of this paper is to confirm that $P$-stability of a family of unconstrained/bipartite/directed degree sequences is sufficient …

A non-stable bipartite degree sequence on which the swap Markov chain is rapidly mixing

The swap Markov chain on a bipartite degree sequence $d$ operates on realizations of $d$ by taking two-two vertices from each color …

A linear time 8/3-approximation for $r$-star guards in simple orthogonal art galleries

We study the problem of covering simple orthogonal art galleries with rectangular stars. The problem has been shown to be polynomial by …

Doctoral Dissertation Defense

Commitee: András Gyárfás, Frank Hoffmann, Károly Böröczky (chair), Ervin Győri (supervisor, non-voting)

Mobile vs. point guards in orthogonal art gallery theorems

Our results are concerned with art gallery theorems on orthogonal polygons. We prove that an n-vertex orthogonal polygon can be …

Skills

Discrete Mathematics

Solving complex problems

Algorithms

Designing efficient algorithms

Programming

LaTeX

Creating beautifully typeset documents

GNU/Linux

Managing a server for private usage

Experience

 
 
 
 
 

Visiting researcher

Western Sydney University

Oct 2019 – Nov 2019 Sydney, Australia
Will be working with Andrew Francis and colleagues on phylogenetic combinatorics.
 
 
 
 
 

Visiting researcher

University of Notre Dame

Jun 2019 – Jul 2019 Indiana, USA
Worked together with Zoltán Toroczkai and members of the iCeNSA group on graph generating dynamics.
 
 
 
 
 

Research

Alfréd Rényi Institute of Mathematics

Sep 2016 – Present Budapest, Hungary
Mathematician

  • A member of Ervin Győri’s NKFIH project on traditional and moder methods in combinatorics
  • Also a member of Péter L. Erdős’s NKFIH project on sampling realizations of degree sequences since Sep 2017
 
 
 
 
 

Tutoring

CEU

Sep 2013 – May 2014 Budapest
Tutored fellow students at CEU in several subjects:

  • Real analysis
  • Algebra
  • Discrete mathematics
 
 
 
 
 

Teaching

ELTE

Feb 2012 – Jul 2012 Budapest
Taught theoretical computer science course for math bachelors

Contests

Finalist in 14th Challenge24 international programming contest

Challenge24 is one of the few team contests where participants are free to choose their tools, platforms and programming languages, and problems are presented only using open file formats.
See certificate

Academic Achievement Award for First-Year Doctoral Students

The CEU Academic Achievement Awards for First-Year Doctoral Students are meant to reward outstanding coursework and performance during the comprehensive exam.
See certificate

Winner of the 1st Beesmarter mobile programming contest

A 24 hour programming mobile developer contest for teams of three (platform: Android)
See certificate

Finalist in 10th Challenge24 international programming contest

Challenge24 is one of the few team contests where participants are free to choose their tools, platforms and programming languages, and problems are presented only using open file formats.
See certificate

Recent Posts

A note on the Erdős-Selfridge potential

The following small result has been sitting untouched in my research folder since December, 2014. As I have not been able to produce …

First Entry

Contact