activity
20192026
most citedWave propagation for reaction-diffusion equations on infinite random trees

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

collaborators

15 papers

math.PR2026

-Skewed Maximal Spanning Forests

Shirshendu Chatterjee, Yang Chen, Grigory Terlov

The Free -Maximal Spanning Forest (FMaxSF) is a weighted generalization of the classical Free Minimal Spanning Forest (FMSF) that is able to detect nonhyperfiniteness i…

math.PR2026

Interface between competing random walks on a cycle

Shirshendu Chatterjee, Nadya Nabahi, Grigory Terlov

We consider a competition between two independent random walks on a cycle of length . Each vertex is claimed by the walker that visits it first, and remains claimed thereafter.…

math.PR2026

Limiting distributions of triangle counts in linear preferential attachment models

Partha S. Dey, Grigory Terlov

We derive distributional approximations for the number of triangles in the linear preferential attachment model , where and , with explicit rates…

math.CO2026

Whitney's 2-isomorphism theorem for graphings

Márton Borbényi, Grigory Terlov, László Márton Tóth

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measur…

math.LO2025

Measurable one-ended spanning trees

Matt Bowen, António Girão, Héctor Jardón-Sánchez +1

We show that a one-ended, locally finite, measurable graph on a standard probability space admits a measurable one-ended spanning subtree if and only if it is measure-hyperfinite.…

math.PR2025

Heavy repulsion of clusters in Bernoulli percolation

Sasha Bell, Tasmin Chu, Owen Rodgers +2

We study Bernoulli percolation on (non)unimodular quasi-transitive graphs and prove that, almost surely, for any two heavy clusters and , the set of vertices in wi…

math.CO2025

The ineffectiveness of the regularity lemma for bounded degree graphs

Clark Lyons, Grigory Terlov, Zoltán Vidnyánszky

We show that for any , there is no bound computable from on the size of a graph required to approximate a graph of maximum degree at most up to $\va…

math.PR2025

Weighted-amenability and percolation

Grigory Terlov, Ádám Timár

In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For…

math.PR2024

Random optimization problems at fixed temperatures

Partha S. Dey, Grigory Terlov

This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the siz…

math.PR2023

Collaboration of Random Walks on Graphs

Partha S. Dey, Daesung Kim, Grigory Terlov

Consider a collaborative dynamic of independent random walks on a finite connected graph . We are interested in the size of the set of vertices visited by at least one walke…

math.DS2022

Nonamenable subforests of multi-ended quasi-pmp graphs

Ruiyuan Chen, Grigory Terlov, Anush Tserunyan

We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikody…

math.PR2022

Berry-Esseen Theorem for Sample Quantiles with Locally Dependent Data

Partha S. Dey, Grigory Terlov

We derive a Gaussian Central Limit Theorem for the sample quantiles based on locally dependent random variables with explicit convergence rate. Our approach is based on converting…

math.PR2022

On the probability of irreducibility of random polynomials with integer coefficients

Grigory Terlov

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases whe…

math.PR2021

Stein's method for Conditional Central Limit Theorem

Partha S. Dey, Grigory Terlov

In the seventies, Charles Stein revolutionized the way of proving the Central Limit Theorem by introducing a method that utilizes a characterization equation for Gaussian distribut…

math.PR2019★ 2 cited

Wave propagation for reaction-diffusion equations on infinite random trees

Wai-Tong Louis Fan, Wenqing Hu, Grigory Terlov

The asymptotic wave speed for FKPP type reaction-diffusion equations on a class of infinite random metric trees are considered. We show that a travelling wavefront emerges, provide…