Related papers: Exploring the role of connectivity in disordered s…
It has been shown in the past that many real-world networks exhibit community structures and non-trivial clustering which comes with the occurrence of a notable number of triangular connections. Yet the influence of such connection patterns…
Inferring synaptic connectivity from neural population activity is a fundamental challenge in computational neuroscience, complicated by partial observability and mismatches between inference models and true circuit dynamics. In this study,…
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed in some area, we seek to build a directed strongly connected…
We numerically study the phase diagram and critical properties of the two-dimensional disordered O(n) loop model by using the transfer matrix and the worm Monte Carlo methods. The renormalization group flow is extracted from the landscape…
Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer-Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also…
In any network, the interconnection of nodes by means of geodesics and the number of geodesics existing between nodes are important. There exists a class of centrality measures based on the number of geodesics passing through a vertex.…
In order to investigate the effects of connectivity and proximity in the specific heat, a special class of exactly solvable planar layered Ising models has been studied in the thermodynamic limit. The Ising models consist of repeated…
Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…
The random-field Ising model (RFIM), one of the basic models for quenched disorder, can be studied numerically with the help of efficient ground-state algorithms. In this study, we extend these algorithm by various methods in order to…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
The contact process and the slightly different susceptible-infected-susceptible model are studied on long-range connected networks in the presence of random transition rates by means of a strong disorder renormalization group method and…
We investigate signatures of quantum chaos in the mixed-field quantum Ising model on finite-size Erd\H{o}s-R\'enyi graphs using probes scalable on near-term quantum devices. By tuning the graph connectivity, the system exhibits a crossover…
Extra connectivity and the pessimistic diagnosis are two crucial subjects for a multiprocessor system's ability to tolerate and diagnose faulty processor. The pessimistic diagnosis strategy is a classic strategy based on the PMC model in…
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
A path in an edge-colored graph is called a \emph{rainbow path} if all edges on it have pairwise distinct colors. For $k\geq 1$, the \emph{rainbow-$k$-connectivity} of a graph $G$, denoted $rc_k(G)$, is the minimum number of colors required…
Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…
We study the low-energy physics of the critical (2+1)-dimensional random transverse-field Ising model. The one-dimensional version of the model is a paradigmatic example of a system governed by an infinite-randomness fixed point, for which…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
One-dimensional geometric random graphs are constructed by distributing $n$ nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most $r_n$. These graphs…