scholarly journals Generalized Regularity and the Symmetry of Branches of ''Botanological'' Networks

KoG ◽  
2021 ◽  
pp. 53-63
Author(s):  
Anastasios N. Zachos
Keyword(s):  
Weighted Network ◽  
Weighted Networks ◽  
Steiner Points ◽  
Convex Quadrilateral ◽  
Vertical Evolution ◽  
Regular Convex ◽  
The Creation ◽  
Dynamic Plasticity

We derive the generalized regularity of convex quadrilaterals in R^2, which gives a new evolutionary class of convex quadrilaterals that we call generalized regular quadrilaterals in R^2. The property of generalized regularity states that the Simpson line defined by the two Steiner points passes through the corresponding Fermat-Torricelli point of the same convex quadrilateral. We prove that a class of generalized regular convex quadrilaterals consists of convex quadrilaterals, such that their two opposite sides are parallel. We solve the problem of vertical evolution of a ''botanological'' thumb (a two way communication weighted network) w.r to a boundary rectangle in R^2 having two roots,two branches and without having a main branch, by applying the property of generalized regularity of weighted rectangles. We show that the two branches have equal weights and the two roots have equal weights, if the thumb inherits a symmetry w.r to the midperpendicular line of the two opposite sides of the rectangle, which is perpendicular to the ground (equal branches and equal roots). The geometric, rotational and dynamic plasticity of weighted networks for boundary generalized regular tetrahedra and weighted regular tetrahedra lead to the creation of ''botanological'' thumbs and ''botanological'' networks (with a main branch) having symmetrical branches

scholarly journals GOSSIP ON WEIGHTED NETWORKS

2012 ◽  
Vol 15 (supp01) ◽  
pp. 1250061 ◽  
Author(s):  
MURSEL TASGIN ◽  
HALUK O. BINGOL
Keyword(s):  
Complex Networks ◽  
Weight Distribution ◽  
Human Interaction ◽  
Interaction Networks ◽  
Weighted Network ◽  
Weighted Networks ◽  
Human Interactions ◽  
Spreading Model ◽  
Good Parameter ◽  
Weighted Complex Networks

In this work, we analyze gossip spreading on weighted networks. We try to define a new metric to classify weighted complex networks using our model. The model proposed here is based on the gossip spreading model introduced by Lind et al. on unweighted networks. The new metric is based on gossip spreading activity in the network, which is correlated with both topology and relative edge weights in the network. The model gives more insight about the weight distribution and correlation of topology with edge weights in a network. It also measures how suitable a weighted network is for gossip spreading. We analyze gossip spreading on real weighted networks of human interactions. Six co-occurrence and seven social pattern networks are investigated. Gossip propagation is found to be a good parameter to distinguish co-occurrence and social pattern networks. As a comparison some miscellaneous networks of comparable sizes and computer generated networks based on ER, BA and WS models are also investigated. They are found to be quite different from the human interaction networks.

Application and Research of Weighted Network Node Load Evaluation Method Based on Network Contribution Degree

2014 ◽  
Vol 926-930 ◽  
pp. 1874-1877
Author(s):  
Yun Peng Zhang
Keyword(s):  
Evaluation Method ◽  
Load Flow ◽  
Network Node ◽  
Weighted Network ◽  
Weighted Networks ◽  
Node Importance ◽  
Critical Nodes ◽  
The One ◽  
Load Evaluation

At present, most of research on node importance evaluation is concentrated on static un-weighted network. For weighted networks, this paper presented a new evalution method of node importance based on load flow in the node-weighted network, and it was based on the contribution of the nodes for the whole network in the view of microscopic and macroscopic. The most important node was the one which was determined by the outputing load, inputing load and crossing load between the different nodes. The improved evaluation method could help exactly to find some critical nodes which ware sensitive to the efficiency of networks. Final, example verifies its efficiency and feasibility.

scholarly journals Naming Game on Adaptive Weighted Networks

2012 ◽  
Vol 18 (3) ◽  
pp. 311-323 ◽  
Author(s):  
Dorota Lipowska ◽  
Adam Lipowski
Keyword(s):  
Success Rate ◽  
Complete Graph ◽  
Human Population ◽  
Weighted Network ◽  
Naming Game ◽  
Dominant Language ◽  
Weighted Networks

We examine a naming game on an adaptive weighted network. A weight of connection for a given pair of agents depends on their communication success rate and determines the probability with which the agents communicate. In some cases, depending on the parameters of the model, the preference toward successfully communicating agents is essentially negligible and the model behaves similarly to the naming game on a complete graph. In particular, it quickly reaches a single-language state, albeit some details of the dynamics are different from the complete-graph version. In some other cases, the preference toward successfully communicating agents becomes much more important and the model gets trapped in a multi-language regime. In this case gradual coarsening and extinction of languages lead to the emergence of a dominant language, albeit with some other languages still present. A comparison of distribution of languages in our model and in the human population is discussed.

A WEIGHTED NETWORK EVOLUTION WITH TRAFFIC FLOW UNDER PREFERENTIAL ATTACHMENT

2013 ◽  
Vol 24 (04) ◽  
pp. 1350020 ◽  
Author(s):  
MEIFENG DAI ◽  
RONGRONG LU
Keyword(s):  
Traffic Flow ◽  
Network Model ◽  
Traditional Method ◽  
Preferential Attachment ◽  
Transportation System ◽  
Network Evolution ◽  
Random Component ◽  
Weighted Network ◽  
Scale Free ◽  
Weighted Networks

With more attentions drawn to transportation, we find that it is available to analyze transportation system by using weighted networks. Distinguishing from traditional method, we introduce a dynamic weighted network model with evolutional size and weight. Additionally, the expected strength allocation vector of the model consists of a deterministic component reflecting preferential attachment and a random component, which can characterize the realistic network better. In this paper, we obtain the degree and strength distributions of the weighted network and we conclude that the network has scale-free characteristics.

scholarly journals Characterizing dissimilarity of weighted networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yuanxiang Jiang ◽  
Meng Li ◽  
Ying Fan ◽  
Zengru Di
Keyword(s):  
Complex Network ◽  
Network Structure ◽  
Real World ◽  
Basic Problem ◽  
Experimental Results ◽  
Weighted Network ◽  
Weighted Networks ◽  
Comprehensive Information ◽  
Complementary Graph

AbstractMeasuring the dissimilarities between networks is a basic problem and wildly used in many fields. Based on method of the D-measure which is suggested for unweighted networks, we propose a quantitative dissimilarity metric of weighted network (WD-metric). Crucially, we construct a distance probability matrix of weighted network, which can capture the comprehensive information of weighted network. Moreover, we define the complementary graph and alpha centrality of weighted network. Correspondingly, several synthetic and real-world networks are used to verify the effectiveness of the WD-metric. Experimental results show that WD-metric can effectively capture the influence of weight on the network structure and quantitatively measure the dissimilarity of weighted networks. It can also be used as a criterion for backbone extraction algorithms of complex network.

scholarly journals Optimal Transport on Weighted Networks for Different Node Delivery Capability Schemes

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Fei Shao
Keyword(s):  
Real World ◽  
Optimal Transport ◽  
Node Degree ◽  
Weighted Network ◽  
Weighted Networks ◽  
Traffic Capacity

Many real networks can be best described by weighted networks with a diversity of interactions between nodes measured by the weights of the edges. It is of great importance to improve the overall capacity of these real-world networks. In this paper, the traffic capacity of weighted network is investigated based on three different node delivery capability schemes: the delivery capacity of each node is constant in the first scheme while in the second and third schemes it is proportional to its node degree and node strength. It is shown by simulations that the network transfer capacity depends strongly on the tunable parameter. And different tunable parameter is suitable for different node delivery capability.

The role of affect in feelings of obligation

2020 ◽  
Vol 43 ◽  
Author(s):  
Stefen Beeler-Duden ◽  
Meltem Yucel ◽  
Amrisha Vaish
Keyword(s):  
Positive Emotions ◽  
The Creation ◽  
Sense Of Obligation

Abstract Tomasello offers a compelling account of the emergence of humans’ sense of obligation. We suggest that more needs to be said about the role of affect in the creation of obligations. We also argue that positive emotions such as gratitude evolved to encourage individuals to fulfill cooperative obligations without the negative quality that Tomasello proposes is inherent in obligations.

Haydn: The Creation

1991 ◽  
Author(s):  
Nicholas Temperley
Keyword(s):  
The Creation
Sign in / Sign up

Export Citation Format

Share Document