◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ádám Timár

3 papers hereh-index 223 citations4 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • last author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.PR3
same name
  • Ádám Timár — 26 papers, h 10
  • Ádám Timár — 4 papers, h 2
  • Ádám Timár — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedPercolation on nonunimodular transitive graphs

12 citations · 21 across the 2 of their papers we have counts for

collaborators
Showing math.PRShow all

3 papers · 1 filter

math.PR2024

A unimodular random graph with large upper growth and no growth

Péter Mester, Ádám Timár

We construct a unimodular random rooted graph with maximal degree d≥3 and upper growth rate d−1, which does not have a growth rate. Abért, Fraczyk and Hayes showed that for…

math.PR2007★ 12 cited

Percolation on nonunimodular transitive graphs

Ádám Timár

We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite cluster…

math.PR2007★ 9 cited

Neighboring clusters in Bernoulli percolation

Adám Timár

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distan…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.