Related papers: Exploring the role of connectivity in disordered s…
A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…
We study the ferromagnetic random field Ising model (RFIM) on a graph $G=(V,E)$ having maximal degree $\Delta$, where the external field at each vertex is an i.i.d. random variable. When the random field distribution is sufficiently…
We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlation and response functions (as for fully connected systems),…
The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. Let $S\subseteq…
Random intersection graphs have received much attention recently and been used in a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. For these graphs, each node is equipped…
We study the two-dimensional Ising model on a network with a novel type of quenched topological (connectivity) disorder. We construct random lattices of constant coordination number and perform large scale Monte Carlo simulations in order…
We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a…
The equilibrium and non--equilibrium disorder induced phase transitions are compared in the random-field Ising model (RFIM). We identify in the demagnetized state (DS) the correct non-equilibrium hysteretic counterpart of the T=0 ground…
The ground state critical properties of the Random Field Ising Model (RFIM) on the diamond hierarchical lattice are investigated via a combining method encompassing real space renormalization group and an exact recurrence procedure. The…
Random intersection graphs have received much attention for nearly two decades, and currently have a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. In this paper, we…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
In order to elucidate the relationship between rate-independent hysteresis and metastability in disordered systems driven by an external field, we study the Gaussian RFIM at T=0 on regular random graphs (Bethe lattice) of finite…
Small-world networks provide an interesting framework for studying the interplay between regular and random graphs, where links are located in a regular and random way, respectively. On one hand, the random links make the model to obey some…
Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes,…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
Characterizing the in uence of network properties on the global emerging behavior of interacting elements constitutes a central question in many areas, from physical to social sciences. In this article we study a primary model of disordered…
We study numerically the number of single-spin-flip stable states in the T=0 Random Field Ising Model (RFIM) on random regular graphs of connectivity $z=2$ and $z=4$ and on the cubic lattice. The annealed and quenched complexities (i.e. the…
We employed the random graph theory approach to analyze the protein-protein interaction database DIP (Feb. 2004), for seven species (S. cerevisiae, H. pylori, E. coli, C. elegans, H. sapiens, M. musculus and D. melanogaster). Several global…
We study critical hysteresis in the random-field Ising model (RFIM) on a two-dimensional periodic lattice with a variable coordination number $z_{eff}$ in the range $3 \le z_{eff} \le 6$. We find that the model supports critical behavior in…