Related papers: Dynamics of k-core percolation in a random graph
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising…
A stochastic process, when subject to resetting to its initial condition at a constant rate, generically reaches a non-equilibrium steady state. We study analytically how the steady state is approached in time and find an unusual relaxation…
We consider stochastic electro-mechanical dynamics of an overdamped power system in the vicinity of the saddle-node bifurcation associated with the loss of global stability such as voltage collapse or phase angle instability. Fluctuations…
We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erd\H{o}s-R\'enyi random graph process investigated by Palla, Der\'enyi and Vicsek
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…
The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this…
Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for…
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…
The resilience of a complex interconnected system concerns the size of the macroscopic functioning node clusters after external perturbations based on a random or designed scheme. For a representation of the interconnected systems with…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
Bifurcation diagram is a powerful tool that visually gives information about the behavior of the equilibrium points of a dynamical system respect to the varying parameter. This paper proposes an educational algorithm by which the local…
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each…
We study a discrete non-autonomous system whose autonomous counterpart (with the frozen bifurcation parameter) admits a saddle-node bifurcation, and in which the bifurcation parameter slowly changes in time and is characterized by a sweep…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
Let $k\geq 2$ and fix a $k$-uniform hypergraph $\mathcal{F}$. Consider the random process that, starting from a $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices, repeatedly deletes the edges of a copy of $\mathcal{F}$ chosen uniformly…
Graph analytics attract much attention from both research and industry communities. Due to the linear time complexity, the $k$-core decomposition is widely used in many real-world applications such as biology, social networks, community…
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…
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…
We introduce a dynamic random hypergraph model constructed from a bipartite graph. In this model, both vertex sets of the bipartite graph are generated by marked Poisson point processes. Vertices of both vertex sets are equipped with marks…