Related papers: The Block Neighborhood
Community detection is the task of clustering objects based on their pairwise relationships. Most of the model-based community detection methods, such as the stochastic block model and its variants, are designed for networks with binary…
This manuscript describes the notions of blocker and interdiction applied to well-known optimization problems. The main interest of these two concepts is the capability to analyze the existence of a combinatorial structure after some…
Motivated by a neuroscience application we study the problem of statistical estimation of a high-dimensional covariance matrix with a block structure. The block model embeds a structural assumption: the population of items (neurons) can be…
In the standard stochastic block model for networks, the probability of a connection between two nodes, often referred to as the edge probability, depends on the unobserved communities each of these nodes belongs to. We consider a flexible…
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…
We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary…
Using equivariant localization formulas we give a formula for conformal blocks at level one on the sphere as suitable polynomials. Using this presentation we give a generating set in the space of conformal blocks at any level if the marked…
This article has two interpenetrating motifs. One is an exposition of some major ideas and techniques behind the use of block matrices, and especially their positivity properties. This is done by focussing on one major problem:…
Community detection involves grouping the nodes in the network and is one of the most-studied tasks in network science. Conventional methods usually require the specification of the number of communities $K$ in the network. This number is…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
Combinatorial curve neighborhoods are somewhat foundational when setting up the quantum Schubert calculus for affine flag manifolds. In the specific case of type $A_1^{(1)}$, you can encode these neighborhoods entirely within the moment…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…
We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary…
We propose a quantitative method to classify cities according to their street pattern. We use the conditional probability distribution of shape factor of blocks with a given area, and define what could constitute the `fingerprint' of a…
Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods…
A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links.…
We consider the problem of recovering the community structure in the stochastic block model. We aim to describe the mutual information between the observed network and the actual community structure as the number of nodes diverges while the…
Reproducible builds are a set of software development practices that establish an independently verifiable path from source code to binary artifacts, helping to detect and mitigate certain classes of supply chain attacks. Although quantum…
We consider the problem of community detection in the Stochastic Block Model with a finite number $K$ of communities of sizes linearly growing with the network size $n$. This model consists in a random graph such that each pair of vertices…