Related papers: Optimal control for diffusions on graphs
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…
The transport of an infinitely thin, hard rod in a random, dense array of point obstacles is investigated by molecular dynamics simulations. Our model mimics the sterically hindered dynamics in dense needle liquids. The center-of-mass…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
Understanding the complex patterns in space-time exhibited by active systems has been the subject of much interest in recent times. Complementing this forward problem is the inverse problem of controlling active matter. Here we use optimal…
We consider a classical stochastic control problem in which a diffusion process is controlled by a withdrawal process up to a termination time. The objective is to maximize the expected discounted value of the withdrawals until the…
We study a class of two-sided optimal control problems of general linear diffusions under a so-called Poisson constraint: the controlling is only allowed at the arrival times of an independent Poisson signal processes. We give a weak and…
We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…
For a stopped diffusion process in a multidimensional time-dependent domain $\D$, we propose and analyse a new procedure consisting in simulating the process with an Euler scheme with step size $\Delta$ and stopping it at discrete times…
In this paper, we consider a class of optimal control problems for a one-dimensional time-discrete constrained quasilinear diffusion state-systems of singular Allen--Cahn types and its regularized approximating problems. We note that the…
It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
An optimal control problem for longitudinal motions of a thin elastic rod is considered. We suppose that a normal force, which changes piecewise constantly along the rod's length, is applied to the cross-section so that the positions of…
For a directed graph $G$ with $n$ vertices and a start vertex $u_{\sf start}$, we wish to (approximately) sample an $L$-step random walk over $G$ starting from $u_{\sf start}$ with minimum space using an algorithm that only makes few passes…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enables the fastest spread of information? In this paper, we assume the dynamics of spread is…
Given a network represented by a graph $G=(V,E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\subseteq V$ are influenced; subsequently, at each round, the set…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We discuss the control of a human crowd whose dynamics is governed by a regularized version of Hughes' model, cf. Hughes: A continuum theory for the flow of pedestrians. Transportation research part B: methodological, 36 (2002). We assume…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…