Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe distance function in the presence of an obstacle
63
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a fractional modulus of order one half and that, near the obstacle, this regularity is optimal. Then, in the Euclidean setting, we show that the distance function is everywhere differentiable (except for the point-wise target) if and only if no obstacle is present. Finally, we prove that all the singular points of the distance function are not isolated, in the sense that each singularity belongs to a nontrivial continuum of singular points.
rate research
Read More
We consider a trader who aims to liquidate a large position in the presence of an arbitrageur who hopes to profit from the traders activity. The arbitrageur is uncertain about the traders position and learns from observed price fluctuations. This is a dynamic game with asymmetric information. We present an algorithm for computing perfect Bayesian equilibrium behavior and conduct numerical experiments. Our results demonstrate that the traders strategy differs significantly from one that would be optimal in the absence of the arbitrageur. In particular, the trader must balance the conflicting desires of minimizing price impact and minimizing information that is signaled through trading. Accounting for information signaling and the presence of strategic adversaries can greatly reduce execution costs.
We consider a nonlocal semi-linear parabolic equation on a connected exterior domain of the form $mathbb{R}^Nsetminus K$, where $Ksubsetmathbb{R}^N$ is a compact obstacle. The model we study is motivated by applications in biology and takes into account long range dispersal events that may be anisotropic depending on how a given population perceives the environment. To formulate this in a meaningful manner, we introduce a new theoretical framework which is of both mathematical and biological interest. The main goal of this paper is to construct an entire solution that behaves like a planar travelling wave as $tto-infty$ and to study how this solution propagates depending on the shape of the obstacle. We show that whether the solution recovers the shape of a planar front in the large time limit is equivalent to whether a certain Liouville type property is satisfied. We study the validity of this Liouville type property and we extend some previous results of Hamel, Valdinoci and the authors. Lastly, we show that the entire solution is a generalised transition front.
This paper addresses tracking of a moving target in a multi-agent network. The target follows a linear dynamics corrupted by an adversarial noise, i.e., the noise is not generated from a statistical distribution. The location of the target at each time induces a global time-varying loss function, and the global loss is a sum of local losses, each of which is associated to one agent. Agents noisy observations could be nonlinear. We formulate this problem as a distributed online optimization where agents communicate with each other to track the minimizer of the global loss. We then propose a decentralized version of the Mirror Descent algorithm and provide the non-asymptotic analysis of the problem. Using the notion of dynamic regret, we measure the performance of our algorithm versus its offline counterpart in the centralized setting. We prove that the bound on dynamic regret scales inversely in the network spectral gap, and it represents the adversarial noise causing deviation with respect to the linear dynamics. Our result subsumes a number of results in the distributed optimization literature. Finally, in a numerical experiment, we verify that our algorithm can be simply implemented for multi-agent tracking with nonlinear observations.
In this paper we study the local linearization of the Hellinger--Kantorovich distance via its Riemannian structure. We give explicit expressions for the logarithmic and exponential map and identify a suitable notion of a Riemannian inner product. Samples can thus be represented as vectors in the tangent space of a suitable reference measure where the norm locally approximates the original metric. Working with the local linearization and the corresponding embeddings allows for the advantages of the Euclidean setting, such as faster computations and a plethora of data analysis tools, whilst still still enjoying approximately the descriptive power of the Hellinger--Kantorovich metric.
This chapter presents recent solutions to the optimal power flow (OPF) problem in the presence of renewable energy sources (RES), {such} as solar photo-voltaic and wind generation. After introducing the original formulation of the problem, arising from the combination of economic dispatch and power flow, we provide a brief overview of the different solution methods proposed in the literature to solve it. Then, we explain the main difficulties arising from the increasing RES penetration, and the ensuing necessity of deriving robust solutions. Finally, we present the state-of-the-art techniques, with a special focus on recent methods we developed, based on the application on randomization-based methodologies.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
