Large scale properties for bounded automata groups
نویسندگان
چکیده
منابع مشابه
Large-scale Rigidity Properties of the Mapping Class Groups
We study the coarse geometry of the mapping class group of a compact orientable surface. We show that, apart from a few low-complexity cases, any quasi-isometric embedding of a mapping class group itself agrees up to bounded distance with a left multiplication. In particular, such a map is a quasi-isometry. This is a strengthening of the result of Hamenstädt and of Behstock, Kleiner, Minsky and...
متن کاملLarge-scale synchrony in weakly interacting automata.
We study the behavior of two spatially distributed (sandpile) models which are weakly linked with one another. Using a Monte Carlo implementation of the renormalization-group and algebraic methods, we describe how large-scale correlations emerge between the two systems, leading to synchronized behavior.
متن کاملImproved Bounded Matrix Completion for Large-Scale Recommender Systems
Matrix completion is a widely used technique for personalized recommender systems. In this paper, we focus on the idea of Bounded Matrix Completion (BMC) which imposes bounded constraints into the standard matrix completion problem. It has been shown that BMC works well for several real world datasets, and an efficient coordinate descent solver called BMA has been proposed in [R. Kannan and Par...
متن کاملFloristic Classification of Large-Scale Ecological Groups in the Forests of Central Zagros
Do climatic variations and drought magnitude affect large-scale vegetation composition in the Central Zagrosian forests, and to what extent do topographic variables of altitude and aspect play a role in these potential differences? To answer this question, in this research, the flora list of 15 Central Zagros forests was obtained in five plant life forms between the valleys of two rivers, Gerdb...
متن کاملBounded Parikh Automata
Motivation. Adding features to finite automata in order to capture situations beyond regularity has been fruitful to many areas of research. Such features include making the state sets infinite, adding power to the logical characterizations, having the automata operate on infinite domains rather than finite alphabets, adding stack-like mechanisms, etc. (See, e.g., [11, 3, 17, 1].) Model checkin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2015
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2015.04.018