Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Subcritical percolation with a line of defects (1103.0411v3)

Published 2 Mar 2011 in math.PR, cond-mat.stat-mech, math-ph, and math.MP

Abstract: We consider the Bernoulli bond percolation process $\mathbb{P}{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which this probability is $p'$. Define [\xi{p,p'}:=-\lim_{n\to\infty}n{-1}\log \mathbb{P}{p,p'}(0\leftrightarrow n\mathbf {e}_1)] and $\xi_p:=\xi{p,p}$. We show that there exists $p_c'=p_c'(p,d)$ such that $\xi_{p,p'}=\xi_p$ if $p'<p_c'$ and $\xi_{p,p'}<\xi_p$ if $p'>p_c'$. Moreover, $p_c'(p,2)=p_c'(p,3)=p$, and $p_c'(p,d)>p$ for $d\geq 4$. We also analyze the behavior of $\xi_p-\xi_{p,p'}$ as $p'\downarrow p_c'$ in dimensions $d=2,3$. Finally, we prove that when $p'>p_c'$, the following purely exponential asymptotics holds: [\mathbb {P}{p,p'}(0\leftrightarrow n\mathbf {e}_1)=\psi_de{-\xi{p,p'}n}\bigl(1+o(1)\bigr)] for some constant $\psi_d=\psi_d(p,p')$, uniformly for large values of $n$. This work gives the first results on the rigorous analysis of pinning-type problems, that go beyond the effective models and don't rely on exact computations.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.