Related papers: The Critical Patch Size Problem in Random Graphs
In this paper, we analyze the role of initial conditions in population persistence. Specifically, we consider the reaction-diffusion equation $u_t\,=\,D\,(u^{\nu-1}\,u_x)_x\,+\,a\,u^{\mu}$, with $\mu,\nu>0$, accompanied by hostile boundary…
We consider a discrete-time host-parasite model for a population of cells which are colonized by proliferating parasites. The cell population grows like an ordinary Galton-Watson process, but in reflection of real biological settings the…
Complex interactions are at the root of the population dynamics of many natural systems, particularly for being responsible for the allocation of species and individuals across apposite niches of the ecological landscapes. On the other…
We investigate monotonicity properties of eigenvalues of the Dirichlet Laplacian in polyhedral layers of fixed width. We establish that eigenvalues below the essential spectrum threshold monotonically depend on geometric parameters defining…
The basic reproduction ratio is a crucial threshold parameter in infectious disease models. In nonlocal dispersal systems, its variational characterization is challenging due to the possible absence of a principal eigenvalue caused by…
Dispersal networks critically shape the fate of ecological communities, yet the mechanisms linking connectivity and persistence remain poorly understood. We show that an interplay between asymmetric dispersal and asynchronous dynamics…
Spectral methods include a family of algorithms related to the eigenvectors of certain data-generated matrices. In this work, we are interested in studying the geometric landscape of the eigendecomposition problem in various spectral…
We study a discrete and continuous version of the spectral Dirichlet problem in an open bounded connected set $\Omega\subset \mathbb{R}^d$, in dimension $d\geq 2$. More precisely, consider the simple random walk on $\mathbb{Z}^d$ killed…
Robustness is a critical measure of the resilience of large networked systems, such as transportation and communication networks. Most prior works focus on the global robustness of a given graph at large, e.g., by measuring its overall…
We establish existence and regularity results for boundary value problems arising from the first variation of the Willmore energy in the graphical setting. Our focus lies on two-dimensional surfaces with fixed clamped boundary conditions,…
We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…
In this paper we introduce a class of stochastic population models based on "patch dynamics". The size of the patch may be varied, and this allows one to quantify the departures of these stochastic models from various mean field theories,…
We consider the transmission eigenvalue problem for an impenetrable obstacle with Dirichlet boundary condition surrounded by a thin layer of non-absorbing inhomogeneous material. We derive a rigorous asymptotic expansion for the first…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
We study the discrete-to-continuum consistency of the training of shallow graph convolutional neural networks (GCNNs) on proximity graphs of sampled point clouds under a manifold assumption. Graph convolution is defined spectrally via the…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…
We study a parabolic Lotka-Volterra type equation that describes the evolution of a population structured by a phenotypic trait, under the effects of mutations and competition for resources modelled by a nonlocal feedback. The limit of…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…
A central issue in ecology today is that of the factors determining the relative abundance of species within a natural community. The proper application of the principles of statistical physics to the problem of species abundance…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…