English
Related papers

Related papers: Extracting subsets maximizing capacity and Folding…

200 papers

This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…

Probability · Mathematics 2008-01-17 Andras Telcs

For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…

Statistics Theory · Mathematics 2016-11-17 Geoffrey Decrouez , Michael Grabchak , Quentin Paris

We prove a weak law of large numbers for the capacity of the range of simple random walks on $\mathbb{Z}^{4}$. On $\mathbb{Z}^{3}$, we show that the capacity, properly scaled, converges in distribution towards the corresponding quantity for…

Probability · Mathematics 2016-11-29 Yinshan Chang

Strong theorems are given for the maximal local time on balls and subspaces for the $d$-dimensional simple symmetric random walk.

Probability · Mathematics 2016-08-16 Endre Csáki , Antónia Földes , Pál Révész

We consider the maximum $M_t$ of branching random walk in a space-inhomogeneous random environment on $\mathbb{Z}$. In this model the branching rate while at some location $x\in\mathbb{Z}$ is randomized in an i.i.d. manner. We prove that…

Probability · Mathematics 2024-12-03 Xaver Kriechbaum

We study the capacity of the range of a transient simple random walk on $\mathbb{Z}^d$. Our main result is a central limit theorem for the capacity of the range for $d\ge 6$. We present a few open questions in lower dimensions.

Probability · Mathematics 2016-02-11 Amine Asselah , Bruno Schapira , Perla Sousi

We study the biased random walk in positive random conductances on $\mathbb {Z}^d$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite…

Probability · Mathematics 2013-12-16 Alexander Fribergh

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

Probability · Mathematics 2014-05-16 Daiwei He

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

General Mathematics · Mathematics 2007-12-20 Binhai Zhu

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$.…

Probability · Mathematics 2018-10-01 Bastien Mallein

A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…

Statistics Theory · Mathematics 2022-08-05 Johan Segers

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

Metric Geometry · Mathematics 2018-02-12 Karoly Bezdek

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We consider a random walk in a random potential on a square lattice of arbitrary dimension. The potential is a function of an ergodic environment and some steps of the walk. The potential can be unbounded, but it is subject to a moment…

Probability · Mathematics 2013-02-12 Firas Rassoul-Agha , Timo Seppäläinen

We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…

Probability · Mathematics 2021-03-05 Ryoki Fukushima , Alejandro F. Ramírez

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

Probability · Mathematics 2017-06-19 Alain-Sol Sznitman

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

Combinatorics · Mathematics 2025-10-30 Boris Bukh , Jun Gao , Xizhi Liu , Oleg Pikhurko , Shumin Sun

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…

Probability · Mathematics 2023-07-06 Enrique Alvarado , Bala Krishnamoorthy , Kevin R. Vixie

We consider random walks in Dirichlet environment (RWDE) on $\Z ^d$, for $ d \geq 3 $, in the sub-ballistic case. We associate to any parameter $ (\alpha_1, ..., \alpha_{2d}) $ of the Dirichlet law a time-change to accelerate the walk. We…

Probability · Mathematics 2012-05-28 Élodie Bouchet

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…

Probability · Mathematics 2007-05-23 Malwina J. Luczak , Colin McDiarmid