English
Related papers

Related papers: Rough path properties for local time of symmetric …

200 papers

We investigate the asymptotic behavior as time goes to infinity of Hawkes processes whose regression kernel has $L^1$ norm close to one and power law tail of the form $x^{-(1+\alpha)}$, with $\alpha\in(0,1)$. We in particular prove that…

Probability · Mathematics 2015-04-14 Thibault Jaisson , Mathieu Rosenbaum

Many local integral methods are based on an integral formulation over small and heavilly overlapping stencils with local RBF interpolations. These functions have become an extremely effective tool for interpolation on scattered node sets,…

Numerical Analysis · Mathematics 2018-11-05 Luciano Ponzellini Marinelli , Nahuel Caruso , Margarita Portapila

In this paper, a class of statistics based on high frequency observations of oscillating and skew Brownian motion is considered. Their convergence rate towards the local time of the underlying process is obtained in form of a functional…

Probability · Mathematics 2024-04-04 Sara Mazzonetto

Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough…

Probability · Mathematics 2020-05-15 Yanghui Liu , Zachary Selk , Samy Tindel

Under an appropriate regular variation condition, the affinely normalized partial sums of a sequence of independent and identically distributed random variables converges weakly to a non-Gaussian stable random variable. A functional version…

Probability · Mathematics 2012-10-12 Bojan Basrak , Danijel Krizmanić , Johan Segers

Model checking large networks of processes is challenging due to state explosion. In many cases, individual processes are isomorphic, but there is insufficient global symmetry to simplify model checking. This work considers the verification…

Logic in Computer Science · Computer Science 2019-03-26 Kedar S. Namjoshi , Richard J. Trefler

In this paper we study coupled fully non-local equations, where a linear non-local operator jointly acts on the time and space variables. We establish existence and uniqueness of the solution. A maximum principle is proved and used to…

Probability · Mathematics 2025-01-24 Giacomo Ascione , Enrico Scalas , Bruno Toaldo , Lorenzo Torricelli

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

Computational Complexity · Computer Science 2016-09-01 Andras Farago

A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate…

Dynamical Systems · Mathematics 2016-12-14 David Angeli , Matthew Philippe , Nikolaos Athanasopoulos , Raphaël M. Jungers

In this paper, we develop and analyze an integral fixed-time sliding mode control method for a scenario in which the system model is only partially known, utilizing Gaussian processes. We present two theorems on fixed-time convergence. The…

Systems and Control · Electrical Eng. & Systems 2025-05-30 Chaimae El Mortajinea , Moussa Labbadib , Adnane Saoudc , Mostafa Bouzia

We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…

Probability · Mathematics 2019-08-09 Giuseppe Genovese , Renato Lucà

We investigate the RG-time integration of the effective potential in the functional renormalization group in the presence of spontaneous symmetry breaking and its subsequent convexity restoration on the example of a scalar theory in $d=3$.…

High Energy Physics - Theory · Physics 2023-06-21 Friederike Ihssen , Franz R. Sattler , Nicolas Wink

We present a rigorous framework for the local analysis of canards and slow passages through bifurcations in a wide class of infinite-dimensional dynamical systems with time-scale separation. The framework is applicable to models where an…

Dynamical Systems · Mathematics 2020-11-23 Daniele Avitabile , Mathieu Desroches , Romain Veltz , Martin Wechselberger

Recently, a new approach in the fine analysis of stochastic processes sample paths has been developed to predict the evolution of the local regularity under (pseudo-)differential operators. In this paper, we study the sample paths of…

Probability · Mathematics 2013-08-29 Paul Balança , Erick Herbin

Interacting many-body systems with explicitly accessible spatio-temporal correlation functions are extremely rare, especially in the absence of integrability. Recently, we identified a remarkable class of such systems and termed them…

Statistical Mechanics · Physics 2021-02-11 Pavel Kos , Bruno Bertini , Tomaž Prosen

We provide an account for the existence and uniqueness of solutions to rough differential equations under the framework of controlled rough paths. The case when the driving path is $\beta$-H\"older continuous, for $\beta>1/3$, is widely…

Classical Analysis and ODEs · Mathematics 2020-09-29 Horatio Boedihardjo , Xi Geng

In this note we investigate the behaviour of Brownian motion conditioned on a growth constraint of its local time which has been previously investigated by Berestycki and Benjamini. For a class of non-decreasing positive functions $f(t);…

Probability · Mathematics 2015-03-10 Martin Kolb , Mladen Savov

In this note we first consider local times of random walks killed at leaving positive half-axis. We prove that the distribution of the properly rescaled local time at point $N$ conditioned on being positive converges towards an exponential…

Probability · Mathematics 2014-12-22 Denis Denisov , Vitali Wachtel

Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…

Data Structures and Algorithms · Computer Science 2025-11-07 Themistoklis Haris , Fabian Spaeh , Spyros Dragazis , Charalampos Tsourakakis

Clustering with most objective functions is NP-Hard, even to approximate well in the worst case. Recently, there has been work on exploring different notions of stability which lend structure to the problem. The notion of stability,…

Data Structures and Algorithms · Computer Science 2017-02-14 Ainesh Bakshi , Nadiia Chepurko
‹ Prev 1 8 9 10 Next ›