Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe perfection of local semi-flows and local random dynamical systems with applications to SDEs
89
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We provide a rather general perfection result for crude local semi-flows taking values in a Polish space showing that a crude semi-flow has a modification which is a (perfect) local semi-flow which is invariant under a suitable metric dynamical system. Such a (local) semi-flow induces a (local) random dynamical system. Then we show that this result can be applied to several classes of stochastic differential equations driven by semimartingales with stationary increments such as equations with locally monotone coefficients and equations with singular drift. For these examples it was previously unknown whether they generate a (local) random dynamical system or not.
rate research
Read More
Using the balayage formula, we prove an inequality between the measures associated to local times of semimartingales. Our result extends the comparison theorem of local times of Ouknine $(1988)$, which is useful in the study of stochastic differential equations. The inequality presented in this paper covers the discontinuous case. Moreover, we study the pathwise uniqueness of some stochastic differential equations involving local time of unknown process.
We first give a characterization of the L^1-transportation cost-information inequality on a metric space and next find some appropriate sufficient condition to transportation cost-information inequalities for dependent sequences. Applications to random dynamical systems and diffusions are studied.
We prove the existence and uniqueness for SDEs with random and irregular coefficients through solving a backward stochastic Kolmogorov equation and using a modified Zvonkins type transformation.
Let $xi(n, x)$ be the local time at $x$ for a recurrent one-dimensional random walk in random environment after $n$ steps, and consider the maximum $xi^*(n) = max_x xi(n,x)$. It is known that $limsup xi^*(n)/n$ is a positive constant a.s. We prove that $liminf_n (logloglog n)xi^*(n)/n$ is a positive constant a.s.; this answers a question of P. Revesz (1990). The proof is based on an analysis of the {em valleys /} in the environment, defined as the potential wells of record depth. In particular, we show that almost surely, at any time $n$ large enough, the random walker has spent almost all of its lifetime in the two deepest valleys of the environment it has encountered. We also prove a uniform exponential tail bound for the ratio of the expected total occupation time of a valley and the expected local time at its bottom.
Consider a set of $n$ vertices, where each vertex has a location in $mathbb{R}^d$ that is sampled uniformly from the unit cube in $mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for each vertex pair with a probability that is a function of the distance between the locations, and the vertex weights. Under appropriate integrability assumptions on the edge probabilities that imply sparseness of the model, after appropriately blowing up the locations, we prove that the local limit of this random graph sequence is the (countably) infinite random graph on $mathbb{R}^d$ with vertex locations given by a homogeneous Poisson point process, having weights which are i.i.d. copies of limiting vertex weights. Our setup covers many sparse geometric random graph models from the literature, including Geometric Inhomogeneous Random Graphs (GIRGs), Hyperbolic Random Graphs, Continuum Scale-Free Percolation and Weight-dependent Random Connection Models. We prove that the limiting degree distribution is mixed Poisson, and the typical degree sequence is uniformly integrable, and obtain convergence results on various measures of clustering in our graphs as a consequence of local convergence. Finally, as a by-product of our argument, we prove a doubly logarithmic lower bound on typical distances in this general setting.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
