相关论文: Structure fault diameter of hypercubes

In scanning tunneling microscopy (STM) conductance curves, the superconducting gap of cuprates is sometimes accompanied by small sub-gap structures at very low energy. This was documented early on near vortex cores and later at zero…

Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. While transportation resilience has been widely studied, understanding how random and targeted…

Let $Q_d$ denote the hypercube of dimension $d$. Given $d\geq m$, a spanning subgraph $G$ of $Q_d$ is said to be $(Q_d,Q_m)$-saturated if it does not contain $Q_m$ as a subgraph but adding any edge of $E(Q_d)\setminus E(G)$ creates a copy…

By means of numerical simulations we investigate the geometric properties of loops on hypercubic lattice graphs in dimensions d=2 through 7, where edge weights are drawn from a distribution that allows for positive and negative weights. We…

In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…

We derive attainable upper bounds on the algebraic connectivity (spectral gap) of a regular graph in terms of its diameter and girth. This bound agrees with the well-known Alon-Boppana-Friedman bound for graphs of even diameter, but is an…

We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…

A $k$-fault-tolerant connectivity preserver of a directed $n$-vertex graph $G$ is a subgraph $H$ such that, for any edge set $F \subseteq E(G)$ of size $|F| \le k$, the strongly connected components of $G - F$ and $H - F$ are the same.…

A median graph is a connected graph, such that for any three vertices $u,v,w$ there is exactly one vertex $x$ that lies simultaneously on a shortest $(u,v)$-path, a shortest $(v,w)$-path and a shortest $(w,u)$-path. Examples of median…

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…

Parallel and distributed computing systems are foundational to the success of cloud computing and big data analytics. These systems process computational workflows in a way that can be mathematically modeled by a fork-and-join queueing…

We give alternative definitions for maximum matching width, e.g. a graph $G$ has $\operatorname{mmw}(G) \leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every maximal clique $X$ of $H$ there exists $A,B,C \subseteq X$…

A 1-factorisation of a regular graph $G$ is a partition of its edge set $E(G)$ into perfect matchings of $G$. Behague asked for the minimal $r=r(d)$ such that some $1$-factorisation of the $d$-dimensional hypercube $Q_d$ has the property…

Subgraph densities play a crucial role in network analysis, especially for the identification and interpretation of meaningful substructures in complex graphs. Localized subgraph densities, in particular, can provide valuable insights into…

Understanding the origins of unconventional superconductivity has been a major focus of condensed matter physics for many decades. While many questions remain unanswered, experiments have found that the systems with the highest critical…

The emergence of superconductivity in slightly-misaligned graphene bilayer [1] and moir\'e excitons in MoSe$_2$-WSe$_2$ van der Waals (vdW) heterostructures [2] is intimately related to the formation of a 2D superlattice in those systems.…

Wireless Sensor Networks (WSN) are the backbone of essential monitoring applications, but their deployment in unfavourable conditions increases the risk to data integrity and system reliability. Traditional fault detection methods often…

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

We study the problem of testing for structure in networks using relations between the observed frequencies of small subgraphs. We consider the statistics \begin{align*} T_3 & =(\text{edge frequency})^3 - \text{triangle frequency}\\ T_2 &…

This paper explores a variety of strategies for understanding the formation, structure, efficiency and vulnerability of water distribution networks. Water supply systems are studied as spatially organized networks for which the practical…