arXiv 2202.093542022-02math.PR

Smoothness of Directed Chain Stochastic Differential Equations

Tomoyuki Ichiba, Ming Min

备注：: 25 pages

英文摘要：

We study the smoothness of the solution of the directed chain stochastic differential equations, where each process is affected by its neighborhood process in an infinite directed chain graph, introduced by Detering et al. (2020). Because of the auxiliary process in the chain-like structure, classic methods of Malliavin derivatives are not directly applicable. Namely, we cannot make a connection between the Malliavin derivative and the first order derivative of the state process. It turns out that the partial Malliavin derivatives can be used here to fix this problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Markov chains on graded posets: Compatibility of up-directed and down-directed transition probabilities

We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an \emph{up chain} or \emph{down chain}). The second type toggles between two adjacent rank levels (an \emph{up-and-down chain}). We introduce two compatibility concepts between the up-directed transition probabilities (an \emph{up rule}) and the down-directed (a \emph{down rule}), and we relate these to compatibility between up-and-down cha…

2015-12-11math.PR

Linear-Quadratic Stochastic Differential Games on Directed Chain Networks

We study linear-quadratic stochastic differential games on directed chains inspired by the directed chain stochastic differential equations introduced by Detering, Fouque, and Ichiba. We solve explicitly for Nash equilibria with a finite number of players and we study more general finite-player games with a mixture of both directed chain interaction and mean field interaction. We investigate and compare the corresponding games in the limit when the number of players tends to infinity. The limit is characterized by Catalan functions and the dynamics under equilibrium is an infinite-dimensional …

2020-05-29math.PR

Linear-Quadratic Stochastic Differential Games on Random Directed Networks

The study of linear-quadratic stochastic differential games on directed networks was initiated in Feng, Fouque \& Ichiba \cite{fengFouqueIchiba2020linearquadratic}. In that work, the game on a directed chain with finite or infinite players was defined as well as the game on a deterministic directed tree, and their Nash equilibria were computed. The current work continues the analysis by first developing a random directed chain structure by assuming the interaction between every two neighbors is random. We solve explicitly for an open-loop Nash equilibrium for the system and we find that the dy…

2020-11-05math.PR

Directed Chain Stochastic Differential Equations

We propose a particle system of diffusion processes coupled through a chain-like network structure described by an infinite-dimensional, nonlinear stochastic differential equation of McKean-Vlasov type. It has both (i) a local chain interaction and (ii) a mean-field interaction. It can be approximated by a limit of finite particle systems, as the number of particles goes to infinity. Due to the local chain interaction, propagation of chaos does not necessarily hold. Furthermore, we exhibit a dichotomy of presence or absence of mean-field interaction, and we discuss the problem of detecting its…

2019-07-17math.PR

Improved mixing rates of directed cycles by added connection

We investigate the mixing rate of a Markov chain where a combination of long distance edges and non-reversibility is introduced: as a first step, we focus here on the following graphs: starting from the cycle graph, we select random nodes and add all edges connecting them. We prove a square factor improvement of the mixing rate compared to the reversible version of the Markov chain.

2018-02-10math.PR

A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs

The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly mixing for regular directed graphs of degree d, where d is any positive integer-valued function of the number of vertices. We bound the mixing time by bounding the eigenvalues of the chain. A new result is presented and applied to bound the smallest (most negative) eigenvalue. This result is a modification of a lemma by Diaconis and Stroock, and by using it w…

2011-10-14math.COmath.PR

更多相关论文收起更多论文

Strong disorder for a certain class of directed polymers in a random environment

We study a model of directed polymers with an exponentially recurrent Markov chain and an indefinitely divisible random environment. We prove that the normalized partition function converges exponentially fast towards zero at all temperatures.

2004-03-25math.PR

带额外稀疏互连的有向环的改进混合速率

Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections

HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Eötvös Loránd University, Department of Probability and Statistics（罗兰大学概率与统计系）；ICTEAM institute, UCLouvain（UCLouvain ICTEAM研究所）

该研究分析带稀疏随机互连的有向环上马尔可夫链的谱隙，结合环的强不对称性，证明谱隙高概率下与最长弧长成反比（含对数因子），大幅提升混合速率。

2026-10-20math.PR

Random walk in a finite directed graph subject to a synchronizing road coloring

A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.

2011-05-05math.PR

有向链生成对抗网络

Directed Chain Generative Adversarial Networks

University of California, Santa Barbara（加州大学圣巴巴拉分校）

针对现有GAN难以生成多峰时间序列的问题，提出将时间序列数据集插入带分布约束的有向链SDE系数中的DC-GAN，在四类数据集上于多指标上均优于SOTA基准，为首款可生成多峰时间序列的相关方法。

2023-05-05cs.LGmath.PR

Laplace and bi-Laplace equations for directed networks and Markov chains

The networks of this -- primarily (but not exclusively) expository -- compendium are strongly connected, finite directed graphs $X$, where each oriented edge $(x,y)$ is equipped with a positive weight (conductance) $a(x,y)$. We are not assuming symmetry of this function, and in general we do not require that along with $(x,y)$, also $(y,x)$ is an edge. The weights give rise to a difference operator, the normalised version of which we consider as our Laplace operator. It is associated with a Markov chain with state space $X$. A non-empty subset of $X$ is designated as the boundary. We provide a…

2021-04-03math.APmath.PR

树上的马尔可夫链：几乎上定向与几乎下定向情形

Markov chains on trees: almost lower and upper directed cases

本文研究树上几乎上定向与几乎下定向马尔可夫链，证明其不变测度存在并给出行列式公式、常返性判据及高效叶子添加算法，并推广到加权路径的多重连续分数表示。

2024-11-11math.COmath.PR

基于命中概率的有向图与马尔可夫链度量

A metric on directed graphs and Markov chains based on hitting probabilities

Univ. North Carolina at Chapel Hill（北卡罗来纳大学教堂山分校）

本文提出了一种基于命中概率的度量，适用于遍历有限状态时齐马尔可夫链和有向图，能在$O(n^3)$时间内计算，对最短和平均游走距离不敏感，并展示了其在社区结构弱恢复、可视化和多尺度聚类等任务中的实用性。

2021-01-18cs.LGcs.NAcs.SI

A note on the enumeration of directed animals via gas considerations

In the literature, most of the results about the enumeration of directed animals on lattices via gas considerations are obtained by a formal passage to the limit of enumeration of directed animals on cyclical versions of the lattice. Here we provide a new point of view on this phenomenon. Using the gas construction given in [Electron. J. Combin. (2007) 14 R71], we describe the gas process on the cyclical versions of the lattices as a cyclical Markov chain (roughly speaking, Markov chains conditioned to come back to their starting point). Then we introduce a notion of convergence of graphs, suc…

2009-10-21math.COmath.PR