English
Related papers

Related papers: Random walks on barycentric subdivisions and the S…

200 papers

This work addresses problems on simultaneous Diophantine approximation on fractals, motivated by a long standing problem of Mahler regarding Cantor's middle $1/3$ set. We obtain the first instances where a complete analogue of Khintchine's…

Dynamical Systems · Mathematics 2022-11-11 Osama Khalil , Manuel Luethi

We prove Barlow--Bass type resistance estimates for two random walks associated with repeated barycentric subdivisions of a triangle. If the random walk jumps between the centers of triangles in the subdivision that have common sides, the…

Probability · Mathematics 2018-06-26 Daniel J. Kelleher , Antoni Brzoska , Hugo Panzo , Alexander Teplyaev

Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that…

Soft Condensed Matter · Physics 2011-03-08 Peter Hinow

We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…

Dynamical Systems · Mathematics 2016-11-21 David Simmons , Barak Weiss

In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…

General Mathematics · Mathematics 2013-07-04 Yanyan Zhuang , Jianping Pan

In a first part, using the recent measure classification results of Eskin--Lindenstrauss, we give a criterion to ensure a.s. equidistribution of empirical measures of an i.i.d. random walk on a homogeneous space $G/\Gamma$. Employing…

Dynamical Systems · Mathematics 2020-09-17 Roland Prohaska , Cagri Sert

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

We investigate bond percolation on the iterated barycentric subdivision of a triangle, the hexacarpet, and the non-p.c.f. Sierpinski gasket. With the use of the diamond fractal, we are able to bound the critical probability of percolation…

Probability · Mathematics 2013-12-19 Derek Lougee , Benjamin Steinhurst

Simple time-reversible systems can generate {\it irreversible} flows satisfying the Second Law of Thermodynamics. Maps, and equivalent random walks, can also do this. We study a pair of time-reversible Baker Maps, $N2$ and $N3$, which…

Chaotic Dynamics · Physics 2023-03-30 William Graham Hoover , Carol Griswold Hoover

We study the mean and variance of the number of self-intersections of the equilateral isotropic random walk in the plane, as well as the corresponding quantities for isotropic equilateral random polygons (random walks conditioned to return…

Probability · Mathematics 2015-08-26 Max B. Kutler , Margaret Rogers , Nicholas Pippenger

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

Probability · Mathematics 2007-05-23 Itai Benjamini , Robin Pemantle , Yuval Peres

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön , Elmar Teufl

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

Probability · Mathematics 2014-08-06 Eviatar B. Procaccia , Eric Shellef

This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…

General Topology · Mathematics 2025-11-24 Sanjay Mishra

The fractal properties of four-dimensional Euclidean simplicial manifold generated by the dynamical triangulation are analyzed on the geodesic distance D between two vertices instead of the usual scale between two simplices. In order to…

High Energy Physics - Lattice · Physics 2008-11-26 H. S. Egawa , S. Horata , T. Yukawa

We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…

Probability · Mathematics 2014-12-18 Ron Rosenthal

Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. In this work…

Computational Complexity · Computer Science 2016-09-15 Tali Kaufman , David Mass

We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…

Statistical Mechanics · Physics 2026-04-24 Jiang Zhou , Ziru Deng , Pengcheng Hou

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Data Structures and Algorithms · Computer Science 2015-07-09 Siu On Chan , Tsz Chiu Kwok , Lap Chi Lau
‹ Prev 1 2 3 10 Next ›