中文
相关论文

相关论文: On the Distribution of Range for Tree-Indexed Rand…

200 篇论文

We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…

概率论 · 数学 2025-12-03 Marek Biskup

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…

概率论 · 数学 2025-12-02 Michael J. Larsen

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

统计力学 · 物理学 2009-11-11 G. Oshanin , R. Voituriez , S. Nechaev , O. Vasilyev , F. Hivert

In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…

概率论 · 数学 2016-06-24 Pierre Andreoletti , Xinxin Chen

We construct forests that span $\mathbb{Z}^d$, $d\geq2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as short as possible. For $d\geq3$, two independent copies of…

概率论 · 数学 2007-05-23 Maury Bramson , Ofer Zeitouni , Martin P. W. Zerner

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

组合数学 · 数学 2009-11-07 T. H. Baker , P. J. Forrester

Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…

概率论 · 数学 2007-05-23 Massimo Campanino , Dimitri Petritis

The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that the absolute differences induced on the edges are pairwise…

组合数学 · 数学 2020-06-23 Anna Adamaszek , Peter Allen , Codrut Grosu , Jan Hladky

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

统计力学 · 物理学 2019-09-02 Reza Sepehrinia , Abbas Ali Saberi , Hor Dashti-Naserabadi

In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…

组合数学 · 数学 2013-10-21 Sayan Mukherjee , John Steenbergen

We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first $n$ steps. Considering lattices $\mathbb{Z}^d$, in dimensions $d \geq 5$, we…

概率论 · 数学 2026-01-16 Ritesh Goenka , Peter Keevash , Tomasz Przybyłowski

Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from $i$ to $j$ if the loop erased walk makes a step from $i$ to $j$. We…

概率论 · 数学 2007-05-23 Jomy Alappattu , Jim Pitman

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

统计力学 · 物理学 2022-11-23 E. Ben-Naim , P. L. Krapivsky

Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…

物理与社会 · 物理学 2016-10-11 Tongfeng Weng , Jie Zhang , Moein Khajehnejad , Michael Small , Rui Zheng , Pan Hui

We investigate the properties of a deterministic walk, whose locomotion rule is always to travel to the nearest site. Initially the sites are randomly distributed in a closed rectangular ($A/L \times L)$ landscape and, once reached, they…

无序系统与神经网络 · 物理学 2009-11-13 M. C. Santos , D. Boyer , O. Miramontes , G. M. Viswanathan , E. P. Raposo , J. L. Mateos , M. G. E. da Luz

We consider biased random walk on regular tree and we obtain the spectral radius, first return probability and $n$-step transition probability.

概率论 · 数学 2022-07-15 He Song

The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…

组合数学 · 数学 2022-03-10 Svante Janson

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

概率论 · 数学 2013-10-04 Frank Redig , Florian Völlering

We study a scenario under which variable step random walks give anomalous statistics. We begin by analyzing the Martingale Central Limit Theorem to find a sufficient condition for the limit distribution to be non-Gaussian. We note that the…

数据分析、统计与概率 · 物理学 2009-11-10 Gemunu H. Gunaratne , Joseph L. McCauley , Matthew Nicol , Andrei Torok

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

统计力学 · 物理学 2015-06-19 Denis Boyer , Citlali Solis-Salas