Related papers: First-passage phenomena in hierarchical networks
We study the effects of spatial constraints on the structural properties of networks embedded in one or two dimensional space. When nodes are embedded in space, they have a well defined Euclidean distance $r$ between any pair. We assume…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
We present a simple mathematical framework for the description of the dynamics of glassy systems in terms of a random walk in a complex energy landscape pictured as a network of minima. We show how to use the tools developed for the study…
Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descriptive complexity framework by Dong, Su, and Topor, and…
Starting from a stochastic individual-based description of an SIS epidemic spreading on a random network, we study the dynamics when the size $n$ of the network tends to infinity. We recover in the limit an infinite-dimensional…
This paper deals with the detection and prediction of losses due to cyber attacks waged on vital networks. The accumulation of losses to a network during a series of attacks is modeled by a 2-dimensional monotone random walk process as…
We introduce a two-type first passage percolation competition model on infinite connected graphs as follows. Type 1 spreads through the edges of the graph at rate 1 from a single distinguished site, while all other sites are initially…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…
We formulate a criterion for the existence and uniqueness of an invariant measure for a Markov process taking values in a Polish phase space. In addition, weak-$^*$ ergodicity, that is, the weak convergence of the ergodic averages of the…
We wish to understand the macroscopic plastic behaviour of metals by upscaling the micro-mechanics of dislocations. We consider a highly simplified dislocation network, which allows our microscopic model to be a one dimensional particle…
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 Master equation on directed networks - also called the differential Chapman-Kolmogorov equation - is a linear differential equation, which describes the probability evolution in a discrete system. While this is well understood, if the…
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous…
We discover a first-order phase transition in the canonical ensemble of random unlabeled networks with a prescribed average number of links. The transition is caused by the nonconcavity of microcanonical entropy. Above the critical point…
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…
Disordered spring networks are a useful paradigm to examine macroscopic mechanical properties of amorphous materials. Here, we study the elastic behavior of under-constrained spring networks, i.e.\ networks with more degrees of freedom than…
We introduce a model of percolation induced by disorder, where an initially homogeneous network with links of equal weight is disordered by the introduction of heterogeneous weights for the links. We consider a pair of nodes i and j to be…
Random walks are one of the best investigated dynamical processes on graphs. A particularly fascinating phenomenon is the scaling relationship of fluctuations $\sigma $ with the average flux $\langle f \rangle $. Here we analyze how network…
In this article, we obtain properties of the law associated to the first hitting time of a threshold by a one-dimensional uniformly elliptic diffusion process and to the associated process stopped at the threshold. Our methodology relies on…
We rigorously derive the dense graph limit of a discrete model describing the formation of biological transportation networks. The discrete model, defined on undirected graphs with pressure-driven flows, incorporates a convex energy…