English
Related papers

Related papers: K-independent percolation on trees

200 papers

We show that the uniqueness thresholds for Poisson-Voronoi percolation in symmetric spaces of connected higher rank semisimple Lie groups with property (T) converge to zero in the low-intensity limit. This phenomenon is fundamentally…

Probability · Mathematics 2025-04-04 Jan Grebík , Konstantin Recke

Consider an independent site percolation model on $\Z^d$, with parameter $p \in (0,1)$, where all long range connections in the axes directions are allowed. In this work we show that given any parameter $p$, there exists and integer $K(p)$…

Probability · Mathematics 2009-05-29 Bernardo N. B. de Lima , Remy Sanchis , Roger W. C. Silva

A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…

Statistical Mechanics · Physics 2007-05-23 Ana Proykova , Boris Karadjov

In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…

Statistical Mechanics · Physics 2017-03-03 Ling-Wei Kong , Ming Li , Run-Ran Liu , Bing-Hong Wang

In this paper, we consider random trees associated with the genealogy of Crump-Mode-Jagers processes and perform Bernoulli bond-percolation whose parameter depends on the size of the tree. Our purpose is to show the existence of a giant…

Probability · Mathematics 2020-09-22 Gabriel Berzunza Ojeda

This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…

Probability · Mathematics 2008-11-26 Itai Benjamini , Oded Schramm

Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices…

Combinatorics · Mathematics 2025-02-25 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin

We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…

Probability · Mathematics 2019-03-14 Jian Ding , Mateo Wirth

We revisit the \textsc{$k$-Secluded Tree} problem. Given a vertex-weighted undirected graph $G$, its objective is to find a maximum-weight induced subtree $T$ whose open neighborhood has size at most $k$. We present a fixed-parameter…

Data Structures and Algorithms · Computer Science 2022-06-27 Huib Donkers , Bart M. P. Jansen , Jari J. H. de Kroon

We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…

Astrophysics · Physics 2009-10-31 Stephane Colombi , Dmitry Pogosyan , Tarun Souradeep

This article studies the temporal law of the KPZ fixed point. For the stationary geometry, we find the two-time law, which extends the single time law due to Baik-Rains and Ferrari-Spohn. For the droplet geometry, we find a relatively…

Probability · Mathematics 2025-12-17 Mustazee Rahman

Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open…

Computational Complexity · Computer Science 2010-02-18 Ilias Diakonikolas , Daniel M. Kane , Jelani Nelson

In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…

Physics and Society · Physics 2018-03-21 Zexun Wang , Dong Zhou , Yanqing Hu

Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in…

Probability · Mathematics 2014-02-19 Karen Gunderson , Michał Przykucki

We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation…

Probability · Mathematics 2017-11-01 Christian Hirsch , Benedikt Jahnel , Elie Cali

We study the bond percolation game and the site percolation game on the rooted Galton-Watson tree $T_{\chi}$ with offspring distribution $\chi$. We obtain the probabilities of win, loss and draw for each player in terms of the fixed points…

Probability · Mathematics 2023-05-09 Sayar Karmakar , Moumanti Podder , Souvik Roy , Soumyarup Sadhukhan

We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…

Probability · Mathematics 2025-01-03 Serte Donderwinkel , Robin Khanfir

We prove phase transitions for continuum percolation in a Boolean model based on a Cox point process with nonstabilizing directing measure. The directing measure, which can be seen as a stationary random environment for the classical…

Probability · Mathematics 2023-05-10 Benedikt Jahnel , Sanjoy Kumar Jhawar , Anh Duc Vu

In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.

Probability · Mathematics 2018-04-24 Kohei Yamamoto

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…

Combinatorics · Mathematics 2024-07-29 Chang Liu , Jianping Li