Results 11 to 20 of about 1,009,188 (24)

Human migration and the motion of substance in a channel of a network [PDF]

arXiv, 2017
We study the motion of a substance in a channel of a network that consists of chain of nodes of a network (the nodes can be considered as boxes) and edges that connect the nodes and form the way for motion of the substance. The nodes of the channel can have different "leakage", i.e., some amount of the substance can leave the channel at a node and the ...
arxiv  

HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor Networks [PDF]

arXiv, 2010
In many hybrid wireless sensor networks' applications, sensor nodes are deployed in hostile environments where trusted and un-trusted nodes co-exist. In anchor-based hybrid networks, it becomes important to allow trusted nodes to gain full access to the location information transmitted in beacon frames while, at the same time, prevent un-trusted nodes ...
arxiv  

Quantum properties in the four-node network [PDF]

arXiv, 2022
There are different preparable quantum states in different network structures. The four nodes as a whole has two situations: one is the four nodes in a plane, the other is the four nodes in the space. In this paper, we obtain some properties of the quantum states that can be prepared in four-node network structures.
arxiv  

Autoregressive Cascades on Random Networks [PDF]

arXiv, 2014
This paper considers a model for cascades on random networks in which the cascade propagation at any node depends on the load at the failed neighbor, the degree of the neighbor as well as the load at that node. Each node in the network bears an initial load that is below the capacity of the node. The trigger for the cascade emanates at a single node or
arxiv  

A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks [PDF]

, 2012
A trust network is a social network in which edges represent the trust relationship between two nodes in the network. In a trust network, a fundamental question is how to assess and compute the bias and prestige of the nodes, where the bias of a node measures the trustworthiness of a node and the prestige of a node measures the importance of the node ...
arxiv   +1 more source

Solving DWF Dirac Equation Using Multisplitting Preconditioned Conjugate Gradient [PDF]

arXiv, 2018
We show that using the multisplitting algorithm as a preconditioner for conjugate gradient inversion of the domain wall Dirac operator could effectively reduce the inter- node communication cost, at the expense of performing more on-node floating point operations.
arxiv   +1 more source

Local structure entropy of complex networks [PDF]

arXiv, 2014
Identifying influential nodes in the complex networks is of theoretical and practical significance. There are many methods are proposed to identify the influential nodes in the complex networks. In this paper, a local structure entropy which is based on the degree centrality and the statistical mechanics is proposed to identifying the influential nodes
arxiv  

BER Analysis of RIS Assisted Multicast Communications with Network Coding [PDF]

arXiv, 2020
In this paper, Recofigurable Intelligent Surface (RIS) assisted dual-hop multicast wireless communication network is proposed with two source nodes and two destination nodes. RIS boosts received signal strength through an intelligent software-controlled array of discrete phase-shifting metamaterials. The multicast communication from the source nodes is
arxiv  

Community Structure aware Embedding of Nodes in a Network [PDF]

arXiv, 2020
Detecting communities or the modular structure of real-life networks (e.g. a social network or a product purchase network) is an important task because the way a network functions is often determined by its communities. Traditional approaches to community detection involve modularity-based algorithms, which generally speaking, construct partitions ...
arxiv  

Centrality Measures in Networks [PDF]

arXiv, 2016
We show that prominent centrality measures in network analysis are all based on additively separable and linear treatments of statistics that capture a node's position in the network. This enables us to provide a taxonomy of centrality measures that distills them to varying on two dimensions: (i) which information they make use of about nodes ...
arxiv