The Exact Hausdorff Dimension of a Branching Set
Quansheng Liu (1993)
Publications mathématiques et informatique de Rennes
Similarity:
Quansheng Liu (1993)
Publications mathématiques et informatique de Rennes
Similarity:
Lucie Fajfrová (2006)
Kybernetika
Similarity:
We focus on invariant measures of an interacting particle system in the case when the set of sites, on which the particles move, has a structure different from the usually considered set . We have chosen the tree structure with the dynamics that leads to one of the classical particle systems, called the zero range process. The zero range process with the constant speed function corresponds to an infinite system of queues and the arrangement of servers in the tree structure is natural...
Berlinkov, A.G. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Antti Käenmäki, Markku Vilppolainen (2008)
Fundamenta Mathematicae
Similarity:
It is well known that the open set condition and the positivity of the t-dimensional Hausdorff measure are equivalent on self-similar sets, where t is the zero of the topological pressure. We prove an analogous result for a class of Moran constructions and we study different kinds of Moran constructions in this respect.
Duquesne, Thomas, Le Gall, Jean-Francois (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Vassil Sgurev, Mariana Nikolova (1997)
The Yugoslav Journal of Operations Research
Similarity:
Guo, Hongwen, Hu, Dihe (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Le Gall, Jean-François (1998)
Documenta Mathematica
Similarity:
Daduna, Hans (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Lubkin, Sharon R., Funk, Sarah E., Sage, E.Helene (2005)
Journal of Theoretical Medicine
Similarity:
Duško Letić, Vesna Jevtić (2009)
The Yugoslav Journal of Operations Research
Similarity:
Eric Fekete (2010)
ESAIM: Probability and Statistics
Similarity:
We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description...