English
Related papers

Related papers: Scaling Limits for Super--replication with Transie…

200 papers

In this article, we study the rate of convergence of prices when a model is approximated by some simplified model. We also provide a method how explicit error formula for more general options can be obtained if such formula is available for…

Probability · Mathematics 2013-01-08 Lauri Viitasaari

In this paper we prove a scaling limit phase transition for a class of two-dimensional random polymers.

Mathematical Physics · Physics 2019-06-18 Luis R. Lucinger , Roberto Vila

We investigate which jump-diffusion models are convexity preserving. The study of convexity preserving models is motivated by monotonicity results for such models in the volatility and in the jump parameters. We give a necessary condition…

Analysis of PDEs · Mathematics 2008-12-02 Erik Ekström , Johan Tysk

We consider the superhedging price of an exotic option under nondominated model uncertainty in discrete time in which the option buyer chooses some action from an (uncountable) action space at each time step. By introducing an enlarged…

Mathematical Finance · Quantitative Finance 2023-11-03 Anna Aksamit , Ivan Guo , Shidan Liu , Zhou Zhou

Nearly all statistical inference methods were developed for the regime where the number $N$ of data samples is much larger than the data dimension $p$. Inference protocols such as maximum likelihood (ML) or maximum a posteriori probability…

Disordered Systems and Neural Networks · Physics 2020-07-09 ACC Coolen , M Sheikh , A Mozeika , F Aguirre-Lopez , F Antenucci

We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration…

Probability · Mathematics 2026-03-05 Matteo D'Achille , Francesco Mattesini , Dario Trevisan

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

Probability · Mathematics 2026-03-10 Partha S. Dey , S. Rasoul Etesami , Aditya S. Gopalan

Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…

Computational Complexity · Computer Science 2019-11-11 Jonah Brown-Cohen , Prasad Raghavendra

We study the pricing problem for a European call option when the volatility of the underlying asset is random and follows the exponential Ornstein-Uhlenbeck model. The random diffusion model proposed is a two-dimensional market process that…

Pricing of Securities · Quantitative Finance 2008-12-02 Josep Perello , Ronnie Sircar , Jaume Masoliver

We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic…

Disordered Systems and Neural Networks · Physics 2014-08-25 Sergio Caracciolo , Carlo Lucibello , Giorgio Parisi , Gabriele Sicuro

We prove the uniform in space and time convergence of the scaled heights of large classes of deterministic growth models that are monotone and equivariant under translations by constants. The limits are characterized as the unique…

Probability · Mathematics 2022-06-29 Sourav Chatterjee , Panagiotis E. Souganidis

In the present paper, we study the optimal execution problem under stochastic price recovery based on limit order book dynamics. We model price recovery after execution of a large order by accelerating the arrival of the refilling order,…

Trading and Market Microstructure · Quantitative Finance 2015-02-17 Masashi Ieda

We consider two-stage recourse models in which the second-stage problem has integer decision variables and uncertainty in the second-stage cost vector, technology matrix, and the right-hand side vector. Such mixed-integer recourse models…

Optimization and Control · Mathematics 2022-06-06 E. Ruben van Beesten , Ward Romeijnders

Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…

Statistical Mechanics · Physics 2025-08-29 Xuewei Zhao , Liwenying Yang , Dan Peng , Run-Ran Liu , Ming Li

We introduce a setup of model uncertainty in discrete time. In this setup we derive dual expressions for the super--replication prices of game options with upper semicontinuous payoffs. We show that the super--replication price is equal to…

Pricing of Securities · Quantitative Finance 2013-04-15 Yan Dolinsky

We study optimal liquidation in the presence of linear temporary and transient price impact along with taking into account a general price predicting finite-variation signal. We formulate this problem as minimization of a cost-risk…

Trading and Market Microstructure · Quantitative Finance 2022-01-17 Eyal Neuman , Moritz Voß

This work is devoted to the study of the scaling, and the consequent power-law behavior, of the correlation function in a mutation-replication model known as the expansion-modification system. The latter is a biology inspired random…

Probability · Mathematics 2015-06-04 Raúl Salgado-García , Edgardo Ugalde

The block counting process with initial state $n$ counts the number of blocks of an exchangeable coalescent ($\Xi$-coalescent) restricted to a sample of size $n$. This work provides scaling limits for the block counting process of regular…

Probability · Mathematics 2022-04-18 Martin Möhle , Benedict Vetter

In this paper we obtain scaling limits of $\Lambda$-coalescents near time zero under a regularly varying assumption. In particular this covers the case of Kingman's coalescent and beta coalescents. The limiting processes are coalescents…

Probability · Mathematics 2015-11-09 Bati Sengul

We consider a variant of online convex optimization in which both the instances (input vectors) and the comparator (weight vector) are unconstrained. We exploit a natural scale invariance symmetry in our unconstrained setting: the…

Machine Learning · Computer Science 2017-08-24 Wojciech Kotłowski
‹ Prev 1 8 9 10 Next ›