Related papers: Exploring the role of connectivity in disordered s…
We consider two disordered lattice models on the square lattice: on the medial lattice the random field Ising model at T=0 and on the direct lattice the random bond Potts model in the large-q limit at its transition point. The interface…
An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that…
Functional connectivity analysis is an important tool for characterizing interactions among brain regions, particularly in studies of neurodegenerative disorders such as Alzheimer's disease (AD). Gaussian graphical models (GGMs) provide a…
In this paper we study the connectivity properties of the random subgraph of the $n$-cube generated by the $k$-out model and denoted by $Q^n(k)$. Let $k$ be an integer, $1\leq k \leq n-1$. We let $Q^n(k)$ be the graph that is generated by…
The Sachdev-Ye-Kitaev (SYK) model is a model of $q$ interacting fermions whose large N limit is dominated by melonic graphs. In this review we first present a diagrammatic proof of that result by direct, combinatorial analysis of its…
In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is…
We study the problem of cooperative localization of a large network of nodes in integer-coordinated unit disk graphs, a simplified but useful version of general random graph. Exploiting the property that the radius $r$ sets clear cut on the…
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…
We report on single-cluster Monte Carlo simulations of the Ising, 4-state Potts and 10-state Potts models on quenched ensembles of planar, tri-valent random graphs. We confirm that the first-order phase transition of the 10-state Potts…
The cluster state acquired by evolving the nearest-neighbor (NN) Ising model from a completely separable state is the resource for measurement-based quantum computation. Instead of an NN system, a variable-range power law interacting Ising…
Firing patterns in the central nervous system often exhibit strong temporal irregularity and heterogeneity in their time averaged response properties. Previous studies suggested that these properties are outcome of an intrinsic chaotic…
The robustness of dynamical properties of neuronal networks against structural damages is a central problem in computational and experimental neuroscience. Research has shown that the cortical network of a healthy brain works near a…
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…
An edge-colored graph $G$ is conflict-free connected if any two of its vertices are connected by a path which contains a color used on exactly one of its edges. The conflict-free connection number of a connected graph $G$, denoted by…
In the analysis of large-scale network data, a fundamental operation is the comparison of observed phenomena to the predictions provided by null models: when we find an interesting structure in a family of real networks, it is important to…
We propose a data-driven approach to represent neuronal network dynamics as a Probabilistic Graphical Model (PGM). Our approach learns the PGM structure by employing dimension reduction to network response dynamics evoked by stimuli applied…
We present a neuronal network model inspired by the Ising model, where each neuron is a binary spin ($s_i = \pm1$) interacting with its neighbors on a 2D lattice. Updates are asynchronous and follow Metropolis dynamics, with a…
Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical…
We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by…
We show that the nonequilibrium dynamics of systems with many interacting elements located on a small-world network can be much slower than on regular networks. As an example, we study the phase ordering dynamics of the Ising model on a…