相关论文: Bivariate Uniqueness and Endogeny for the Logistic…
The \emph{Separation Lemma} is a simple yet powerful tool, akin to the well-known \emph{Isolation Lemma}, that guarantees the uniqueness of certain set sums. Bandopadhyay et al.\ introduced this lemma to establish lower bounds for the \ALP…
Motivated by applications in quantitative photoacoustic imaging, we study inverse problems to a semilinear radiative transport equation (RTE) where we intend to reconstruct absorption coefficients in the equation from single and multiple…
The Aldous-Hoover Theorem concerns an infinite matrix of random variables whose distribution is invariant under finite permutations of rows and columns. It states that, up to equality in distribution, each random variable in the matrix can…
In 2005 Janson, extending earlier work of Mahmoud, Smythe, and Szyma\'nski, established the joint asymptotic normality of the outdegrees of a random plane recursive tree. In particular, he gave an explicit description of the limiting…
This paper develops a performant Bayesian approach to conditional average treatment effect (CATE) estimation in regression discontinuity designs (RDD), an increasingly prevalent form of quasi-experiment that facilitates causal inference.…
We study routing games in which travelers optimize over routes that are remembered or surfaced, rather than over a fixed exogenous action set. The paper develops a tractable design theory for endogenous recall and then connects it back to…
A result of A.M. Davie [Int. Math. Res. Not. 2007] states that a multidimensional stochastic equation $dX_t = b(t, X_t)\,dt + dW_t$, $X_0=x$, driven by a Wiener process $W= (W_t)$ with a coefficient $b$ which is only bounded and measurable…
We consider a generalization of the recursive utility model by adding a new component that represents utility of investment gains and losses. We also study the utility process in this generalized model with constant elasticity of…
We study the optimal investment stopping problem in both continuous and discrete case, where the investor needs to choose the optimal trading strategy and optimal stopping time concurrently to maximize the expected utility of terminal…
We study the asymptotic growth rate of the label size of high-degree vertices in weighted recursive graphs (WRG) when the weights are i.i.d. almost surely bounded random variables, and as a result confirm a conjecture by Lodewijks and…
This paper investigates a reaction-advection-diffusion system modeling interspecific competition between two species over bounded domains. The kinetic terms are assumed to satisfy the Beddington-DeAngelis functional responses. We consider…
Explanations of the internal validity of regression discontinuity designs (RDD) generally appeal to the idea that RDDs are ``as good as" random near the treatment cut point. Cattaneo, Frandsen, and Titiunik (2015) are the first to take this…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
In [Ald00], Aldous investigates a symmetric Markov chain on cladograms and gives bounds on its mixing and relaxation times. The latter bound was sharpened in [Sch02]. In the present paper we encode cladograms as binary, algebraic measure…
We study the structure of the load-based spanning tree (LST) that carries the maximum weight of the Erdos-Renyi (ER) random network. The weight of an edge is given by the edge-betweenness centrality, the effective number of shortest paths…
Exogenous MDPs (Exo-MDPs) capture sequential decision-making where uncertainty comes solely from exogenous inputs that evolve independently of the learner's actions. This structure is especially common in operations research applications…
This paper introduces a node formulation for multistage stochastic programs with endogenous (i.e., decision-dependent) uncertainty. Problems with such structure arise when the choices of the decision maker determine a change in the…
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…
Recursion is the fundamental paradigm to finitely describe potentially infinite objects. As state-of-the-art reinforcement learning (RL) algorithms cannot directly reason about recursion, they must rely on the practitioner's ingenuity in…
The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been…