Related papers: Likelihood theory for the Graph Ornstein-Uhlenbeck…
We consider the problem of controlling a partially-observed dynamic process on a graph by a limited number of interventions. This problem naturally arises in contexts such as scheduling virus tests to curb an epidemic; targeted marketing in…
The graphical lasso is a widely used algorithm for fitting undirected Gaussian graphical models. However, for inference on functionals of edge values in the learned graph, standard tools lack formal statistical guarantees, such as control…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
In this article, we introduce a non Gaussian long memory process constructed by the aggregation of independent copies of a fractional L\'evy Ornstein-Uhlenbeck process with random coefficients. Several properties and a limit theorem are…
The Ornstein-Uhlenbeck (OU) process describes the dynamics of Brownian particles in a confining harmonic potential, thereby constituting the paradigmatic model of overdamped, mean-reverting Langevin dynamics. Despite its widespread…
This paper generalizes asymptotic properties obtained in the observation-driven times series models considered by \cite{dou:kou:mou:2013} in the sense that the conditional law of each observation is also permitted to depend on the…
Holland and Leinhardt (1981) proposed a directed random graph model, the p1 model, to describe dyadic interactions in a social network. In previous work (Petrovic et al., 2010), we studied the algebraic properties of the p1 model and showed…
The main purpose of this chapter is to present some theoretical aspects of parametric estimation of L\'evy processes based on high-frequency sampling, with a focus on infinite activity pure-jump models. Asymptotics for several classes of…
Theoretical computer science plays an important role in the understanding of social networks and their properties. We can model information rippling throughout social networks, or the opinions of social media users for example, using graph…
A trigonometrically approximated maximum likelihood estimation for $\alpha$-stable laws is proposed. The estimator solves the approximated likelihood equation, which is obtained by projecting a true score function on the space spanned by…
This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed…
We propose a non-Gaussian operator-valued extension of the Barndorff-Nielsen and Shephard stochastic volatility dynamics, defined as the square-root of an operator-valued Ornstein-Uhlenbeck process with Levy noise and bounded drift. We…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
This paper studies theory and inference related to a class of time series models that incorporates nonlinear dynamics. It is assumed that the observations follow a one-parameter exponential family of distributions given an accompanying…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…
We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test…
The linear fractional stable motion generalizes two prominent classes of stochastic processes, namely stable L\'evy processes, and fractional Brownian motion. For this reason it may be regarded as a basic building block for continuous time…
For $n$ equidistant observations of a L\'evy process at time distance $\Delta_n$ we consider the problem of testing hypotheses on the volatility, the jump measure and its Blumenthal-Getoor index in a non- or semiparametric manner.…
This paper deals with nonparametric maximum likelihood estimation for Gaussian locally stationary processes. Our nonparametric MLE is constructed by minimizing a frequency domain likelihood over a class of functions. The asymptotic behavior…
We analyze the Levy processes produced by means of two interconnected classes of non stable, infinitely divisible distribution: the Variance Gamma and the Student laws. While the Variance Gamma family is closed under convolution, the…