中文
相关论文

相关论文: Maximum Percolation Time on the q-ary Hypercube

200 篇论文

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…

概率论 · 数学 2024-12-31 David Coupier , Benoît Henry , Benedikt Jahnel , Jonas Köppl

The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…

统计力学 · 物理学 2011-12-06 Wouter G. Ellenbroek , Xiaoming Mao

The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…

统计力学 · 物理学 2009-10-31 Steven C. van der Marck

For $k$-graphs $F$ and $H_0$ the $F$-bootstrap percolation process (or $F$-process) starting with $H_0$ is a sequence $(H_i)_{i\geq0}$ of $k$-graphs such that $H_{i+1}$ is obtained from $H_i$ by adding all those $e\in V(H_0)^{(k)}\setminus…

组合数学 · 数学 2026-04-07 Weichan Liu , Bjarne Schülke , Xin Zhang

We present study of finite-size scaling and universality of crossing probabilities for the $q$-state Potts model. Crossing probabilities of the Potts model are similar ones in percolation problem. We numerically investigated scaling of…

无序系统与神经网络 · 物理学 2007-05-23 O. A. Vasilyev

We consider Metropolis Glauber dynamics for sampling proper $q$-colourings of the $n$-vertex complete $b$-ary tree when $3\leq q\leq b/2\ln(b)$. We give both upper and lower bounds on the mixing time. For fixed $q$ and $b$, our upper bound…

计算复杂性 · 计算机科学 2008-06-06 Leslie Ann Goldberg , Mark Jerrum , Marek Karpinski

We study codes with parameters of $q$-ary shortened Hamming codes, i.e., $(n=(q^m-q)/(q-1), q^{n-m}, 3)_q$. Firstly, we prove the fact mentioned in 1998 by Brouwer et al. that such codes are optimal, generalizing it to a bound for multifold…

组合数学 · 数学 2023-06-29 Minjia Shi , Rongsheng Wu , Denis S. Krotov

Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…

概率论 · 数学 2021-10-26 Victor Falgas-Ravry , Amites Sarkar

We consider supercritical site percolation on the $d$-dimensional hypercube $Q^d$. We show that typically all components in the percolated hypercube, besides the giant, are of size $O(d)$. This resolves a conjecture of Bollob\'as,…

概率论 · 数学 2022-04-12 Sahar Diskin , Michael Krivelevich

We consider bond percolation on the $d$-dimensional binary hypercube with $p=c/d$ for fixed $c>1$. We prove that the typical diameter of the giant component $L_1$ is of order $\Theta(d)$, and the typical mixing time of the lazy random walk…

概率论 · 数学 2026-05-07 Michael Anastos , Sahar Diskin , Lyuben Lichev , Maksim Zhukovskii

Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two…

概率论 · 数学 2021-12-07 Ivailo Hartarsky

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…

无序系统与神经网络 · 物理学 2009-11-11 Robert M. Ziff , Christian R. Scullard

While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…

材料科学 · 物理学 2021-04-20 Shiva Pokhrel , Brendon Waters , Solveig Felton , Zhi-Feng Huang , Boris Nadgorny

We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson…

概率论 · 数学 2007-05-23 A. Gillett , M. Nuyens

The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…

无序系统与神经网络 · 物理学 2012-08-02 D. J. Priour

We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes of the smallest percolating sets in multidimensional tori…

组合数学 · 数学 2021-05-11 Lianna Hambardzumyan , Hamed Hatami , Yingjie Qian

We study the metal-insulator transition on a three dimensional quantum percolation model by analyzing energy level statistics. The quantum percolation threshold $\pq$, which is larger than the classical percolation threshold $\pc$, becomes…

无序系统与神经网络 · 物理学 2007-05-23 Atsushi Kaneko , Tomi Ohtsuki

The phase diagram of the metal-insulator transition in a three dimensional quantum percolation problem is investigated numerically based on the multifractal analysis of the eigenstates. The large scale numerical simulation has been…

无序系统与神经网络 · 物理学 2014-11-26 Laszlo Ujfalusi , Imre Varga

Consider nearest-neighbor oriented percolation in $d+1$ space-time dimensions. Let $\rho,\eta,\nu$ be the critical exponents for the survival probability up to time $t$, the expected number of vertices at time $t$ connected from the…

概率论 · 数学 2018-04-18 Akira Sakai

Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $\omega_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least…

概率论 · 数学 2009-11-10 Federico Camia