Related papers: A switching identity for cable-graph loop soups an…

Independent sets in graphs, i.e., subsets of vertices where no two are adjacent, have long been studied, for instance as a model of hard-core gas. The $d$-dimensional hypercube, $\{0,1\}^d$, with the nearest neighbor structure, has been a…

Graph signal processing (GSP) uses a shift operator to define a Fourier basis for the set of graph signals. The shift operator is often chosen to capture the graph topology. However, in many applications, the graph topology may be unknown a…

We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…

Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two…

Causal inference provides an analytical framework to identify and quantify cause-and-effect relationships among a network of interacting agents. This paper offers a novel framework for analyzing cascading failures in power transmission…

Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be…

We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be…

A group $G$ splits over a subgroup $C$ if $G$ is either a free product with amalgamation $A \underset{C}{\ast} B$ or an HNN-extension $G=A \underset{C}{\ast} (t)$. We invoke Bass-Serre theory and classify all infinite groups which admit…

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

We obtain sufficient conditions of stochastic equivalence of Gaussian random fields with special covariance function. These results generalize Doob's transformation (condition of stochastic equivalence of a Gaussian and a Wiener processes)…

Within the derivative expansion of conformally reduced gravity, the modified split Ward identities are shown to be compatible with the flow equations if and only if either the anomalous dimension vanishes or the cutoff profile is chosen to…

We study percolation of two-sided level sets for the discrete Gaussian free field (DGFF) in 2D. For a DGFF $\varphi$ defined in a box $B_N$ with side length $N$, for $C$ large enough, there exist low crossings in the set of vertices $z$…

Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…

An important source of high clustering coefficient in real-world networks is transitivity. However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific…

We extend the notion of $y$-variables (coefficients) in cluster algebras to cluster scattering diagrams. Accordingly, we extend the dilogarithm identity associated with a period in a cluster pattern to the one associated with a loop in a…

In this paper we first analyze the behaviour of the identifying code number under union and join operations in graphs. This study forced us to analyze three new parameters related to identifying codes, dominating sets and total dominating…

We compute analytically and in closed form the four-point correlation function in the plane, and the two-point correlation function in the upper half-plane, of layering vertex operators in the two dimensional conformally invariant system…

Let $G=A_n$, a finite alternating group. We study the commuting graph of $G$ and establish, for all possible values of $n$ barring $13, 14, 17$ and $19$, whether or not the independence number is equal to the clique-covering number.

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…

We show that, for pertinent values of the fabrication and control parameters, an attractive finite coupling fixed point emerges in the phase diagram of a Y-junction of superconducting Josephson chains. The new fixed point arises only when…