Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to "jump " to non-neighborhood nodes, most notably the transformed path graph Laplacians and the fractional graph Laplacian. From a rigorous point of view, this new dynamics is made possible by having replaced the original graph G with a weighted complete graph G' on the same node-set, that depends on G and wherein the presence of new edges allows a direct passage between nodes that were not neighbors in G. We show that, in general, the graph G' is not compatible with the dynamics characterizing the original model graph G: the random walks on G' subjected to move on the edges of G are not stochastically equivalent...
International audienceThe graph Laplacian plays an important role in describing the structure of a g...
Abstract. During the last decade many attempts have been made to characterize absence of spontaneous...
This thesis discusses various aspects of continuous-time simple random walks on measure weighted gra...
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes,...
Classical dynamics on graphs, like diffusion and random walks, can be defined using the graph Laplac...
We introduce non-local dynamics on directed networks through the construction of a fractional versio...
Here we study and compare nonlocal diffusion processes on networks based on two different kinds of L...
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamen...
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena whe...
Given a sample from a probability measure with support on a submanifold in Euclidean space one can c...
This thesis covers two distinct topics connected by their use of graphs. First is a theoretical anal...
Given a sample from a probability measure with support on a submanifold in Euclidean space one can c...
A random walk is a basic stochastic process on graphs and a key primitive in the design of distribut...
This thesis has two primary areas of focus. First we study connection graphs, which are weighted gra...
In this work, Brownian motions on metric graphs are defined as right continuous, strong Markov proc...
International audienceThe graph Laplacian plays an important role in describing the structure of a g...
Abstract. During the last decade many attempts have been made to characterize absence of spontaneous...
This thesis discusses various aspects of continuous-time simple random walks on measure weighted gra...
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes,...
Classical dynamics on graphs, like diffusion and random walks, can be defined using the graph Laplac...
We introduce non-local dynamics on directed networks through the construction of a fractional versio...
Here we study and compare nonlocal diffusion processes on networks based on two different kinds of L...
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamen...
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena whe...
Given a sample from a probability measure with support on a submanifold in Euclidean space one can c...
This thesis covers two distinct topics connected by their use of graphs. First is a theoretical anal...
Given a sample from a probability measure with support on a submanifold in Euclidean space one can c...
A random walk is a basic stochastic process on graphs and a key primitive in the design of distribut...
This thesis has two primary areas of focus. First we study connection graphs, which are weighted gra...
In this work, Brownian motions on metric graphs are defined as right continuous, strong Markov proc...
International audienceThe graph Laplacian plays an important role in describing the structure of a g...
Abstract. During the last decade many attempts have been made to characterize absence of spontaneous...
This thesis discusses various aspects of continuous-time simple random walks on measure weighted gra...