中文
相关论文

相关论文: Induced measures of simple random walks on Sierpin…

200 篇论文

For a Markov chain $Y$ with values in a Polish space, consider the entrance chain, obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit chain, obtained by sampling…

概率论 · 数学 2025-05-15 Aleksandar Mijatovic , Vladislav Vysotsky

We study the asymptotics of the $k$-regular self-similar fragmentation process. For $\alpha > 0$ and an integer $k \geq 2$, this is the Markov process $(I_t)_{t \geq 0}$ in which each $I_t$ is a union of open subsets of $[0,1)$, and…

Let $\Cal S$ be an abelian group of automorphisms of a probability space $(X, {\Cal A}, \mu)$ with a finite system of generators $(A_1, ..., A_d)$. Let $A^{\el}$ denote $A_1^{\ell_1} ... A_d^{\ell_d}$, for ${\el}= (\ell_1, ..., \ell_d)$. If…

概率论 · 数学 2014-11-14 Jean-Pierre Conze , Guy Cohen

Let $\mathbf X=(X_{jk})_{j,k=1}^n$ denote a Hermitian random matrix with entries $X_{jk}$, which are independent for $1\le j\le k\le n$. We consider the rate of convergence of the empirical spectral distribution function of the matrix…

概率论 · 数学 2015-02-10 F. Götze , A. N. Tikhomirov

The time it takes a random walker in a lattice to reach the origin from another vertex $x$, has infinite mean. If the walker can restart the walk at $x$ at will, then the minimum expected hitting time $T(x,0)$ (minimized over restarting…

概率论 · 数学 2010-05-25 Svante Janson , Yuval Peres

Running a random walk in a convex body $K\subseteq\mathbb{R}^n$ is a standard approach to sample approximately uniformly from the body. The requirement is that from a suitable initial distribution, the distribution of the walk comes close…

数据结构与算法 · 计算机科学 2024-12-18 Hariharan Narayanan , Amit Rajaraman , Piyush Srivastava

The Skorokhod Embedding problem is well understood when the underlying process is a Brownian motion. We examine the problem when the underlying is the simple symmetric random walk and when no external randomisation is allowed. We prove that…

概率论 · 数学 2007-05-23 Alexander M. G. Cox , Jan Obloj

We introduce a model of branching interlacements for general critical offspring distributions. It consists of a countable collection of infinite tree-indexed random walk trajectories on $Z^d,d\geq5$. We show that this model turns out to be…

概率论 · 数学 2019-12-03 Qingsan Zhu

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

概率论 · 数学 2020-07-31 Bartłomiej Polaczyk

Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…

概率论 · 数学 2016-08-16 Nathanaël Berestycki

We investigate the average hitting times of simple random walks on the $k$-th power graph $C_N^k$ of the cycle graph $C_N$. First, we show that the average hitting times are characterized by a difference equation corresponding to the graph…

组合数学 · 数学 2026-05-13 Tsuyoshi Miezaki , Shunya Tamura

Fix an irrational number $\alpha$. Let $X_1,X_2,\cdots$ be independent, identically distributed, integer-valued random variables with characteristic function $\varphi$, and let $S_n=\sum_{i=1}^n X_i$ be the partial sums. Consider the random…

概率论 · 数学 2024-11-26 Bingyao Wu , Jie-Xiang Zhu

We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…

统计理论 · 数学 2011-10-05 Yunjiang Jiang

We show that (equivariant) K-theoretic 3-point Gromov-Witten invariants of genus zero on a Grassmann variety are equal to triple intersections computed in the ordinary (equivariant) K-theory of a two-step flag manifold, thus generalizing an…

代数几何 · 数学 2019-12-19 Anders S. Buch , Leonardo C. Mihalcea

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

概率论 · 数学 2019-11-14 Joel Friedman , David Kohler

We study a model of random walk on a fluctuating rough surface using the field-theoretic renormalization group (RG). The surface is modelled by the well-known Kardar--Parisi--Zhang (KPZ) stochastic equation while the random walk is…

统计力学 · 物理学 2025-05-13 N. V. Antonov , N. M. Gulitskiy , P. I. Kakin , A. S. Romanchuk

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

概率论 · 数学 2007-05-23 A. Vershik

We consider the random walks killed at the boundary of the quarter plane, with homogeneous non-zero jump probabilities to the eight nearest neighbors and drift zero in the interior, and which admit a positive harmonic polynomial of degree…

概率论 · 数学 2010-11-22 Kilian Raschel

Let $Q$ be a probability measure on a finite group $G$, and let $H$ be a subgroup of $G$. We show that a necessary and sufficient condition for the random walk driven by $Q$ on $G$ to induce a Markov chain on the double coset space…

群论 · 数学 2024-02-28 John R. Britnell , Mark Wildon

We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…

概率论 · 数学 2017-03-14 Ron Peled , Yinon Spinka