On perturbations that preserve the connectivity properties in tree percolations
summary
The gist
On perturbations that preserve the connectivity properties in tree percolations we consider a general bond percolation on an infinite locally finite tree where edge retention probabilities are…
In short
The paper investigates how small changes (perturbations) to edge retention probabilities in a tree percolation model affect its connectivity properties, specifically whether infinite clusters exist. It shows that under certain conditions, these models are stable against specific types of perturbations, meaning the qualitative behavior remains the same even when probabilities are slightly altered.
Key concepts
- Tree Percolation
- This is a mathematical model where edges on an infinite tree structure are retained or removed based on certain probabilities. It's used to study how clusters of connected nodes form within this branching network, often looking for the existence of infinitely large connected components.
- Level-Dependent Perturbations (q|e|pe)
- This refers to changing the edge retention probability based on its distance from the root in the tree. The perturbation factor $q$ depends on $|e|$, which is the distance from the root. This allows researchers to study how connectivity changes when different parts of the tree are perturbed differently.
- Capacity Characterization
- This is a key mathematical tool that relates a set's connectivity probability in percolation to its 'capacity'. Capacity measures how well a region can be connected or separated, providing a rigorous way to analyze the system's structure and stability.
Terminology used across episodes
This episode discusses
- On perturbations that preserve the connectivity properties in tree percolations · Paper Radio
- Falconer lattice sets and the Erdos similarity problem
The paper
On perturbations that preserve the connectivity properties in tree percolations · Read on arXiv
MIRMUHSIN MAXMUD, VILLE SUOMALA
We consider a general bond percolation on an infinite locally finite tree, where the edge retention probabilities p e are replaced by 1,q ep e, where q n n at least 1 is a sequence of positive perturbation factors and e denotes the distance between the edge e and the root. If the original percolation model admits infinite clusters, it is of interest to investigate under which perturbations 0<q n at most 1 this connectivity property is preserved. Conversely, if the original percolation does not admit infinite clusters, we are led to study the stability of such a property under perturbations satisfying q n at least 1. In both cases, under minimal assumptions on the original model, we show that the percolative behaviour is stable against certain quantitative non-trivial perturbations. We also discuss an application of our results to the Erdős similarity conjecture for Cantor sets.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "On perturbations that preserve the connectivity properties in tree percolations".
Paper summary: Ada: So, to recap, this paper, "On perturbations that preserve the connectivity properties in tree percolations," is looking at how you modify edge probabilities in a percolation model on an infinite tree. The authors are investigating when you can apply these modifications without losing the fundamental property of whether the system has infinite clusters or not.
Emmy: They set up this scenario where edge retention probabilities p are replaced by something like the minimum of one and some scaled version of p, depending on how far that edge is from the root vertex. They explore two main scenarios based on whether your original model had infinite clusters to begin with.
Kolya: If you start with an infinite cluster, they study perturbations where the scaling factors are less than or equal to one. The goal there is to preserve that infinite connectivity property under these constrained changes in probability.
Ada: And if you start without an infinite cluster—meaning everything is finite—they look at perturbations where the scaling factors are greater than or equal to one. In this case, they want to see how far you can push the system while keeping those clusters finite.
Emmy: Their main result hinges on analyzing the cumulative effect of these perturbation factors along every infinite ray starting from the root vertex, which they denote by some product Q infinity n equals one q n. If this product converges to a positive and finite value, it implies that the perturbation is essentially just rescaling your original connectivity probabilities by a bounded factor.
Kolya: That convergence is what’s important because it means the qualitative behavior of the model won't change much; it suggests the system just gets rescaled in a predictable way. If that product doesn't converge nicely, they look at more complex stability conditions involving those boundary sets, which brings us into Theorem A.
Ada: Theorem A is where they get pretty technical, showing that even when the cumulative effect of those perturbations diverges in certain ways, the connectivity state of the system can still persist under mild necessary conditions.
Emmy: They prove this by using an energy functional called E T n q p in a truncated version of the tree and showing that under certain conditions, the probability of having an infinite cluster in the perturbed model is bounded by some multiple of your original probability.
Kolya: The proof for part one specifically addresses cases where you start with no infinite clusters, meaning almost surely there are no infinite clusters to begin with. They show that if a certain limit involving the perturbation factors and the original probability is zero, then the perturbed model also doesn't have an infinite cluster almost surely.
Ada: That sounds like they are providing a way to rule out new infinite clusters based on how much you change the probabilities along those rays, even when things get complicated.
Conclusion: Emmy: So, wrapping up the discussion on "On perturbations that preserve the connectivity properties in tree percolations," this paper is essentially about establishing robustness for percolation models on trees under specific types of edge probability modifications.
Ada: The authors show that if you start with a certain connectivity state, say infinite clusters, you can often keep it by using small enough perturbations where those scaling factors are less than or equal to one. Conversely, if the original system is finite, they find conditions on larger perturbations that still allow for stability.
Kolya: And the paper demonstrates that this stability isn't always obvious just by looking at a simple product along an infinite ray; it requires checking specific conditions on those products and sometimes using deeper tools like capacity characterization to show what happens.
Emmy: The title itself points to the idea that you are trying to find exactly what kind of perturbations are allowed—the ones that respect the underlying structure of the tree percolation. They aren't just any arbitrary changes to probabilities; they have specific constraints.
Ada: And their work has a direct application linking these ideas to problems in geometry, specifically relating them to how you can study Cantor sets using tree percolations and the Erdős similarity conjecture.
Kolya: So, what this means for the broader field is that we've found a way to rigorously prove that percolation models on trees are much more stable than we might have thought when you introduce these kinds of quantitative, non-trivial changes to their defining probabilities.
Emmy: It’s not a claim about everything being easy; it’s a statement about where the boundaries of stability lie for these specific models and how those boundaries are defined by these scaling factors.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors