Related papers: Optimal control for diffusions on graphs
Let $D(n,r)$ be a random $r$-out regular directed multigraph on the set of vertices $\{1,\ldots,n\}$. In this work, we establish that for every $r \ge 2$, there exists $\eta_r>0$ such that $\text{diam}(D(n,r))=(1+\eta_r+o(1))\log_r{n}$. Our…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. Alon, Benjamini,…
This paper investigates the optimal control problem for a class of parabolic equations where the diffusion coefficient is influenced by a control function acting nonlocally. Specifically, we consider the optimization of a cost functional…
Given a discrete source distribution $\mu$ and discrete target distribution $\nu$ on a common finite state space $\mathcal{X}$, we are tasked with transporting $\mu$ to $\nu$ using a given discrete-time Markov chain $X$ with the quickest…
We consider a controlled-diffusion process pertaining to a chain of distributed systems with random perturbations that satisfies a weak H\"ormander type condition. In particular, we consider a stochastic control problem with the following…
The mobile robot dispersion problem on graphs asks $k\leq n$ robots placed initially arbitrarily on the nodes of an $n$-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a distinct node of…
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
This work investigates the optimal control of the variable-exponent subdiffusion, which extends the work [Gunzburger and Wang, {\it SIAM J. Control Optim.} 2019] to the variable-exponent case to account for the multiscale and crossover…
Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…
Considering a real-valued diffusion, a real-valued reward function and a positive discount rate, we provide an algorithm to solve the optimal stopping problem consisting in finding the optimal expected discounted reward and the optimal…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
This work is motivated by the need to study the impact of data uncertainties and material imperfections on the solution to optimal control problems constrained by partial differential equations. We consider a pathwise optimal control…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We study the spread of a novel state in a network, in the presence of an exogenous control. The considered controlled evolutionary dynamics is a non-homogeneous Markov process that describes the evolution of the states of all nodes in the…
A controlled branching process (CBP) is a modification of the standard Bienaym\'e-Galton-Watson process in which the number of progenitors in each generation is determined by a random mechanism. We consider a CBP starting from a random…