We develop a generic game platform that can be used to model various real-world systems with multiple intelligent cloud-computing pools and parallel-queues for resources-competing users. Inside the platform, the software structure is modelled as Blockchain. All the users are associated with Big Data arrival streams whose random dynamics is modelled by triply stochastic renewal reward processes (TSRRPs). Each user may be served simultaneously by multiple pools while each pool with parallel- servers may also serve multi-users at the same time via smart policies in the Blockchain, e.g. a Nash equilibrium point myopically at each fixed time to a game-theoretic scheduling problem. To illustrate the effectiveness of our game platform, we model the performance measures of its internal data flow dynamics (queue length and workload processes) as reflecting diffusion with regime-switchings (RDRSs) under our scheduling policies. By RDRS models, we can prove our myopic game-theoretic policy to be an asymptotic Pareto minimal-dual-cost Nash equilibrium one globally over the whole time horizon to a randomly evolving dynamic game problem. Iterative schemes for simulating our multi-dimensional RDRS models are also developed with the support of numerical comparisons.

In this paper, we calculate the norm of the string Fourier transform on subfactor planar algebras and characterize the extremizers of the inequalities for parameters 0 < p,q ⩽ ∞. Furthermore, we establish Rényi entropic uncertainty principles for subfactor planar algebras.

The alternating direction method of multipliers (ADMM) is a popular and efficient first-order method that has recently found numerous applications, and the proximal ADMM is an important variant of it. The main contributions of this paper are the proposition and the analysis of a class of inertial proximal ADMMs, which unify the basic ideas of the inertial proximal point method and the proximal ADMM, for linearly constrained separable convex optimization. This class of methods are of inertial nature because at each iteration the proximal ADMM is applied to a point extrapolated at the current iterate in the direction of last movement. The recently proposed inertial primal-dual algorithm [A. Chambolle and T. Pock, On the ergodic convergence rates of a first-order primaldual algorithm, preprint, 2014, Algorithm 3] and the inertial linearized ADMM [C. Chen, S. Ma, and J. Yang, arXiv:1407.8238, eq. (3.23)] are covered as special cases. The proposed algorithmic framework is very general in the sense that the weighting matrices in the proximal terms are allowed to be only positive semidefinite, but not necessarily positive definite as required by existing methods of the same kind. By setting the two proximal terms to zero, we obtain an inertial variant of the classical ADMM, which is to the best of our knowledge new. We carry out a unified analysis for the entire class of methods under very mild assumptions. In particular, convergence, as well as asymptotic $o(1/\sqrt{k})$ and nonasymptotic $O(1/\sqrt{k})$ rates of convergence, are established for the best primal function value and feasibility residues, where k denotes the iteration counter. The global iterate convergence of the generated sequence is established under an additional assumption. We also present extensive experimental results on total variation–based image reconstruction problems to illustrate the profits gained by introducing the inertial extrapolation steps.

No abstract uploaded!

Let $D={\mathbb H} \setminus \cup_{k=1}^N C_k$ be a standard slit domain where $\mathbb H$ is the upper half plane and $C_k$, $1\leq k\leq N$, are mutually disjoint horizontal line segments in $\HH$. Given a Jordan arc $\gamma\subset D$ starting at $\partial {\mathbb H},$ let $g_t$ be the unique conformal map from $D\setminus \gamma[0,t]$ onto a standard slit domain $D_t$ satisfying the hydrodynamic normalization. We prove that $g_t$ satisfies an ODE with the kernel on its righthand side being the complex Poisson kernel of the Brownian motion with darning (BMD) for $D_t$, generalizing the chordal Loewner equation for the simply connected domain $D={\mathbb H}.$ Such a generalization has been obtained by Y. Komatu in the case of circularly slit annuli and by R. O. Bauer and R. M. Friedrich in the present chordal case, but only in the sense of the left derivative in $t$. We establish the differentiability of $g_t$ in $t$ to make the equation a genuine ODE. To this end, we first derive the continuity of $g_t(z)$ in $t$ with a certain uniformity in $z$ from a probabilistic expression of $\Im g_t(z)$ in terms of the BMD for $D$, which is then combined with a Lipschitz continuity of the complex Poisson kernel under the perturbation of standard slit domains to get the desired differentiability.