English
Related papers

Related papers: Upper transition point for percolation on the enha…

200 papers

Tile (\mathbb{R}^2\) into disjoint unit squares (\{S_k\}_{k \geq 0}\) with the origin being the centre of \(S_0\) and say that (S_i\) and (S_j\) are star adjacent if they share a corner and plus adjacent if they share an edge. Every square…

Probability · Mathematics 2017-04-04 Ghurumuruhan Ganesan

A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…

Probability · Mathematics 2024-02-21 Geoffrey R. Grimmett , Zhongyang Li

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

Statistical Mechanics · Physics 2013-04-04 Stefan Nowak , Joachim Krug

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

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

Mathematical Physics · Physics 2016-10-18 Kathleen E. Hamilton , Leonid P. Pryadko

Unitary transformations are an essential tool for the theoretical understanding of many systems by mapping them to simpler effective models. A systematically controlled variant to perform such a mapping is a perturbative continuous unitary…

Strongly Correlated Electrons · Physics 2015-03-20 H. Krull , N. A. Drescher , G. S. Uhrig

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

Probability · Mathematics 2023-07-10 David Corlin Marchand

A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…

Disordered Systems and Neural Networks · Physics 2009-02-05 H. M. Harreis , W. Bauer

We investigate by exact optimization the geometrical properties of three-dimensional elastic line systems with point disorder and hard-core repulsion. The line 'forests' become entangled due to increasing line wandering as the system height…

Superconductivity · Physics 2009-11-10 Viljo Petaja , Mikko Alava , Heiko Rieger

Embedding tree-like data, from hierarchies to ontologies and taxonomies, forms a well-studied problem for representing knowledge across many domains. Hyperbolic geometry provides a natural solution for embedding trees, with vastly superior…

Machine Learning · Computer Science 2025-02-25 Max van Spengler , Pascal Mettes

In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…

Combinatorics · Mathematics 2013-01-31 Matthias Hamann

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

Dynamical Systems · Mathematics 2022-01-07 A. Baraviera , R. Leplaideur

We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has optimal dependence on $\varepsilon$ under Gap-ETH. For any fixed dimension $d\geq 2$ and for any $\varepsilon>0$ our randomized algorithm gives a…

Computational Geometry · Computer Science 2026-03-11 Sándor Kisfaludi-Bak , Saeed Odak , Satyam Singh , Geert van Wordragen

We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…

Geometric Topology · Mathematics 2025-05-12 Abhijit Champanerkar , Ilya Kofman

An analysis of water clustering is used to study the quasi-2D percolation transition of water adsorbed at planar hydrophilic surfaces. Above the critical temperature of the layering transition (quasi-2D liquid-vapor phase transition of…

Statistical Mechanics · Physics 2009-11-11 A. Oleinikova , I. Brovchenko , A. Geiger

Capillary rise plays a crucial role in the construction of road embankments in flood zones, where hydrophobic compounds are added to the soil to suppress the rising of water and avoid possible damage of the pavement. Water rises through…

Computational Physics · Physics 2017-08-02 M. A. Cárdenas-Barrantes , J. D. Muñoz , N. A. M. Araujo

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

It has been shown that a hot and dense deconfined nuclear matter state produced in ultra-relativistic heavy-ion collisions, can be quantitatively described by the String Percolation phenomenological model. The model address the phase…

Statistical Mechanics · Physics 2017-07-25 J. E. Ramírez , A. Fernández Téllez , I. Bautista

Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…

Disordered Systems and Neural Networks · Physics 2019-12-25 Ginestra Bianconi , Ivan Kryven , Robert M. Ziff

We use invasion percolation to compute numerical values for bond and site percolation thresholds $p_c$ (existence of an infinite cluster) and $p_u$ (uniqueness of the infinite cluster) of tesselations $\{P,Q\}$ of the hyperbolic plane,…

Statistical Mechanics · Physics 2017-10-18 Stephan Mertens , Cristopher Moore