Related papers: Exploring the role of connectivity in disordered s…
We consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random…
We revisit the phenomenon of spinodals in the presence of quenched disorder and develop a complete theory for it. We focus on the spinodal of an Ising model in a quenched random field (RFIM), which has applications in many areas from…
In this note we establish a resilience version of the classical hitting time result of Bollob\'{a}s and Thomason regarding connectivity. A graph $G$ is said to be $\alpha$-resilient with respect to a monotone increasing graph property…
We study the ferromagnetic random-field Ising model on random graphs of fixed connectivity z (Bethe lattice) in the presence of an external magnetic field $H$. We compute the number of single-spin-flip stable configurations with a given…
Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\cap E(T_j)= \emptyset$ and $V(T_i)\cap V(T_j)=S$ for any pair…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…
We study the long-time average of the reduced density matrix (RDM) of a two-level system as the central system, which is locally coupled to a generic many-body quantum chaotic system as the environment, under an overall Schr\"{o}dinger…
In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides fundamental opportunities in reducing the number of tests…
The present study was concerned with network failure problems for simple connected undirected graphs. A connected graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each edge has an identical…
Mesoscopic models of finite-size neuronal populations are crucial to understand the dynamics of neural networks in the brain, especially their fluctuations and response to stimuli. However, current theories to derive such models are based…
The global functional brain network (graph) is more suitable for characterizing brain states than local analysis of the connectivity of brain regions. Therefore, graph-theoretic approaches are the natural methods to study the brain.…
The contribution of structural connectivity to functional brain states remains poorly understood. We present a mathematical and computational study suited to assess the structure--function issue, treating a system of Jansen--Rit neural-mass…
We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…
We have developed a very efficient numerical algorithm of the strong disorder renormalization group method to study the critical behaviour of the random transverse-field Ising model, which is a prototype of random quantum magnets. With this…
We study the stability properties of a susceptible-infected-susceptible (SIS) diffusion model, so-called the $n$-intertwined Markov model, over arbitrary directed network topologies. As in the majority of the work on infection spread…
Let $S\subseteq V(G)$ and $\kappa_{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_1, T_2, \cdots, T_r$ in $G$ such that $V(T_i)\bigcap V(T_{j})=S$ for any $i, j \in \{1, 2, \cdots, r\}$ and $i\neq j$. For an integer $k$ with…
Consider the random graph $G({\mathcal P}_{n},r)$ whose vertex set ${\mathcal P}_{n}$ is a Poisson point process of intensity $n$ on $(- \frac{1}{2}, \frac{1}{2}]^d$, $d \geq 2$. Any two vertices $X_i,X_j \in {\mathcal P}_{n}$ are connected…
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as…
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be…
We use zero-temperature Glauber dynamics to study hysteresis in the random-field Ising model on directed random graphs. The critical behavior of the model depends on the connectivity $z$ of the graph rather differently from that on…