中文
相关论文

相关论文: Counting planar random walk holes

200 篇论文

We demonstrate here that the metric of a planar black hole in asymptotic Anti-de Sitter space can, on a slice of dimension 3+1, be reproduced as a relativistic acoustic metric. This completes an earlier calculation in which the…

广义相对论与量子宇宙学 · 物理学 2015-12-22 S. Hossenfelder

A famous result by Hammersley and Versik-Kerov states that the length $L_n$ of the longest increasing subsequence among $n$ iid continuous random variables grows like $2\sqrt{n}$. We investigate here the asymptotic behavior of $L_n$ for…

组合数学 · 数学 2025-11-24 Anne-Laure Basdevant , Lucas Gerin , Maxime Marivain

Critical catalytic branching random walk on d-dimensional integer lattice is investigated for all d. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is…

概率论 · 数学 2015-02-17 Ekaterina Bulinskaya

We study the modes of evolution of massless scalar fields in the asymptotically AdS spacetime surrounding maximally symmetric black holes of large and intermediate size in the Lovelock model. It is observed that all modes are purely damped…

广义相对论与量子宇宙学 · 物理学 2013-10-07 C. B. Prasobh , V. C. Kuriakose

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

概率论 · 数学 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…

概率论 · 数学 2018-10-01 Bastien Mallein

We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp(C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\log n)$ on $d$-dimensional lattices for $d>2$.

数据结构与算法 · 计算机科学 2019-11-27 Samuel Zbarsky

Let $p$ be a prime and $n$ a positive integer such that $\sqrt{\frac p2} + 1 \leq n \leq \sqrt{p}$. For any arithmetic progression $A$ of length $n$ in $\mathbb{F}_p$, we establish an asymptotic formula for the number of directions…

数论 · 数学 2022-04-19 Greg Martin , Ethan Patrick White , Chi Hoi Yip

Let $n = b_1 + ... + b_k = b_1' + \cdot + b_k'$ be a pair of compositions of $n$ into $k$ positive parts. We say this pair is {\em irreducible} if there is no positive $j < k$ for which $b_1 + ... b_j = b_1' + ... b_j'$. The probability…

组合数学 · 数学 2007-05-23 Edward A. Bender , Gregory F. Lawler , Robin Pemantle , Herbert S. Wilf

Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…

动力系统 · 数学 2020-09-23 Uriya Pumerantz

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

组合数学 · 数学 2014-03-06 Mikhail Lavrov , Po-Shen Loh

We pursue the analysis made in [1] on the arithmetic area enclosed by m closed Brownian paths. We pay a particular attention to the random variable S{n1,n2, ...,n} (m) which is the arithmetic area of the set of points, also called winding…

数学物理 · 物理学 2015-06-04 Jean Desbois , Stephane Ouvry

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

Preprocessing a 2D image often produces a noisy cloud of interest points. We study the problem of counting holes in unorganized clouds in the plane. The holes in a given cloud are quantified by the topological persistence of their boundary…

计算几何 · 计算机科学 2016-11-18 Vitaliy Kurlin

In this note we address some issues of recent interest, related to the asymptotic symmetry algebra of higher spin black holes in $sl(3,\mathbb{R})\times sl(3,\mathbb{R})$ Chern Simons (CS) formulation. We compute the fixed time Dirac…

高能物理 - 理论 · 物理学 2015-07-09 Alejandro Cabo-Bizet , V. I. Giraldo-Rivera

For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are bounded above. (Elkies has shown that any such…

数论 · 数学 2014-10-02 Ryan D'Mello

Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…

概率论 · 数学 2009-02-18 Kilian Raschel

We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…

概率论 · 数学 2017-11-29 Sergey Foss , Zbigniew Palmowski , Stan Zachary

We consider the thick points of random walk, i.e. points where the local time is a fraction of the maximum. In two dimensions, we answer a question of Dembo, Peres, Rosen and Zeitouni and compute the number of thick points of planar random…

概率论 · 数学 2020-03-02 Antoine Jego

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

数据结构与算法 · 计算机科学 2024-06-04 Vedat Levi Alev , Shravas Rao