◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Tolchennikov

4 papers hereh-index 561 citations13 works total

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

author position
  • last author4

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

fields
  • math-ph3
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20142022
most citedAsymptotic estimate for the number of Gaussian packets on three decorated graphs

4 citations · 10 across the 4 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

math-ph2022

A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally

V. L. Chernyshev, A. A. Tolchennikov

We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex

◍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.