Related papers: Irreversible Step-Growth Polymerization with weigh…
In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a…
Calculating averages with respect to probability measures on submanifolds is often necessary in various application areas such as molecular dynamics, computational statistical mechanics and Bayesian statistics. In recent years, various…
We study the nonparametric estimation of the jump density of a renewal reward process from one discretely observed sample path over [0,T]. We consider the regime when the sampling rate goes to 0. The main difficulty is that a renewal reward…
Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…
We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices…
Dynamical reweighting methods permit to estimate kinetic observables of a stochastic process governed by a target potential $\tilde{V}(x)$ from trajectories that have been generated at a different potential $V(x)$. In this article, we…
Given a connected network, it can be augmented by applying a growing strategy (e.g. random or scale-free rules) over the previously existing structure. Another approach for augmentation, recently introduced, involves incorporating a direct…
In Bayesian theory, calculating a posterior probability distribution is highly important but usually difficult. Therefore, some methods have been put forward to deal with such problem, among which, the most popular one is the asymptotic…
We show that standard ResNet architectures can be made invertible, allowing the same model to be used for classification, density estimation, and generation. Typically, enforcing invertibility requires partitioning dimensions or restricting…
We present an elementary way to transform an expander graph into a simplicial complex where all high order random walks have a constant spectral gap, i.e., they converge rapidly to the stationary distribution. As an upshot, we obtain new…
We have formulated a kinetic theory for a condensed atomic gas in a trap, i.e., a generalized Gross-Pitaevskii equation, as well as a quantum-Boltzmann equation for the normal and anomalous fluctuations [R. Walser et al., Phys. Rev. A, 59,…
We propose a renormalization group treatment of stochastically growing networks. As an example, we study percolation on growing scale-free networks in the framework of a real-space renormalization group approach. As a result, we find that…
We propose methods for distributed graph-based multi-task learning that are based on weighted averaging of messages from other machines. Uniform averaging or diminishing stepsize in these methods would yield consensus (single task)…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
The irreversible adsorption of polymers to a two-dimensional solid surface is studied. An operator formalism is introduced for chemisorption from a polydisperse solution of polymers which transforms the analysis of the adsorption process to…
Data-driven modelling and synthesis of motion is an active research area with applications that include animation, games, and social robotics. This paper introduces a new class of probabilistic, generative, and controllable motion-data…
We propose a novel method for large-scale image stitching that is robust against repetitive patterns and featureless regions in the imagery. In such cases, state-of-the-art image stitching methods easily produce image alignment artifacts,…
Markov State Models (MSM) are widely used to elucidate dynamic properties of molecular systems from unbiased Molecular Dynamics (MD). However, the implementation of reweighting schemes for MSMs to analyze biased simulations, for example…