Related papers: The Block Neighborhood
A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular…
Many real-world networks display a natural bipartite structure. It is necessary and important to study the bipartite networks by using the bipartite structure of the data. Here we propose a modification of the clustering coefficient given…
A key topic in network science is the detection of intermediate or meso-scale structures. Community, core-periphery, disassortative and other partitions allow us to understand the organisation and function of large networks. In this work we…
We identify those elements of the homeomorphism group of the circle that can be expressed as a composite of two involutions.
Stochastic block models (SBMs) are often used to find assortative community structures in networks, such that the probability of connections within communities is higher than in between communities. However, classic SBMs are not limited to…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
A concept of neighborhood in complex networks is addressed based on the criterion of the minimal number os steps to reach other vertices. This amounts to, starting from a given network $R_1$, generating a family of networks $R_\ell,…
We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…
Block coordinate descent is an optimization paradigm that iteratively updates one block of variables at a time, making it quite amenable to big data applications due to its scalability and performance. Its convergence behavior has been…
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while keeping the remaining variables constant. While for some…
We formulate the standard real-space renormalization group method in a way which takes into account the correlation between blocks. This is achieved in a dynamical way by means of operators which reflect the influence on a given block of…
There has been a lot of interest in developing algorithms to extract clusters or communities from networks. This work proposes a method, based on blockmodelling, for leveraging communities and other topological features for use in a…
The stochastic block model is able to generate different network partitions, ranging from traditional assortative communities to disassortative structures. Since the degree-corrected stochastic block model does not specify which mixing…
We analyze a distributed information network in which each node has access to the information contained in a limited set of nodes (its neighborhood) at a given time. A collective computation is carried out in which each node calculates a…
We survey the application of a relatively new branch of statistical physics--"community detection"-- to data mining. In particular, we focus on the diagnosis of materials and automated image segmentation. Community detection describes the…
In the presence of heterogeneous data, where randomly rotated objects fall into multiple underlying categories, it is challenging to simultaneously classify them into clusters and synchronize them based on pairwise relations. This gives…
In covering based rough sets, the neighborhood of an element is the intersection of all the covering blocks containing the element. All the neighborhoods form a new covering called a covering of neighborhoods. In the course of studying…
We determine the blocks of the walled Brauer algebra in characteristic zero. These can be described in terms of orbits of the action of a Weyl group of type $A$ on a certain set of weights. In positive characteristic we give a linkage…
Irregular conformal block is an important tool to study a new type of conformal theories, which can be constructed as the colliding limit of the regular conformal block. The irregular conformal block is realized as the $\beta$-deformed…