It is easy to obtain a site percolation model from a bond percolation model on a graph $G$ using the covering graph $G_c$ of $G$. I wondered if one can obtain any site percolation model from any site bond and I read in the Geoffrey Grimmett's book that is not true. Nevertheless he does not give any counterexample, and I cannot imagine someone. Can anybody give me a counter example?
2025-01-13 07:44:17.1736754257
Site percolation model that cannot be obtained from a bond percolation model
149 Views Asked by José Milán https://math.techqa.club/user/jose-milan/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- Logic & Reasoning Question
- Category Theory compared with Meta-Grammars (or Hyper-Grammars) in Programming Languages
- Does this have a Euler circuit or a Euler path?
- cycle graph with $10$ v colouring with $11$
- Directed acyclic graph and adjacency matrix
- Why is there, for every language L in NP, a Turing machine with polynomial memory that also accepts L?
- How to prove vertex basis?
- Scheduling and coloring problem
- Chromatic polynomial of dual graphs
- Subdivision of nonplanar graph is nonplanar?
Related Questions in PERCOLATION
- Is it possible to construct graphs with any critical bond percolation probability?
- Percolation events
- Site percolation model that cannot be obtained from a bond percolation model
- "Chemists triple point" in percolation theory
- Probability $u, v$ are connected in a random graph model
- Condition for global cascade
- Why is the Erdos-Renyi model called a mean field theory of percolation?
- Help with visualizing the matching lattice of a triangular lattice
- Find $B_n$ such that $\mathbb{P}_p(A \mathbin{\Delta} B_n)=0$
- How does one interpret last passage percolation?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Refuting the Anti-Cantor Cranks
- Find $E[XY|Y+Z=1 ]$
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- What are the Implications of having VΩ as a model for a theory?
- How do we know that the number $1$ is not equal to the number $-1$?
- Defining a Galois Field based on primitive element versus polynomial?
- Is computer science a branch of mathematics?
- Can't find the relationship between two columns of numbers. Please Help
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- A community project: prove (or disprove) that $\sum_{n\geq 1}\frac{\sin(2^n)}{n}$ is convergent
- Alternative way of expressing a quantied statement with "Some"
Popular # Hahtags
real-analysis
calculus
linear-algebra
probability
abstract-algebra
integration
sequences-and-series
combinatorics
general-topology
matrices
functional-analysis
complex-analysis
geometry
group-theory
algebra-precalculus
probability-theory
ordinary-differential-equations
limits
analysis
number-theory
measure-theory
elementary-number-theory
statistics
multivariable-calculus
functions
derivatives
discrete-mathematics
differential-geometry
inequality
trigonometry
Popular Questions
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- How to find mean and median from histogram
- Difference between "≈", "≃", and "≅"
- Easy way of memorizing values of sine, cosine, and tangent
- How to calculate the intersection of two planes?
- What does "∈" mean?
- If you roll a fair six sided die twice, what's the probability that you get the same number both times?
- Probability of getting exactly 2 heads in 3 coins tossed with order not important?
- Fourier transform for dummies
- Limit of $(1+ x/n)^n$ when $n$ tends to infinity
It seems as though "covering graph" is just another name for "line graph". As you can find in the "characterization" section of that wiki page, not every graph appears as a line graph of some other graph. A small 5 vertex example is shown there. I am not familiar with percolation, but I think this is basically what you are asking.