English
Related papers

Related papers: A note on the hitting probabilities of random cove…

200 papers

In this paper we consider functions of the type $$f(x) = \sum_{n=0}^\infty a_n g(b_nx+\theta_n),$$ where $(a_n)$ are independent random variables uniformly distributed on $(-a^n, a^n)$ for some $0<a<1$, $b_{n+1}/b_n \geq b >1$, $a^2b> 1$…

Dynamical Systems · Mathematics 2015-06-18 Julia Romanowska

In this paper we study the cover time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs on $\mathrm{Poi}(n)$ vertices. We show that the cover time undergoes a jump at the connectivity…

Probability · Mathematics 2025-02-03 Carlos Martinez , Dieter Mitsche

We consider a random walk on a closed manifold $M$ driven by a probability measure $\mu$ on the space of $C^2$ diffeomorphisms. Provided $\mu$ has compact support, satisfies certain gap and pinching conditions, and is weak-$*$ close to a…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Zhiyuan Zhang

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…

Geometric Topology · Mathematics 2016-02-24 Hidetoshi Masai

We consider classes $\mathscr{G}^s ([0,1])$ of subsets of $[0,1]$, originally introduced by Falconer, that are closed under countable intersections, and such that every set in the class has Hausdorff dimension at least $s$. We provide a…

Number Theory · Mathematics 2017-09-12 Tomas Persson , Henry W. J. Reeve

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss

In this article, we estimate the Hausdorff dimension of dynamical coverings with respect to mixing ergodic systems. More precisely, if the ergodic measure is exact-dimensionnal, we establish a formula provided that the system is…

Dynamical Systems · Mathematics 2025-10-13 E. Daviaud

In the study of the observability of the wave equation (here on $(0,T)\times \mathbb{T}^d$, where $\mathbb{T}^d$ is the d-dimensional torus), a condition naturally emerges as a sufficient observability condition. This condition, which…

Probability · Mathematics 2024-07-02 Léa Gohier

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

Metric Geometry · Mathematics 2025-12-25 Steven Hoehner , Gil Kur

Let $\{f(t): t\in T\}$ be a smooth Gaussian random field over a parameter space $T$, where $T$ may be a subset of Euclidean space or, more generally, a Riemannian manifold. For any local maximum of $f(t)$ located at $t_0$ in the interior of…

Probability · Mathematics 2014-12-24 Dan Cheng , Armin Schwartzman

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Dynamical Systems · Mathematics 2017-09-19 Changguang Dong

Let $G = O^{p'}(\bar{G}^F)$ be a finite simple group of Lie type defined over a field of characteristic $p$, where $F$ is a Steinberg endomorphism of the ambient simple algebraic group $\bar{G}$. Let $\bar{T}$ be an $F$-stable maximal torus…

Group Theory · Mathematics 2022-12-15 Timothy C. Burness , Adam R. Thomas

Let $X_1,\dots,X_n$ be independent centered random vectors in $\mathbb{R}^d$. This paper shows that, even when $d$ may grow with $n$, the probability $P(n^{-1/2}\sum_{i=1}^nX_i\in A)$ can be approximated by its Gaussian analog uniformly in…

Statistics Theory · Mathematics 2022-03-08 Yuta Koike

Given an infinite topological group G and a cardinal k>0, we say that G is almost k-free if the set of k-tuples in G^k which freely generate free subgroups of G is dense in G^k. In this note we examine groups having this property and…

Group Theory · Mathematics 2011-10-05 Zachary Mesyan

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…

Dynamical Systems · Mathematics 2015-05-11 Henna Koivusalo

We study a family of random Taylor series $$F(z) = \sum_{n\ge 0} \zeta_n a_n z^n$$ with radius of convergence almost surely $1$ and independent identically distributed complex Gaussian coefficients $(\zeta_n)$; these Taylor series are…

Complex Variables · Mathematics 2017-03-16 Jeremiah Buckley , Alon Nishry , Ron Peled , Mikhail Sodin

We show that set of points nondense under the $\times n$-map on the circle and dense for the geodesic flow under the induced map on the circle corresponding to the expanding horospherical subgroup has full Haudorff dimension. We also show…

Dynamical Systems · Mathematics 2015-01-13 Ronggang Shi , Jimmy Tseng

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…

Computational Complexity · Computer Science 2015-03-05 Cristopher Moore

Given a closed semi-algebraic set $X \subset \mathbb{R}^n$ and a continuous semi-algebraic mapping $G \colon X \to \mathbb{R}^m,$ it will be shown that there exists an open dense semi-algebraic subset $\mathscr{U}$ of $L(\mathbb{R}^n,…

Algebraic Geometry · Mathematics 2021-04-05 Si Tiep Dinh , Zbigniew Jelonek , Tien Son Pham

In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…

Combinatorics · Mathematics 2010-09-23 Matthew Kahle
‹ Prev 1 4 5 6 7 8 10 Next ›