Related papers: Moments of Two-Variable Functions and the Uniquene…

Our aim is to study the Total Variation Flow in Metric Graphs. First, we define the functions of bounded variation in Metric Graphs and their total variation, we also give an integration by parts formula. We prove existence and uniqueness…

If two probability density functions (PDFs) have values for their first $n$ moments which are quite close to each other (upper bounds of their differences are known), can it be expected that the PDFs themselves are very similar? Shown below…

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

We establish sharp bounds for the second moment of symmetric-square $L$-functions attached to Hecke Maass cusp forms $u_j$ with spectral parameter $t_j$, where the second moment is a sum over $t_j$ in a short interval. At the central point…

This paper concerns estimating a probability density function $f$ based on iid observations from $g(x)=W^{-1} w(x) f(x)$, where the weight function $w$ and the total weight $W=\int w(x) f(x) dx$ may not be known. The length-biased and…

A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…

We study positive random variables whose moments can be expressed by products and quotients of Gamma functions; this includes many standard distributions. General results are given on existence, series expansion and asymptotics of density…

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

In this work we investigate and characterize linear functionals $L:\mathbb{R}[x_1,\dots,x_n]\to\mathbb{R}$ with absolutely continuous representing measures $\mu$, i.e., $\mathrm{d}\mu(x) = g(x)\,\mathrm{d} x$ for some density $g$. We focus…

In this paper we study the uniqueness of graphical mean curvature flow. We consider as initial conditions graphs of locally Lipschitz functions and prove that in the one dimensional case solutions are unique without any further assumptions.…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…

We study the asymptotic behaviour of additive functionals of random walks in random scenery. We establish bounds for the moments of the local time of the Kesten and Spitzer process.These bounds combined with a previous moment convergence…

We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

In this paper, we discuss the existence of fixed points for integral type contractions in uniform spaces endowed with both a graph and an $E$-distance. We also give two sufficient conditions under which the fixed point is unique. Our main…

A graph automorphism is a bijective mapping of the vertices that preserves adjacent vertices. A vertex determining set of a graph is a set of vertices such that the only automorphism that fixes those vertices is the identity. The size of a…

We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

Scattering moments provide nonparametric models of random processes with stationary increments. They are expected values of random variables computed with a nonexpansive operator, obtained by iteratively applying wavelet transforms and…

Let $D$ and $G$ be copies of the open unit disc in $\C,$ let $A$ (resp. $B$) be a measurable subset of $\partial D$ (resp. $\partial G$), let $W$ be the 2-fold cross $\big((D\cup A)\times B\big)\cup \big(A\times(B\cup G)\big),$ and let $M$…