相关论文: A switching identity for cable-graph loop soups an…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
Seidel switching is a classical operation on graphs which plays a central role in the theory of two-graphs, signed graphs, and switching classes. In this paper we focus on those switches which leave a given graph invariant up to…
The question of determining a signal from its higher-order autocorrelation data is of practical interest in fields as varied as X-ray crystallography, image processing, and satellite communications. At the heart of the issue is how much of…
A clustering is an implicit assignment of labels of points, based on proximity to other points. It is these labels that are then used for downstream analysis (either focusing on individual clusters, or identifying representatives of…
Clustering is a well-known and studied problem, one of its variants, called contiguity-constrained clustering, accepts as a second input a graph used to encode prior information about cluster structure by means of contiguity constraints…
Inverse probability problems whose generative models are given by strictly nonlinear Gaussian random fields show the all-or-nothing behavior: There exists a critical rate at which Bayesian inference exhibits a phase transition. Below this…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
A dynamical system approaching the first-order transition can exhibit a specific type of critical behavior known as self-organized bistability (SOB). It lies in the fact that the system can permanently switch between the coexisting states…
We provide several examples and an intuitive diagrammatic representation demonstrating the use of two-qubit unitary transformations for mapping coupled spin Hamiltonians to simpler ones and vice versa. The corresponding dualities may be…
The main message in this paper is that there are surprisingly many different Brownian bridges, some of them - familiar, some of them - less familiar. Many of these Brownian bridges are very close to Brownian motions. Somewhat loosely…
AThe paper gives a few arguments in favour of the use of chain graphs for description of probabilistic conditional independence structures. Every Bayesian network model can be equivalently introduced by means of a factorization formula with…
Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
We consider the graphs whose edges are marked by the integers (weights) from $0$ to $q-1$ (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked in such a way that the weight of every edge is equal to the…
We further investigate properties of the Gaussian free field (GFF) on the metric graph associated to a discrete weighted graph (where the edges of the latter are replaced by continuous line-segments of appropriate length) that has been…
In this study, by establishing an identity for universal Osborn loops, two other identities(of degrees 4 and 6) are deduced from it and they are recognized and recommended for cryptography in a similar spirit in which the cross inverse…
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…
Let $\{X_j\}$ be independent, identically distributed random variables. It is well known that the functional CUSUM statistic and its randomly permuted version both converge weakly to a Brownian bridge if second moments exist. Surprisingly,…