80 citations · 172 across the 7 of their papers we have counts for
8 papers
The Shortest-Path distance on graphons
Cédric Simal, Julien Petit, Timoteo Carletti
We define an analogue of the shortest-path distance for graphons. The proposed method is rooted on the extension to graphons of Varadhan's formula, a result that links the solution…
Random walks on dense graphs and graphons
Julien Petit, Renaud Lambiotte, Timoteo Carletti
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allow…
Classes of random walks on temporal networks with competing timescales
Julien Petit, Renaud Lambiotte, Timoteo Carletti
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may…
Random walk on temporal networks with lasting edges
Julien Petit, Martin Gueuning, Timoteo Carletti +2
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes dete…
Desynchronization induced by time-varying network
Maxime Lucas, Duccio Fanelli, Timoteo Carletti +1
The synchronous dynamics of an array of excitable oscillators, coupled via a generic graph, is studied. Non homogeneous perturbations can grow and destroy synchrony, via a self-con…
The theory of Turing patterns on time varying networks
Julien Petit, Ben Lauwens, Duccio Fanelli +1
The process of pattern formation for a multi-species model anchored on a time varying network is studied. A non homogeneous perturbation superposed to an homogeneous stable fixed p…