Related papers: Graphon-valued processes with vertex-level fluctua…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
We discuss a one-dimensional model of a fluctuating interface with a dynamic exponent $z=1$. The events that occur are adsorption, which is local, and desorption which is non-local and may take place over regions of the order of the system…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
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…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
Systems with interacting degrees of freedom play a prominent role in stochastic thermodynamics. Our aim is to use the concept of detached path probabilities and detached entropy production for bipartite Markov processes and elaborate on a…
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 determining the walker's waiting-time, the up-time and down-time…
Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…
In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…
A class of stochastic processes strongly related to random sums plays an important role in network and in finance. In this paper we study this kind of stochastic process discuss an overtime unchanged parameter and reveal its asymptotic…
We consider temporal models of rapidly changing Markovian networks modulated by time-evolving spatially dependent kernels that define rates for edge formation and dissolution. Alternatively, these can be viewed as Markovian networks with…
We introduce and test an algorithm that adaptively estimates large deviation functions characterizing the fluctuations of additive functionals of Markov processes in the long-time limit. These functions play an important role for predicting…
We analyse large deviations of time-averaged quantities in stochastic processes with long-range memory, where the dynamics at time t depends itself on the value q_t of the time-averaged quantity. First we consider the elephant random walk…
The mechanisms by which modularity emerges in complex networks are not well understood but recent reports have suggested that modularity may arise from evolutionary selection. We show that finding the modularity of a network is analogous to…
In this paper, we study a class of self-exciting point processes. The intensity of the point process has a nonlinear dependence on the past history and time. When a new jump occurs, the intensity increases and we expect more jumps to come.…
Graph neural networks (GNNs) are learning architectures that rely on knowledge of the graph structure to generate meaningful representations of large-scale network data. GNN stability is thus important as in real-world scenarios there are…
Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with…
The methodology based on the random walk processes is adapted and applied to a comprehensive analysis of the statistical properties of the probability fluxes. To this aim we define a simple model of the Markovian stochastic dynamics on a…