中文
相关论文

相关论文: A Problem in Last-Passage Percolation

200 篇论文

We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…

概率论 · 数学 2013-05-30 Dainius Dzindzalieta

In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of…

概率论 · 数学 2011-12-09 Sébastien Blachère , Frank den Hollander , Jeffrey E. Steif

In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…

组合数学 · 数学 2025-11-18 Zsolt Bartha , Brett Kolesnik , Gal Kronenberg

In this paper we consider first passage percolation on the square lattice \(\mathbb{Z}^d\) with passage times that are independent and have bounded \(p^{th}\) moment for some \(p > 6(1+d),\) but not necessarily identically distributed. For…

概率论 · 数学 2014-09-10 Ghurumuruhan Ganesan

In last passage percolation models lying in the Kardar-Parisi-Zhang universality class, maximizing paths that travel over distances of order $n$ accrue energy that fluctuates on scale $n^{1/3}$; and these paths deviate from the linear…

概率论 · 数学 2019-05-30 Riddhipratim Basu , Shirshendu Ganguly , Alan Hammond

In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…

概率论 · 数学 2025-09-30 Emmanuel Jacob , Céline Kerriou , Amitai Linker , Peter Mörters

We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common distribution is compactly supported in $(0,\infty)$ with a uniformly-positive density. Given $\epsilon>0$ and $v\in\mathbb Z^d$, which…

概率论 · 数学 2023-10-16 Barbara Dembin , Dor Elboim , Ron Peled

We prove Airy process variational formulas for the one-point probability distribution of (discrete time parallel update) TASEP with general initial data, as well as last passage percolation from a general lattice path to a point. We also…

概率论 · 数学 2015-08-13 Ivan Corwin , Zhipeng Liu , Dong Wang

For exponential last passage percolation on the plane we analyse the probability that the point-to-line geodesic exhibits an atypically large transversal fluctuation at the endpoint as well as the probability that the point-to-point…

概率论 · 数学 2025-02-11 Pranay Agarwal , Riddhipratim Basu

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

概率论 · 数学 2022-05-31 Naoki Kubota , Masato Takei

For systems of coupled differential equations on a sequence of W-random graphs, we derive the continuum limit in the form of an evolution integral equation. We prove that solutions of the initial value problems (IVPs) for the discrete model…

适应与自组织系统 · 物理学 2015-06-15 Georgi S. Medvedev

We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…

概率论 · 数学 2007-05-23 D. A. Dawson , L. G. Gorostiza

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…

概率论 · 数学 2015-01-13 S. Friedli , D. Ioffe , Y. Velenik

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

概率论 · 数学 2014-05-16 Daiwei He

We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we…

概率论 · 数学 2013-11-14 Matthew I. Roberts , Lee Zhuo Zhao

We consider first-passage percolation on the two-dimensional integer lattice Z^2 with passage times that are IID exponentials of mean one. It has been conjectured, based on numerical evidence, that the variance of the time T(0,n) to reach…

概率论 · 数学 2007-05-23 Robin Pemantle , Yuval Peres

Let $\{\xi(k), k \in \mathbb{Z} \}$ be a stationary sequence of random variables with conditions of type $D(u_n)$ and $D'(u_n)$. Let $\{S_n, n \in \mathbb{N} \}$ be a transient random walk in the domain of attraction of a stable law. We…

概率论 · 数学 2019-10-11 Nicolas Chenavier , Ahmad Darwiche

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

概率论 · 数学 2015-04-28 Daniel Ahlberg

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

概率论 · 数学 2023-07-19 Shuxiong Zhang

We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter $0$ or $1$ according to Bernoulli r.v.'s with parameter $p$. The environment is the resulting graph obtained from…

概率论 · 数学 2025-01-03 Pablo A. Gomes , Otávio Lima , Roger W C Silva