Related papers: Stick-Breaking Model for Variable-Range Hopping
We present a unified approach for constraint displacement problems in which a robot finds a feasible path by displacing constraints or obstacles. To this end, we propose a two stage process that returns locally optimal obstacle…
Optimal paths play a fundamental role in numerous physical applications ranging from random polymers to brittle fracture, from the flow through porous media to information propagation. Here for the first time we explore the path that is…
We consider pessimistic bilevel stochastic programs in which the follower maximizes over a fixed compact convex set a strictly convex quadratic function, whose Hessian depends on the leader's decision. The resulting random variable is…
This paper introduces an optimization problem (P) and a solution strategy to design variable-speed-limit controls for a highway that is subject to traffic congestion and uncertain vehicle arrival and departure. By employing a finite…
We consider a model of fragmentation of sheet by cracks that move with a velocity in preferred direction, but undergo random transverse displacements as they move. There is a non-zero probability of crack-splitting, and the split cracks…
Hierarchical (first-order) structured deformations are studied from the variational point of view. The main contributions of the present research are the first steps, at the theoretical level, to establish a variational framework to…
Insight into the blockage vulnerability of evolving spatial networks is important for understanding transport resilience, robustness, and failure of a broad class of real-world structures such as porous media and utility, urban traffic, and…
We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is `robust' in the sense that it is designed to prevent path jumping and in many cases, it can be used in (only) double precision…
Hierarchical crack patterns that arise during the drying of thin films of colloidal dispersions or polymer solutions on a solid substrate are of interest both from a fundamental standpoint and in the context of the creation of transparent…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
The shrinking rank method is a variation of slice sampling that is efficient at sampling from multivariate distributions with highly correlated parameters. It requires that the gradient of the log-density be computable. At each individual…
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…
We introduce three models of fragmentation in which the largest fragment in the system can be broken at each time step with a fixed probability, p. We solve these models exactly in the long time limit to reveal stable time invariant…
Achieving persistent tracking of multiple dynamic targets over a large spatial area poses significant challenges for a single-robot system with constrained sensing capabilities. As the robot moves to track different targets, the ones…
Break a stick at random at $n-1$ points to obtain $n$ pieces. We give an explicit formula for the probability that every choice of $k$ segments from this broken stick can form a $k$-gon, generalizing similar work. The method we use can be…
We compute profile likelihoods for a stochastic model of diffusive transport motivated by experimental observations of heat conduction in layered skin tissues. This process is modelled as a random walk in a layered one-dimensional material,…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. Each client has a unique subset of messages at the server as side-information and requests for…
We generalize the well-known broken stick problem in several ways, including a discrete "brick" analogue and a sequential "pick-up sticks/bricks" version. The limit behavior of the broken brick problem gives a combinatorial proof of the…
Mesoscopic models in the reaction-diffusion framework have gained recognition as a viable approach to describing chemical processes in cell biology. The resulting computational problem is a continuous-time Markov chain on a discrete and…