Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Bindweeds or random ...
Conference paper

Bindweeds or random walks in random environments on multiplexed trees and their asympotics

Mikhail Menshikov (1), Dimitri Petritis ORCID (2), Serguei Popov (3)
(1) Department of Mathematical Sciences
(2) Institut de Recherche Mathématique de Rennes
(3) Instituto de Matematica
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Proceedings
DOI
10.46298/dmtcs.3324
License
https://about.hal.science/hal-authorisation-v1
Indicators
717
Views
522
Downloads

Bindweeds or random walks in random environments on multiplexed trees and their asympotics

Mikhail Menshikov (1), Dimitri Petritis ORCID (2), Serguei Popov (3)
(1) Department of Mathematical Sciences
(2) Institut de Recherche Mathématique de Rennes
(3) Instituto de Matematica
Abstract
We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree.The term multiplexed means that the model can be viewed as a nearest neighbours random walk on a tree whose vertices carry an internal degree of freedom from the finite set $\{1,...,d\}$, for some integer $d$. The consequence of the internal degree of freedom is an enhancement of the tree graph structure induced by the replacement of ordinary edges by multi-edges, indexed by the set $\{1,...,d\} × \{1,...,d\}.$ This indexing conveys the information on the internal degree of freedom of the vertices contiguous to each edge. The term random environment means that the jumping rates for the random walk are a family of edge-indexed random variables, independent of the natural filtration generated by the random variables entering in the definition of the random walk; their joint distribution depends on the index of each component of the multi-edges. We study the large time asymptotic behaviour of this random walk and classify it with respect to positive recurrence or transience in terms of a specific parameter of the probability distribution of the jump rates.This classifying parameter is shown to coincide with the critical value of a matrix-valued multiplicative cascade on the ordinary tree (i.e.the one without internal degrees of freedom attached to the vertices) having the same vertex set as the state space of the random walk. Only results are presented here since the detailed proofs will appear elsewhere.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Markov chain
  • trees
  • random environment
  • recurrence criteria
  • matrix multiplicative cascades
Cited by

Source: OpenCitations

  • The fixed points of the multivariate smoothing transform

    Probability Theory and Related Fields

    Authors : Sebastian Mentemeier

    Journal reference : Volume 164, 2015, pp. 401-458

    DOI : 10.1007/s00440-015-0615-y
Preview
Loading PDF preview...