Related papers: Approximation of symmetric total variation on poin…
We study a 2-parametric family of probability measures on an infinite-dimensional simplex (the Thoma simplex). These measures originate in harmonic analysis on the infinite symmetric group (S.Kerov, G.Olshanski and A.Vershik, Comptes Rendus…
Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted…
The most common way to sample from a probability distribution is to use Monte-Carlo methods. For distributions on a continuous state space, one can find diffusions with the target distribution as equilibrium measure, so that the state of…
We give necessary and sufficient conditions to characterize the convergence in distribution of a sequence of arbitrary random variables to a probability distribution which is the invariant measure of a diffusion process. This class of…
We study a variational problem on a smooth manifold with a decomposition of the tangent bundle into $k>2$ subbundles (distributions), namely, we consider the integrated sum of their mixed scalar curvatures as a functional of adapted…
The sliding window model generalizes the standard streaming model and often performs better in applications where recent data is more important or more accurate than data that arrived prior to a certain time. We study the problem of…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…
We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…
In this paper, we propose an efficient method to estimate the Weingarten map for point cloud data sampled from manifold embedded in Euclidean space. A statistical model is established to analyze the asymptotic property of the estimator. In…
Application of "complete scaling" [Kim et al., Phys. Rev. E 67, 061506 (2003); Anisimov and Wang, Phys. Rev. Lett. 97, 25703 (2006)] to the interfacial behavior of fluids shows that Tolman's length, a curvature correction to the surface…
This work discusses the homogenization analysis for diffusion processes on scale-free metric graphs, using weak variational formulations. The oscillations of the diffusion coefficient along the edges of a metric graph induce internal…
We study the asymptotic behaviour of sequences of integral functionals depending on moving anisotropies. We introduce and describe the relevant functional setting, establishing uniform Meyers-Serrin type approximations, Poincar\'e…
An analogue of the total variation prior for the normal vector field along the boundary of smooth shapes in 3D is introduced. The analysis of the total variation of the normal vector field is based on a differential geometric setting in…
This work deals with almost automorphy of distributions. We give characterizations and main properties of these distributions. We also study the existence of distributional almost automorphic solutions of linear difference-differential…
We have developed a symmetry-adapted modeling procedure for molecules and crystals. By using the completeness of multipoles to express spatial and time-reversal parity-specific anisotropic distributions, we can generate systematically the…
There is a growing number of tasks that work directly on point clouds. As the size of the point cloud grows, so do the computational demands of these tasks. A possible solution is to sample the point cloud first. Classic sampling…
Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphical model. TRW provably provides an upper bound, but the…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…