Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2212.06243

Face and cycle percolation

Christian Hirsch·Daniel Valesin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider face and cycle percolation as models for continuum percolation based on random simplicial complexes in Euclidean space. Face percolation is defined through infinite sequences of $d$-simplices sharing a $(d-1)$-dimensional face. In contrast, cycle percolation demands the existence of infinite $d$-cycles, thereby generalizing the lattice notion of plaquette percolation. We discuss the sharp phase transition for face percolation and derive comparison results between the critical intensities for face and cycle percolation. Finally, we consider an alternate version of simplex percolation, by declaring simplices to be neighbors whenever they are sufficiently close to each other, and prove a strict inequality involving the critical intensity of this alternate version and that of face percolation.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Hirsch, Daniel Valesin. 2022-12-12. Face and cycle percolation. https://arxiv.org/abs/2212.06243

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hermite trace polynomials and chaos decompositions for the Hermitian Brownian motion

For a non-zero parameter $q$, we define Hermite trace polynomials, which are multivariate polynomials indexed by permutations. We prove several combinatorial properties for them, such as expansions and product formulas. The linear functional determined by these trace polynomials is a state for $q = \frac{1}{N}$ for $N$ a non-zero integer. For such $q$, Hermite trace polynomials of different degrees are orthogonal. The product formulas extend to the closure with respect to the state. The state can be identified with the expectation induced by the $N \times N$ Hermitian Brownian motion. Hermite trace polynomials are martingales for this Brownian motion, while the elements in the closure can be interpreted as stochastic integrals with respect to it. Using the grading on the algebra, we prove several chaos decompositions for such integrals, as well as analyze corresponding creation and annihilation operators. In the univariate, pure trace polynomial case, trace Hermite polynomials can be identified with the Hermite polynomials of matrix argument.

math.PR↗
arXiv2026

Coupling and Maximal Inequalities for Graph-Dependent Empirical Processes

We develop maximal inequalities for empirical processes indexed by graph-dependent observations. Our bounds separate the complexity of the indexing class from two features specific to graph dependence: the geometry of the underlying graph and the cost of coupling graph-separated blocks to independent copies. The coupling construction combines a novel graph-adapted dependence coefficient with a coloring of a block partition. As an application, we derive Glivenko--Cantelli results and characterize the associated effective sample size. A central implication is that graph-dependent empirical processes need not exhibit a generic root-$n$ rate: convergence is jointly determined by function-class complexity, graph geometry, and the decay of dependence with graph distance. We specialize the results to graphs with polynomial and exponential growth and to directed dyadic graphs. Finally, we apply the results to network autoregressive models, nonlinear local-propagation models, and treatment-interference settings.

math.PR↗