Login
 Forum
 
 
Personal data sheet
 Print preview
personal data approved: 2019. IV. 01.
Personal data
name Ádám Timár
name of institution
doctoral school
SzTE Doctoral School of Mathematics and Computer Science (Academic staff member)
accreditation statement submitted to: University of Szeged
Contact details
E-mail address madaramitgmail.com
phone number +36 30 266-6370
Academic title
scientific degree, title Ph.D.
year degree was obtained 2006
discipline to which degree belongs mathematics and computing
institution granting the degree Indiana University
Employment
2012 - University of Szeged
university professor or researcher
Thesis topic supervisor
number of doctoral students supervised until now 2
number of students who fulfilled course requirements 0
students who obtained their degrees:
  Thesis topic proposals
Research
research area Percolation, invariant random processes on transitive graphs. Benjamini-Schramm convergence of graph sequences, unimodular graphs.
research field in which current research is conducted mathematics and computing
Publications
2019

Beringer D, Timár Ádám: Controllability, matching ratio and graph convergence, JOURNAL OF STATISTICAL PHYSICS 174: (5) pp. 1080-1103.
type of document: Journal paper/Article
language: English
URL 
2018

Timar Adam: INDISTINGUISHABILITY OF THE COMPONENTS OF RANDOM SPANNING FORESTS, ANNALS OF PROBABILITY 46: (4) pp. 2221-2242.
type of document: Journal paper/Article
language: English
URL 
2017

Dorottya Beringer, Gábor Pete, Ádám Timár: On percolation critical probabilities and unimodular random graphs, ELECTRONIC JOURNAL OF PROBABILITY 22: 106
type of document: Journal paper/Article
number of independent citations: 5
language: English
URL 
2016

Barlow M, Burdzy K, Timar A: Comparison of quenched and annealed invariance principles for random conductance model, PROBABILITY THEORY AND RELATED FIELDS 164: (3-4) pp. 741-770.
type of document: Journal paper/Article
number of independent citations: 3
language: English
2016

Marko R, Timar A: A POISSON ALLOCATION OF OPTIMAL TAIL, ANNALS OF PROBABILITY 44: (2) pp. 1285-1307.
type of document: Journal paper/Article
language: English
URL 
2013

Timar A: Boundary-connectivity via graph theory, PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY 141: (2) pp. 475-480.
type of document: Journal paper/Article
number of independent citations: 18
language: English
2006

Timar Adam: Ends in Free Minimal Spanning Forests, ANNALS OF PROBABILITY 34: pp. 865-869.
type of document: Journal paper/Article
number of independent citations: 8
language: English
2006

Timar A: Percolation on Nonunimodular Graphs, ANNALS OF PROBABILITY 34: pp. 2344-2364.
type of document: Journal paper/Article
number of independent citations: 4
language: English
2006

Timar A: Neighboring Clusters at Bernoulli Percolation, ANNALS OF PROBABILITY 34: (6) pp. 2332-2343.
type of document: Journal paper/Article
number of independent citations: 1
language: English
2004

Timar A: Tree and Grid Factors of General Point Processes, ELECTRONIC COMMUNICATIONS IN PROBABILITY 6: pp. 53-59.
type of document: Journal paper/Article
number of independent citations: 16
language: English
URL 
Number of independent citations to these publications:55 
Scientometric data
Saját közlemény- és idézőlista list of publications and citations
number of scientific publications that meet accreditation criteria:
18
number of scientific publications:
18
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
0 
scientific publications published abroad that meet the accreditation criteria:
6
publications not in Hungarian, published in Hungary, meeting the accreditation criteria:
12
number of independent citations to scientific publications and creative works:
71


2019. IX. 13.
ODT ülés
Az ODT következő ülésére 2019. november 22-én 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )