Results 51 to 60 of about 140 (137)
Ultra Approach Groups: Characterizations, Examples, and Invariant Pseudo-Metrizability
The motivation of this paper is to discuss some aspects of approach groups, recall and reformulate a characterization theorem in a self-contained form, and provide various natural examples in a new setting; in so doing, we show that every bi-invariant ...
Jawaher Al-Mufarrij
doaj +1 more source
Graphical small cancellation and hyperfiniteness of boundary actions
Abstract We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned‐off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented) classical small cancellation groups, admit hyperfinite boundary actions, more precisely, the orbit equivalence ...
Chris Karpinski +2 more
wiley +1 more source
The Functional Delta Method for Deriving Asymptotic Distributions
The distribution of the scaled difference between the plug‐in estimator Tθ̂n$$ T\left({\hat{\boldsymbol{\theta}}}_n\right) $$ and the true parameter Tθ0$$ T\left({\boldsymbol{\theta}}_0\right) $$ is approximated by the distribution of the scaled difference between θ̂n$$ {\hat{\boldsymbol{\theta}}}_n $$ and θ0$$ {\boldsymbol{\theta}}_0 $$ and a ...
Eric Beutner
wiley +1 more source
A characterisation of snowflakes via rectifiability
Abstract We prove a generalisation to every metric space of Tyson–Wu's characterisation of metric spaces biLipschitz equivalent to snowflakes, by removing compactness, doubling and embeddability assumptions. We also characterise metric spaces that are biLipschitz equivalent to a snowflake in terms of the absence of non‐trivial metric 1‐currents in ...
Emanuele Caputo, Nicola Cavallucci
wiley +1 more source
Formal analysis of control and termination of distributed computation in weaker spaces
The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis
Susmit Bagchi
doaj +1 more source
Limit Orders and Knightian Uncertainty
ABSTRACT A wide variety of financial instruments allows risk‐averse traders to reduce their exposure to risk. This raises the question of what financial instruments allow ambiguity‐averse traders to reduce their exposure to ambiguity. We show in this paper that price‐contingent orders, such as limit orders, are sufficient: In a two‐period trading model,
Michael Greinecker, Christoph Kuzmics
wiley +1 more source
Rigidity of anti‐de Sitter (2+1)‐spacetimes with convex boundary near the Fuchsian locus
Abstract We prove that globally hyperbolic compact anti‐de Sitter (2+1)‐spacetimes with a strictly convex spacelike boundary that is either smooth or polyhedral and whose holonomy is close to Fuchsian are determined by the induced metric on the boundary.
Roman Prosanov, Jean‐Marc Schlenker
wiley +1 more source
Efficiency in Pure‐Exchange Economies With Risk‐Averse Monetary Utilities
ABSTRACT We study Pareto efficiency in a pure‐exchange economy where agents' preferences are represented by risk‐averse monetary utilities. These coincide with law‐invariant monetary utilities, and they can be shown to correspond to the class of monotone, (quasi‐)concave, Schur concave, and translation‐invariant utility functionals. This covers a large
Mario Ghossoub, Michael B. Zhu
wiley +1 more source
Metrization of idempotent semiring of topological rings
In this paper, we have introduced natural H+ - pseudovaluation and H+ -norm on a completely regular semiring making it a topological completely regular (algebraic) semiring and established some necessary and sufficient conditions of metrizability of a ...
Sunil Kumar Maity, Gopal Adak
doaj +1 more source
Another View of Metrizability [PDF]
A fact long considered unsatisfactory about the classical metrization theorem of Alexandroff-Urysohn is that it expresses metrizability as a countable uniformity, uniformity itself being almost the former. In view of their unification, the classical theorems, with the exception of Arhangel’skiĭ’s regular open base theorem, are all really subject to the
openaire +2 more sources

