相关论文: A theory on power in networks

Most people simultaneously belong to several distinct social networks, in which their relations can be different. They have opinions about certain topics, which they share and spread on these networks, and are influenced by the opinions of…

People choose friendships with people similar to themselves, i.e. they sort by resemblence. Economic studies have shown when sorting is optimal and constitute an equilibrium, however, this presumes lack of beneficial spillovers. We…

The association between tie strength and social structure is a fundamental topic in the social sciences. We study this association by analyzing tie strength in higher-order networks, an increasingly relevant model which can encode group…

In communication networks theory the concepts of networkness and network surplus have recently been defined. Together with transmission and betweenness centrality, they were based on the assumption of equal communication between vertices.…

We consider the eigenvalue problem $Ax = \lambda x$ where $A \in \mathbb{R}^{n \times n}$ and the eigenvalue is also real $\lambda \in \mathbb{R}$. If we are given $A$, $\lambda$ and, additionally, the absolute value of the entries of $x$…

We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…

Critical nodes or "middlemen" have an essential place in both social and economic networks when considering the flow of information and trade. This paper extends the concept of critical nodes to directed networks. We identify strong and…

A generic property of biological, social and economical networks is their ability to evolve in time, creating and suppressing interactions. We approach this issue within the framework of an adaptive network of agents playing a Prisoner's…

Humans cluster in social groups where they discuss their shared past, problems, and potential solutions; they learn collectively when they repeat activities; they establish social norms; they synchronize when they sing or dance together;…

This paper develops an active sensing method to estimate the relative weight (or trust) agents place on their neighbors' information in a social network. The model used for the regression is based on the steady state equation in the linear…

Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized…

In this paper, the well-known forwarder's dilemma is generalized by accounting for the presence of link quality fluctuations; the forwarder's dilemma is a four-node interaction model with two source nodes and two destination nodes. It is…

We introduce and analyze a novel family of power indices tailored for sharing networks in technological markets, where firms operate competitively within, but not across, distinct industrial sectors. In these settings, inter-firm…

A lot of natural language processing problems need to encode the text sequence as a fix-length vector, which usually involves aggregation process of combining the representations of all the words, such as pooling or self-attention. However,…

Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not…

The Eigendecomposition of quadratic forms (symmetric matrices) guaranteed by the spectral theorem is a foundational result in applied mathematics. Motivated by a shared structure found in inferential problems of recent interest---namely…

This work deals with the issue of assessing the influence of a node in the entire network and in the subnetwork to which it belongs as well, adapting the classical idea of vertex centrality. We provide a general definition of relative…

Network autocorrelation models have been widely used for decades to model the joint distribution of the attributes of a network's actors. This class of models can estimate both the effect of individual characteristics as well as the network…

Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…

The purpose of the research is to find a centrality measure that can be used in place of PageRank and to find out the conditions where we can use it in place of PageRank. After analysis and comparison of graphs with a large number of nodes…