Search Results

a dense generator, so we can see $\infty$-categories as presheaves on $\Delta$ Simplicially enriched categories: Simplicial enrichment is a proxy for enrichment in $\mathrm{Cat}_{(\infty, 0)}$ Simplicial … mathrm{Cat}_{(1,1)}$ Complete segal spaces: These look to be inspired by models in $\mathrm{Cat}_{(\infty, 0)}$ of the finite limit sketch defining categories Relative categories: A pair $(C,W)$ is a proxy …

If there is no development along these lines, then I would also be happy if anyone knows a good proxy that appears in the literature. …

Suppose that $\boldsymbol{x}\in\mathbb{R}^n$ is subgaussian random vector of variance proxy $\sigma^2$, i.e., $$\forall \boldsymbol{\alpha}\in\mathbb{R}^n: \quad \quad \mathbb{E}\left[ \exp\right(\boldsymbol …

This gives $Y_N$ with subgaussian proxy $\Sigma_N = \sum_i \sigma_i^2$. Then we can guess positive charge if $Y_N > 1/2$ and negative if $Y_N \le 1/2$. … The subgaussian proxy says the guess is correct with probability $O(e^{-K \Sigma_n})$ for some fixed $K >0$. So far so good. But what if we are instead interested in tail bounds for the guesses. …

After some reflection it occurred to me that the number of distinct Hamiltonian cycles on a convex polytope may be a useful proxy measure. …

We could assign proxy weights to each state based on what overall payoff the states seem to offer and choose strategies which maximize this but how would one prove such a "greedy" approach is optimal. …

This reminds me a little bit of tropical geometry wherein one replaces an algebraic variety with a simple combinatorial proxy, but from what little I know the analogy seems to stop there. …

. $$$$ $$$$ Old description: Topic: Multinomial proxy variables: Bound on probability of their sums Suppose $(X_1,X_2,..X_i,..,X_b)$ as multinomial vector of random variables with $N=\sum_{i=1}^b … Therefore let us define a non-negative penalty function (a truncated proxy random variable) for each tube as follows: $$ y(X_i) = \begin{cases} X_i-1 &,~for~ X_i \geq 2\\ 0 &,~else\\ \end{cases} $$ …

However, I have an issue with their (and by proxy, Müger's) approach. Namely, they require that the category has finite biproducts (direct sums). …

As such, we can define an operation which maps a graph onto another, by proxy. …

This is a question-by-proxy for a colleague from computer science. …

a conclusion about what is true in the original universe, nevertheless one may omit it by taking a countable elementary substructure of a suitable $H_\theta$, in effect replacing $M$ with a countable proxy … Applying the theorem to the proxy, you get that the proxy satisfies $\text{PA}$, and so $M\models\text{PA}$ as well. …

This norm is the "closest" convex proxy to the rank function (in the same sense as $\|x\|_1$ is the convex proxy to $\|x\|_0$, the cardinality function. …

One way out of this is to search among all polynomials of the form $q = \sigma_0 + \sum_i \sigma_i f_i$, and try to find a $q$ whose symmetric positive semidefinite Gram matrix is of rank one, a convex proxy …

Is there a function from such multigraphs to ordered lists of size $n$ (N.B. that the order isn't meant to represent the relative strength of the teams, but is just a proxy for the extra structure of the …