Related papers: Exploring the role of connectivity in disordered s…
Complex systems of interacting components often can be modeled by a simple graph $\mathcal{G}$ that consists of a set of $n$ nodes and a set of $m$ edges. Such a graph can be represented by an adjacency matrix $A\in\R^{n\times n}$, whose…
The random-cluster model with parameters $(p,q)$ is a random graph model that generalizes bond percolation ($q=1$) and the Ising and Potts models ($q\geq 2$). We study its Glauber dynamics on $n\times n$ boxes $\Lambda_{n}$ of the integer…
We investigate a kinetic Ising model with several single-spin flip dynamics (including Metropolis and heat-bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the…
For any positive edge density $p$, a random graph in the Erd\H{o}s-Renyi $G_{n,p}$ model is connected with non-zero probability, since all edges are mutually independent. We consider random graph models in which edges that do not share…
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…
Randomness is known to affect the dynamical behaviour of many systems to a large extent. In this paper we investigate how the nature of randomness affects the dynamics in a zero temperature quench of Ising model on two types of random…
Functional connectivity (FC) has been widely used to study brain network interactions underlying the emerging cognition and behavior of an individual. FC is usually defined as the correlation or partial correlation between brain regions.…
Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…
It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating…
We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…
We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
We present a nonperturbative analysis of the weak- and strong-disorder regimes of the continuous random-field Ising model using the distributional zeta-function method. By performing the quenched-disorder average at the level of the…
We study the effects of uncorrelated quenched disorder to the phase diagram and continuous transitions of three-dimensional lattice ${\mathbb Z}_2$ gauge Higgs models. For this purpose, we consider two types of quenched disorder, associated…
A recent study revealed the dynamics of the charge sector of a one-dimensional quarter-filled electronic system with extended Hubbard interactions to be that of an effective pseudospin transverse-field Ising model (TFIM) in the strong…
Functional connectivity is a fundamental property of neural networks that quantifies the segregation and integration of information between cortical areas. Due to mathematical complexity, a theory that could explain how the parameters of…
Let A be a minor-closed class of labelled graphs, and let G_n be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that G_n is connected? How many components does it have? How…
The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is a generalization of the traditional connectivity. It is well known that the generalized $k$-connectivity is an important indicator for measuring the fault…
We study the +/- J random-plaquette Z_2 gauge model (RPGM) in three spatial dimensions, a three-dimensional analog of the two-dimensional +/- J random-bond Ising model (RBIM). The model is a pure Z_2 gauge theory in which randomly chosen…
The phenomena of synchronization and nontrivial collective behavior are studied in a model of coupled chaotic maps with random global coupling. The mean field of the system is coupled to a fraction of elements randomly chosen at any given…