中文
相关论文

相关论文: Paths with exponential intersection tails and orie…

200 篇论文

A random variable $\xi$ has a {\it light-tailed} distribution (for short: is light-tailed) if it possesses a finite exponential moment, $\E \exp (\lambda \xi) <\infty$ for some $\lambda >0$, and has a {\it heavy-tailed} distribution (is…

概率论 · 数学 2026-03-09 Sergey Foss , Michael Scheutzow , Anton Tarasenko

We investigate properties of two-dimensional finite-scale percolation systems whose size along the current flow is smaller than the perpendicular size. Successive thresholds of appearing multiple percolation channels in such systems have…

无序系统与神经网络 · 物理学 2010-04-05 E. Z. Meilikhov

The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…

概率论 · 数学 2021-12-15 Nicholas R. Beaton , Geoffrey R. Grimmett , Mark Holmes

We investigate a driven two-channel system where particles on different lanes mutually obstruct each others motion extending an earlier model by Popkov and Peschel [1]. This obstruction may occur in biological contexts due to steric…

生物物理 · 物理学 2015-03-13 Anna Melbinger , Tobias Reichenbach , Thomas Franosch , Erwin Frey

Multiple-choice load balancing has been a topic of intense study since the seminal paper of Azar, Broder, Karlin, and Upfal. Questions in this area can be phrased in terms of orientations of a graph, or more generally a k-uniform random…

数据结构与算法 · 计算机科学 2012-02-16 Po-Shen Loh , Rasmus Pagh

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

概率论 · 数学 2011-04-20 Peter Gacs

We show that a single particle in a superposition of different paths can entangle two objects located on each path. The entanglement has its maximum visibility for intermediate coupling strengths. In particular, when the two quantum systems…

量子物理 · 物理学 2014-09-05 Antonio Di Lorenzo

We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with…

概率论 · 数学 2018-06-08 Bernardo N. B. de Lima , Leonardo T. Rolla , Daniel Valesin

We extend path analysis by giving sufficient conditions for computing the partial covariance of two random variables from their covariance. This is specifically done by correcting the covariance with the product of some partial variance…

统计理论 · 数学 2021-11-01 Jose M. Peña

We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…

无序系统与神经网络 · 物理学 2016-08-16 Eduardo López , Sergey V. Buldyrev , Lidia A. Braunstein , Shlomo Havlin , H. Eugene Stanley

We consider last-passage percolation models in two dimensions, in which the underlying weight distribution has a heavy tail of index alpha<2. We prove scaling laws and asymptotic distributions, both for the passage times and for the shape…

概率论 · 数学 2007-05-23 Ben Hambly , James B. Martin

Following the recent investigations of Baik and Suidan in \cite{baik2005gcl} and Bodineau and Martin in \cite{bodineau2005upl}, we prove large deviation properties for a last-passage percolation model in $\mathbb{Z}^{2}_{+}$ whose paths are…

概率论 · 数学 2015-03-13 Jean-Paul Ibrahim

We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…

概率论 · 数学 2024-01-11 David Clancy

Consider a graph in which each site is endowed with a value called \emph{fitness}. A path in the graph is said to be "open" or "accessible" if the fitness values along that path is strictly increasing. We say that there is accessibility…

概率论 · 数学 2014-01-28 Julien Berestycki , Éric Brunet , Zhan Shi

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

概率论 · 数学 2026-05-15 Diana De Armas Bellon , Matthew I. Roberts

We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…

We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…

概率论 · 数学 2021-12-01 Mikhail Khristoforov , Stanislav Smirnov

Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…

概率论 · 数学 2009-05-08 Bela Bollobas , Svante Janson , Oliver Riordan

Near a parity breaking front bifurcation, small perturbations may reverse the propagation direction of fronts. Often this results in nonsteady asymptotic motion such as breathing and domain breakup. Exploiting the time scale differences of…

patt-sol · 物理学 2009-10-30 Aric Hagberg , Ehud Meron , I. Rubinstein , B. Zaltzman

We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…

统计力学 · 物理学 2019-12-11 Stephan Mertens , Cristopher Moore