Related papers: On weighted two-mode network projections
By recasting metrical geometry in a purely algebraic setting, both Euclidean and non-Euclidean geometries can be studied over a general field with an arbitrary quadratic form. Both an affine and a projective version of this new theory are…
In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, but less attention has been paid to both…
Bipartite user-object networks are becoming increasingly popular in representing user interaction data in a web or e-commerce environment. They have certain characteristics and challenges that differentiates them from other bipartite…
Gutzwiller projection allows a construction of an assortment of variational wave functions for strongly correlated systems. For quantum spin S=1/2 models, Gutzwiller-projected wave functions have resonating-valence-bond structure and may…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
We describe when two multiprojective bundles (fibre products of projective bundles over the same base) over projective spaces are isomorphic as abstract varieties. We also describe when two relative symmetric powers of projective bundles…
In real networks complex topological features are often associated with a diversity of interactions as measured by the weights of the links. Moreover, spatial constraints may as well play an important role, resulting in a complex interplay…
A general class of unidirectional transforms is presented that can be computed in a distributed manner along an arbitrary routing tree. Additionally, we provide a set of conditions under which these transforms are invertible. These…
We consider a general fibre of given length in a generic projection of a va- riety. Under the assumption that the fibre is of local embedding dimension 2 or less, an assumption which can be checked in many cases, we prove that the fibre is…
The notion of a core is generalized to multiway networks. To determine the multiway cores, we adapted already-known algorithms for determining the generalized cores in one-mode and two-mode networks. A new node property, node diversity has…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane $\mathbb{P}^2$. They appear in the study of resonance and characteristic varieties of complex hyperplane arrangement complements…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
In this paper, we present the outer product decomposition of a product of compatible linked networks. It provides a foundation for the fractional approach in network analysis. We discuss the standard and Newman's normalization of networks.…
Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the structure of a network is a classic procedure used to…
We introduce a theory of multigraded Cayley-Chow forms associated to subvarieties of products of projective spaces. Two new phenomena arise: first, the construction turns out to require certain inequalities on the dimensions of projections;…
Graded bundles are a particularly nice class of graded manifolds and represent a natural generalisation of vector bundles. By exploiting the formalism of supermanifolds to describe Lie algebroids we define the notion of a weighted…
The configuration model is one of the most successful models for generating uncorrelated random networks. We analyze its behavior when the expected degree sequence follows a power law with exponent smaller than two. In this situation, the…
A weighted directed network (WDN) is a directed graph in which each edge is associated to a unique value called weight. These networks are very suitable for modeling real-world social networks in which there is an assessment of one vertex…
In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are…
In this dissertation we study basic local differential geometry, projective differential geometry, and prolongations of overdetermined geometric partial differential equations. It is simple to prolong an n-th order linear ordinary…