Related papers: The Critical Patch Size Problem in Random Graphs
In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks, where nodes represent subpopulations, and where agents diffuse and interact. Recent studies suggest that heterogeneous network structure…
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…
An integro-differential equation on a tree graph is used to model the evolution and spatial distribution of a population of organisms in a river network. Individual organisms become mobile at a constant rate, and disperse according to an…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…
We consider a shape optimization problem for the persistence threshold of a biological species dispersing in a periodically fragmented environment, the unknown shape corresponding to the portion of the habitat which is favorable to the…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
This article is concerned with a stochastic multi-patch model in which each local population is subject to a strong Allee effect. The model is obtained by using the framework of interacting particle systems to extend a stochastic two-patch…
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…
The $\mathcal{D}$-process is a single player game in which the player is initially presented the empty graph on $n$ vertices. In each step, a subset of edges $X$ is independently sampled according to a distribution $\mathcal{D}$. The player…
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets…
It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…
We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…
In this paper we study two natural models of \textit{random temporal} graphs. In the first, the \textit{continuous} model, each edge $e$ is assigned $l_e$ labels, each drawn uniformly at random from $(0,1]$, where the numbers $l_e$ are…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the…
The bootstrap percolation (or threshold model) is a dynamic process modelling the propagation of an epidemic on a graph, where inactive vertices become active if their number of active neighbours reach some threshold. We study an…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…