Related papers: Phase transitions for contact processes on one-dim…
In this paper we present a numerical study of a mathematical model of spiking neurons introduced by Ferrari et al. in an article entitled Phase transition forinfinite systems of spiking neurons. In this model we have a countable number of…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
Predicting labels of nodes in a network, such as community memberships or demographic variables, is an important problem with applications in social and biological networks. A recently-discovered phase transition puts fundamental limits on…
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…
Despite decades of research, the precise role of topological disorder in critical phenomena has yet to be fully understood. A major contribution has been the work by Barghathi and Vojta, which uses spatial correlations to explain puzzling…
We study the problem of detecting latent geometric structure in random graphs. To this end, we consider the soft high-dimensional random geometric graph $\mathcal{G}(n,p,d,q)$, where each of the $n$ vertices corresponds to an independent…
This paper studies the problem of detecting the presence of a small dense community planted in a large Erd\H{o}s-R\'enyi random graph $\mathcal{G}(N,q)$, where the edge probability within the community exceeds $q$ by a constant factor.…
We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…
The susceptible--infected--susceptible (SIS) epidemic process on complex networks can show metastability, resembling an endemic equilibrium. In a general setting, the metastable state may involve a large portion of the network, or it can be…
We study absorbing-state phase transitions in two-dimensional Voronoi-Delaunay (VD) random lattices with quenched coordination disorder. Quenched randomness usually changes the criticality and destroys discontinuous transitions in…
The extinction of the contact process in lattice models with quenched disorder is analysed in the limit of small density of infected sites. It is shown that the problem in such a regime can be mapped to the quantum-mechanical one…
The critical behavior of Ising model on a one-dimensional network, which has long-range connections at distances $l>1$ with the probability $\Theta(l)\sim l^{-m}$, is studied by using Monte Carlo simulations. Through studying the Ising…
In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
We present high-accuracy quasi-stationary (QS) simulations of the contact process in quenched networks, built using the configuration model with both structural and natural cutoffs. The critical behavior is analyzed in the framework of the…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
Dynamical phase transitions (DPTs) characterize critical changes in system behavior occurring at finite times, providing a lens to study nonequilibrium phenomena beyond conventional equilibrium physics. While extensively studied in quantum…
A simple model to study cooperation is the two-species symbiotic contact process (2SCP), in which two different species spread on a graph and interact by a reduced death rate if both occupy the same vertex, representing a symbiotic…
We perform theoretical and algorithmic studies for the problem of clustering and semi-supervised classification on graphs with both pairwise relational information and single-point feature information, upon a joint stochastic block model…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…