Related papers: Dynamics of k-core percolation in a random graph
This paper is a continuation of the previous results on the stripping number of a random uniform hypergraph, and the maximum depth over all non-k-core vertices. The previous results focus on the supercritical case, whereas this work…
A temporal network is a dynamic graph where every edge is assigned an integer time label that indicates at which discrete time step the edge is available. We consider the problem of hierarchically decomposing the network and introduce an…
The evergreen problem of a bead on a rotating hoop shows a multitude of bifurcations when the bead moves with friction. This motion is studied for different values of the damping coefficient and rotational speeds of the hoop. Phase…
Let $(G_t)_{t \geq 0}$ be the random graph process ($G_0$ is edgeless and $G_t$ is obtained by adding a uniformly distributed new edge to $G_{t-1}$), and let $\tau_k$ denote the minimum time $t$ such that the $k$-core of $G_t$ (its unique…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
We study the spreading dynamics on graphs with a power law degree distribution p_k ~ k^-gamma with 2<gamma<3, as an example of a branching process with diverging reproductive number. We provide evidence that the divergence of the second…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
Finding important edges in a graph is a crucial problem for various research fields, such as network epidemics, signal processing, machine learning, and sensor networks. In this paper, we tackle the problem based on sampling theory on…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
In this paper we give the first efficient algorithms for the $k$-center problem on dynamic graphs undergoing edge updates. In this problem, the goal is to partition the input into $k$ sets by choosing $k$ centers such that the maximum…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…
A generic saddle-node bifurcation is proposed to modelize fast transitions of finite amplitude arising in geophysical (and perhaps other) contexts, when they result from the intrinsic dynamics of the system. The fast transition is…
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…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
A minimal model for self-organized critical percolation on directed graphs with activating and de-activating links is studied. Unlike classical self-organized criticality, the variables that determine criticality are separated from the…
This paper considers the dynamics of edges in a network. The Dynamic Bond Percolation (DBP) process models, through stochastic local rules, the dependence of an edge $(a,b)$ in a network on the states of its neighboring edges. Unlike…
Key graph-based problems play a central role in understanding network topology and uncovering patterns of similarity in homogeneous and temporal data. Such patterns can be revealed by analyzing communities formed by nodes, which in turn can…