Related papers: Likelihood theory for the Graph Ornstein-Uhlenbeck…
Piecewise $\alpha$-stable Ornstein-Uhlenbeck (OU) processes arising in queue networks usually do not have an explicit dissipation, which makes the related numerical methods such as Euler-Maruyama (EM) scheme more difficult to analyze. We…
I introduce a general, Bayesian method for modelling univariate time series data assumed to be drawn from a continuous, stochastic process. The method accommodates arbitrary temporal sampling, and takes into account measurement…
Constructing \Levy-driven Ornstein-Uhlenbeck processes is a task closely related to the notion of self-decomposability. In particular, their transition laws are linked to the properties of what will be hereafter called the \emph{a-reminder}…
Using a coupling for the weighted sum of independent random variables and the explicit expression of the transition semigroup of Ornstein-Uhlenbeck processes driven by compound Poisson processes, we establish the existence of a successful…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
A model for network panel data is discussed, based on the assumption that the observed data are discrete observations of a continuous-time Markov process on the space of all directed graphs on a given node set, in which changes in tie…
The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
An Ornstein-Uhlenbeck (OU) process can be considered as a continuous time interpolation of the discrete time AR$(1)$ process. Departing from this fact, we analyse in this work the effect of iterating OU treated as a linear operator that…
This paper builds a multivariate L\'evy-driven Ornstein-Uhlenbeck process for the management of non-maturing deposits, that are a major source of funding for banks. The contribution of the paper is both theoretical and operational. On the…
We review the probabilistic properties of Ornstein-Uhlenbeck processes in Hilbert spaces driven by L\'{e}vy processes. The emphasis is on the different contexts in which these processes arise, such as stochastic partial differential…
The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this…
Current phylogenetic comparative methods generally employ the Ornstein-Uhlenbeck(OU) process for modeling trait evolution. Being able of tracking the optimum of a trait within a group of related species, the OU process provides information…
Univariate superpositions of Ornstein--Uhlenbeck-type processes (OU), called supOU processes, provide a class of continuous time processes capable of exhibiting long memory behavior. This paper introduces multivariate supOU processes and…
We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…
The so-called "supOU" processes, namely the superpositions of Ornstein-Uhlenbeck type processes are stationary processes for which one can specify separately the marginal distribution and the dependence structure. They can have finite or…
Hierarchical autocorrelation in the error term of linear models arises when sampling units are related to each other according to a tree. The residual covariance is parametrized using the tree-distance between sampling units. When…
Mechanistic network models specify the mechanisms by which networks grow and change, allowing researchers to investigate complex systems using both simulation and analytical techniques. Unfortunately, it is difficult to write likelihoods…
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-R\'{e}nyi model, where it settles a conjecture of Hajek [IEEE…
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the lp-norm of the parameters. We discuss several implications of Lipschitz parametrization. We present an upper bound of the…