Related papers: sl(2) Operators and Markov Processes on Branching …
We investigate the windings around the origin of the two-dimensional Markov process (X,L) having the stable L\'evy process L and its primitive X as coordinates, in the non-trivial case when |L| is not a subordinator. First, we show that…
Depending on the interpretation of the type of edges, a chain graph can represent different relations between variables and thereby independence models. Three interpretations, known by the acronyms LWF, MVR, and AMP, are prevalent.…
We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM…
Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features…
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings…
Starting from the forward and backward infinitesimal generators of bilateral, time-homogeneous Markov processes, the self-adjoint Hamiltonians of the generalized Schroedinger equations are first introduced by means of suitable Doob…
The stochastic properties of a Langevin-type Markov process can be extracted from a given time series by a Markov analysis. Also processes that obey a stochastically forced second order differential equation can be analyzed this way by…
Understanding the data-generating process is essential for building machine learning models that generalise well while ensuring robustness and interpretability. This paper addresses the fundamental challenge of modelling the data generation…
Potential theory is a central tool to understand and analyse Markov processes. In this article, we develop its probabilistic counterpart for branching Markov chains. Specifically, we examine versions of quasi-processes or interlacements…
We consider the problem of modelling restricted interactions between continuously-observed time series as given by a known static graph (or network) structure. For this purpose, we define a parametric multivariate Graph Ornstein-Uhlenbeck…
Consider the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…
We introduce a stochastic dynamics related to the measures that arise in harmonic analysis on the infinite-dimensional unitary group. Our dynamics is obtained as a limit of a sequence of natural Markov chains on Gelfand-Tsetlin graph. We…
We introduce the Contextual Graph Markov Model, an approach combining ideas from generative models and neural networks for the processing of graph data. It founds on a constructive methodology to build a deep architecture comprising layers…
Consider the standard Poisson process in the first quadrant of the Euclidean plane, and for any point (u,v) of this quadrant take the Young diagram obtained by applying the Robinson-Schensted correspondence to the intersection of the…
The z-measures on partitions originated from the problem of harmonic analysis of linear representations of the infinite symmetric group in the works of Kerov, Olshanski and Vershik (1993, 2004). A similar family corresponding to projective…
Metric graphs are structures obtained by associating edges in a standard graph with segments of the real line and gluing these segments at the vertices of the graph. The resulting structure has a natural metric that allows for the study of…
We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy…
Quasi-stationary distributions (QSD) have been widely studied since the pioneering work of Kolmogorov (1938), Yaglom (1947) and Sevastyanov (1951). They appear as a natural object when considering Markov processes that are certainly…
We describe a general scheme of derivation of the Vlasov-type equations for Markov evolutions of particle systems in continuum. This scheme is based on a proper scaling of corresponding Markov generators and has an algorithmic realization…
An operator algebra implementation of Markov chain Monte Carlo algorithms for simulating Markov random fields is proposed. It allows the dynamics of networks whose nodes have discrete state spaces to be specified by the action of an update…