中文
相关论文

相关论文: Unimodular Hyperbolic Triangulations: Circle Packi…

200 篇论文

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 study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

概率论 · 数学 2012-10-08 Christophe Gallesco , Serguei Popov

We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees. In the limit where the complex parameter $z$ approaches a given location $\lambda$…

概率论 · 数学 2016-09-30 Justin Salez

A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…

动力系统 · 数学 2016-07-19 Victor Kleptsyn , Denis Volk

We consider an n-dimensional Brownian Motion trapped inside a bounded convex set by normally-reflecting boundaries. It is well-known that this process is uniformly ergodic. However, the rates of this ergodicity are not well-understood,…

概率论 · 数学 2022-08-04 Jackson Loper

A random walk $w_n$ on a separable, geodesic hyperbolic metric space $X$ converges to the boundary $\partial X$ with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes…

几何拓扑 · 数学 2021-01-22 Matt Sunderland

We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an…

概率论 · 数学 2017-10-10 Omer Angel , Tom Hutchcroft

We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…

组合数学 · 数学 2009-08-06 Luke Kelly

We consider a particle undergoing run and tumble dynamics, in which its velocity stochastically reverses, in one dimension. We study the addition of a Poissonian resetting process occurring with rate $r$. At a reset event the particle's…

统计力学 · 物理学 2019-06-05 Martin R. Evans , Satya N. Majumdar

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

概率论 · 数学 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

We study the once-reinforced random walk on $\mathbb Z^d$, which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that the walk is transient when $d\ge 6$ and when the reinforcement…

概率论 · 数学 2026-01-27 Dor Elboim , Gady Kozma

We give a new proof that the Poisson boundary of a planar graph coincides with the boundary of its square tiling and with the boundary of its circle packing, originally proven by Georgakopoulos and Angel, Barlow, Gurel-Gurevich and Nachmias…

概率论 · 数学 2018-05-01 Tom Hutchcroft , Yuval Peres

When an integrable two-degrees-of-freedom Hamiltonian system possessing a circle of parabolic fixed points is perturbed, a parabolic resonance occurs. It is proved that its occurrence is generic for one parameter families (co-dimension one…

动力系统 · 数学 2018-04-18 Vered Rom-Kedar

We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ${\cal D}(n,p)$ for nearly optimal $p$ (up to a $\log ^cn$ factor). In particular, we show that given $t = (1-o(1))np$ Hamilton cycles $C_1,\ldots ,C_{t}$,…

组合数学 · 数学 2016-03-14 Asaf Ferber , Eoin Long

Random walks and Lorentz processes serve as fundamental models for Brownian motion. The study of random walks is a favorite object of probability theory, whereas that of Lorentz processes belongs to the theory of hyperbolic dynamical…

概率论 · 数学 2025-01-03 Domokos Szasz

We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…

概率论 · 数学 2009-10-23 Gideon Amir , Ori Gurel-Gurevich

Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…

概率论 · 数学 2025-07-22 Gonzalo Panizo , Carlos Martínez

Thurston's triangulation conjecture asserts that every hyperbolic 3-manifold admits a geometric triangulation into hyper-ideal hyperbolic tetrahedra. So far, this conjecture had only been proven for a few special 3-manifolds. In this…

几何拓扑 · 数学 2025-03-11 Ke Feng , Huabin Ge , Yunpeng Meng

In this paper, we study the regularity properties of bounded entropy solutions to the isentropic Euler equations with $\gamma = 3$. First, we use a blow-up technique to obtain a new trace theorem for all such solutions. Second, we use a…

偏微分方程分析 · 数学 2022-09-19 William Golding

We find new necessary and sufficient conditions for the bicycling monodromy of a closed plane curve to be hyperbolic. Our main tool is the ``hyperbolic development" interpretation of the bicycling monodromy of plane curves. Based on…

微分几何 · 数学 2025-01-07 G. Bor , L. Hernández-Lamoneda , S. Tabachnikov