scispace - formally typeset
Search or ask a question
Topic

Stochastic process

About: Stochastic process is a research topic. Over the lifetime, 31227 publications have been published within this topic receiving 898736 citations. The topic is also known as: random process & stochastic processes.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a continuous-time mean-variance portfolio selection problem is formulated as a bicriteria optimization problem, where the objective is to maximize the expected terminal return and minimize the variance of the terminal wealth.
Abstract: This paper is concerned with a continuous-time mean-variance portfolio selection model that is formulated as a bicriteria optimization problem. The objective is to maximize the expected terminal return and minimize the variance of the terminal wealth. By putting weights on the two criteria one obtains a single objective stochastic control problem which is however not in the standard form due to the variance term involved. It is shown that this nonstandard problem can be ``embedded'' into a class of auxiliary stochastic linear-quadratic (LQ) problems. The stochastic LQ control model proves to be an appropriate and effective framework to study the mean-variance problem in light of the recent development on general stochastic LQ problems with indefinite control weighting matrices. This gives rise to the efficient frontier in a closed form for the original portfolio selection problem.

979 citations

Journal ArticleDOI
TL;DR: The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes.
Abstract: We investigate random walks on complex networks and derive an exact expression for the mean firstpassage time (MFPT) between two nodes. We introduce for each node the random walk centrality C, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which a node can receive and spread information over the network in a random process. Numerical simulations of an ensemble of random walkers moving on paradigmatic network models confirm this analytical prediction.

955 citations

Journal ArticleDOI
TL;DR: A detailed second-order analysis is carried out for wavelet coefficients of FBM, revealing a stationary structure at each scale and a power-law behavior of the coefficients' variance from which the fractal dimension of F BM can be estimated.
Abstract: Fractional Brownian motion (FBM) offers a convenient modeling for nonstationary stochastic processes with long-term dependencies and 1/f-type spectral behavior over wide ranges of frequencies. Statistical self-similarity is an essential feature of FBM and makes natural the use of wavelets for both its analysis and its synthesis. A detailed second-order analysis is carried out for wavelet coefficients of FBM. It reveals a stationary structure at each scale and a power-law behavior of the coefficients' variance from which the fractal dimension of FBM can be estimated. Conditions for using orthonormal wavelet decompositions as approximate whitening filters are discussed, consequences of discretization are considered, and some connections between the wavelet point of view and previous approaches based on length measurements (analysis) or dyadic interpolation (synthesis) are briefly pointed out. >

934 citations

Journal ArticleDOI
TL;DR: In this article, the existence of a KAM surface is assumed to be associated with a sudden change from stability to instability of nearby periodic orbits, which is consistent with all that is known, strongly supported by numerical results.
Abstract: A number of problems in physics can be reduced to the study of a measure‐preserving mapping of a plane onto itself. One example is a Hamiltonian system with two degrees of freedom, i.e., two coupled nonlinear oscillators. These are among the simplest deterministic systems that can have chaotic solutions. According to a theorem of Kolmogorov, Arnol’d, and Moser, these systems may also have more ordered orbits lying on curves that divide the plane. The existence of each of these orbit types depends sensitively on both the parameters of the problem and on the initial conditions. The problem addressed in this paper is that of finding when given KAM orbits exist. The guiding hypothesis is that the disappearance of a KAM surface is associated with a sudden change from stability to instability of nearby periodic orbits. The relation between KAM surfaces and periodic orbits has been explored extensively here by the numerical computation of a particular mapping. An important part of this procedure is the introduction of two quantities, the residue and the mean residue, that permit the stability of many orbits to be estimated from the extrapolation of results obtained for a few orbits. The results are distilled into a series of assertions. These are consistent with all that is previously known, strongly supported by numerical results, and lead to a method for deciding the existence of any given KAM surface computationally.

921 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
89% related
Robustness (computer science)
94.7K papers, 1.6M citations
86% related
Estimator
97.3K papers, 2.6M citations
86% related
Matrix (mathematics)
105.5K papers, 1.9M citations
85% related
Differential equation
88K papers, 2M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023159
2022355
2021985
20201,151
20191,119
20181,115