Related papers: The Critical Patch Size Problem in Random Graphs
Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals. We prove the existence and the necessary condition of a critical…
We investigate the spectral properties of the Dirichlet Laplacian on large finite metric balls within irregular infinite graphs of quadratic volume growth. We consider an exhaustion $G_n = B_{R_n}(x_0)$ and the spectral zeta value $Z_n(1) =…
The minimal dominating set for a digraph(directed graph)is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution for a given graph that…
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…
A Dirichlet $k$-partition of a domain $U \subseteq \mathbb{R}^d$ is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Dirichlet eigenvalues is minimal. A discrete version of Dirichlet partitions has…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a model in which each host can be in one of 3 possible states -…
The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph,…
A stable population network is hard to interrupt without any ecological consequences. A communication blockage between patches may destabilize the populations in the ecological network. This work deals with the construction of a safe cut…
We consider a weighted eigenvalue problem for the Dirichlet laplacian in a smooth bounded domain $\Omega\subset \mathbb{R}^N$, where the bang-bang weight equals a positive constant $\overline{m}$ on a ball $B\subset\Omega$ and a negative…
In this paper we consider a model for the spread of a stochastic SIR (Susceptible $\to$ Infectious $\to$ Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of…
This review paper presents the known results on the asymptotics of the survival probability and limit theorems conditioned on survival of critical and subcritical branching processes in IID random environments. The key assumptions of the…
We study the positive principal eigenvalue of a weighted problem associated with the Neumann spectral fractional Laplacian. This analysis is related to the investigation of the survival threshold in population dynamics. Our main result…
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. For the subcritical regime a kind of phase transition…
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…
We are interested in the survival probability of a population modeled by a critical branching process in an i.i.d. random environment. We assume that the random walk associated with the branching process is oscillating and satisfies a…
The subject of this paper is inspired by \cite{CC} and \cite{CCP}. In \cite{CC} the authors investigate the dynamics of a population in a heterogeneous environment by means of diffusive logistic equations. An important part of their study…
In this article, we study the growth and spread of a new species in a river network with two or three branches via the Fisher-KPP advection-diffusion equation over some simple graphs with every edge a half infinite line. We obtain a rather…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…