Related papers: Mobile Geometric Graphs: Detection, Coverage and P…
Three-dimensional dislocation networks control the mechanical properties such as strain hardening of crystals. Due to the complexity of dislocation networks and their temporal evolution, analysis tools are needed that fully resolve the…
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper,…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
We prove phase transitions for continuum percolation in a Boolean model based on a Cox point process with nonstabilizing directing measure. The directing measure, which can be seen as a stationary random environment for the classical…
In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph…
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollob\'as in 1968, and is defined as follows. Given a graph $H$, and a set $G \subset E(K_n)$ of initially `infected' edges, we infect, at each time…
Traffic forecasting is crucial for public safety and resource optimization, yet is very challenging due to three aspects: i) current existing works mostly exploit intricate temporal patterns (e.g., the short-term thunderstorm and long-term…
The assumption of using a static graph to represent multivariate time-varying signals oversimplifies the complexity of modeling their interactions over time. We propose a Dynamic Multi-hop model that captures dynamic interactions among…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We study Boolean networks which are simple spatial models of the highly conserved Delta-Notch system. The models assume the inhibition of Delta in each cell by Notch in the same cell, and the activation of Notch in presence of Delta in…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
In modern contexts, some types of data are observed in high-resolution, essentially continuously in time. Such data units are best described as taking values in a space of functions. Subject units carrying the observations may have…
Self-similarity and long-range correlations are the remarkable features of the Earth's surface topography. Here we develop an approach based on percolation theory to study the geometrical features of Earth. Our analysis is based on…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…