Related papers: Exploring the role of connectivity in disordered s…
We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the…
We study the correlated-disorder driven zero-temperature phase transition of the Random-Field Ising Magnet using exact numerical ground-state calculations for cubic lattices. We consider correlations of the quenched disorder decaying…
We study the coordination game with an aspiration-driven update rule in regular graphs and scale-free networks. We prove that the model coincides exactly with the Ising model and shows a phase transition at the critical selection noise when…
In a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume…
The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \cdots, T_k$ connecting…
We study the hysteretic evolution of the random field Ising model (RFIM) at T=0 when the magnetization M is controlled externally and the magnetic field H becomes the output variable. The dynamics is a simple modification of the…
A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine…
The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…
Complex networks often exhibit emergent behaviors, where simple dyadic interactions yield collective dynamics that cannot be explained by examining the system's units individually or in pairs. Understanding how redundant and synergistic…
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…
We present exact results for the critical behavior of the RFIM on complete graphs and trees, both at equilibrium and away from equilibrium, i.e., models for hysteresis and Barkhausen noise. We show that for stretched exponential and power…
Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have…
We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…
In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead…
We study the effects of quenched disorder in a class of quantum chains with (p+1)-multispin interactions exhibiting a free fermionic spectrum, paying special attention to the case p=2. Depending if disorder couples to (i) all the couplings…
We introduce an approximate mapping between the random fuse network (RFN) and a random field dipolar Ising model (RFDIM). The state of the network damage is associated with a metastable spin configuration. A mean-field treatment, numerical…
We introduce and study systems of randomly coupled maps (RCM) where the relevant parameter is the degree of connectivity in the system. Global (almost-) synchronized states are found (equivalent to the synchronization observed in globally…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
The random-field Ising model (RFIM) is one of the simplest statistical-mechanical models that captures the anomalous irreversible collective response seen in a wide range of physical, biological, or socio-economic situations in the presence…
We investigate the influence of quenched disorder on the steady states of driven systems of the elastic interface with non-local hydrodynamic interactions. The generalized elastic model (GEM), which has been used to characterize numerous…