• Cite Icon36
  • https://doi.org/10.1017/s0963548310000441Copy DOI Icon

On Barycentric Subdivision

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Consider the barycentric subdivision which cuts a given triangle along its medians to produce six new triangles. Uniformly choosing one of them and iterating this procedure gives rise to a Markov chain. We show that, almost surely, the triangles forming this chain become flatter and flatter in the sense that their isoperimetric values go to infinity with time. Nevertheless, if the triangles are renormalized through a similitude to have their longest edge equal to [0, 1] ⊂ ℂ (with 0 also adjacent to the shortest edge), their aspect does not converge and we identify the limit set of the opposite vertex with the segment [0, 1/2]. In addition we prove that the largest angle converges to π in probability. Our approach is probabilistic, and these results are deduced from the investigation of a limit iterated random function Markov chain living on the segment [0, 1/2]. The stationary distribution of this limit chain is particularly important in our study.

Similar Papers
  • Research Article

Random Walks, Directed Cycles and Markov Chains

  • Dec 07, 2022
  • The American Mathematical Monthly
  • Kate Gingell +1
  • Conference Article

The Mobility Models Affection on 5G MAC-protocol Simulation for Downlink Scheduler Efficiency

  • May 01, 2020
  • 2020 Ural Symposium on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
  • Ruslan Akhpashev +1
  • Conference Article
  • Citations72

Exact sampling and approximate counting techniques

  • Jan 01, 1998
  • Mark Huber
  • Research Article
  • Citations71

Spectrum of large random reversible Markov chains: Heavy-tailed weights on the complete graph

  • Jun 10, 2010
  • The Annals of Probability
  • Charles Bordenave +2
  • PDF
  • Research Article

On Geometric-type Approximations with Applications

  • Dec 07, 2024
  • Methodology and Computing in Applied Probability
  • Fraser Daly +1
  • Research Article

On systematic scan for sampling H‐colorings of the path

  • Oct 14, 2008
  • Random Structures & Algorithms
  • Kasper Pedersen
  • Research Article
  • Citations14

Time-Dependent Energy and Resource Management in Mobility-Aware D2D-Empowered 5G Systems

  • Aug 01, 2017
  • IEEE Wireless Communications
  • Antonino Orsino +6
  • Preprint Article

Use of topographic LiDAR point clouds for building reconstruction

  • Jun 08, 2021
  • Yipeng Yuan
  • Preprint Article

Use of topographic LiDAR point clouds for building reconstruction

  • Jun 08, 2021
  • Yipeng Yuan
  • Research Article
  • Citations20

Consensus Formation in a Two-Time-Scale Markovian System

  • Jan 01, 2009
  • Multiscale Modeling & Simulation
  • Vikram Krishnamurthy +2
  • Research Article

Survey and Review

  • Jan 01, 2021
  • SIAM Review
  • J M Sanz-Serna
  • Research Article
  • Citations24

Unified theory for finite Markov chains

  • Mar 07, 2019
  • Advances in Mathematics
  • John Rhodes +1
  • Research Article
  • Citations1

Stationary Distributions of Discrete-Time Markov Chains in Random Environment: Exact Computations and Bounds

  • Dec 31, 2004
  • Stochastic Models
  • Antonis Economou
  • Research Article
  • Citations107

The Spacey Random Walk: A Stochastic Process for Higher-Order Data

  • Jan 01, 2017
  • SIAM Review
  • Austin R Benson +2
  • Research Article
  • Citations8

Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type

  • Apr 03, 2018
  • Stochastic Models
  • Masatoshi Kimura +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.