scholarly journals Evaluating structural edge importance in temporal networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Isobel E. Seabrook ◽  
Paolo Barucca ◽  
Fabio Caccioli

AbstractTo monitor risk in temporal financial networks, we need to understand how individual behaviours affect the global evolution of networks. Here we define a structural importance metric—which we denote as $l_{e}$ l e —for the edges of a network. The metric is based on perturbing the adjacency matrix and observing the resultant change in its largest eigenvalues. We then propose a model of network evolution where this metric controls the probabilities of subsequent edge changes. We show using synthetic data how the parameters of the model are related to the capability of predicting whether an edge will change from its value of $l_{e}$ l e . We then estimate the model parameters associated with five real financial and social networks, and we study their predictability. These methods have applications in financial regulation whereby it is important to understand how individual changes to financial networks will impact their global behaviour. It also provides fundamental insights into spectral predictability in networks, and it demonstrates how spectral perturbations can be a useful tool in understanding the interplay between micro and macro features of networks.

Author(s):  
Christopher J. Arthurs ◽  
Nan Xiao ◽  
Philippe Moireau ◽  
Tobias Schaeffter ◽  
C. Alberto Figueroa

AbstractA major challenge in constructing three dimensional patient specific hemodynamic models is the calibration of model parameters to match patient data on flow, pressure, wall motion, etc. acquired in the clinic. Current workflows are manual and time-consuming. This work presents a flexible computational framework for model parameter estimation in cardiovascular flows that relies on the following fundamental contributions. (i) A Reduced-Order Unscented Kalman Filter (ROUKF) model for data assimilation for wall material and simple lumped parameter network (LPN) boundary condition model parameters. (ii) A constrained least squares augmentation (ROUKF-CLS) for more complex LPNs. (iii) A “Netlist” implementation, supporting easy filtering of parameters in such complex LPNs. The ROUKF algorithm is demonstrated using non-invasive patient-specific data on anatomy, flow and pressure from a healthy volunteer. The ROUKF-CLS algorithm is demonstrated using synthetic data on a coronary LPN. The methods described in this paper have been implemented as part of the CRIMSON hemodynamics software package.


2014 ◽  
Vol 114 (2) ◽  
pp. 292-320 ◽  
Author(s):  
Virginia Fernández-Pérez ◽  
Patricia Esther Alonso-Galicia ◽  
María del Mar Fuentes-Fuentes ◽  
Lazaro Rodriguez-Ariza

Purpose – This study analyses the role of social networks and their effects on academics' entrepreneurial intentions (AEI), from an academic cognitive perspective. Specifically, the paper investigates how business (distinguishing between industrial and financial links) and personal social networks, through opportunity-relevant information and support, could influence academics' intentions to start a business venture on the basis of their research knowledge. The paper examines the mediator roles of entrepreneurial attitudes (EA) and self-efficacy on opportunity recognition (SOR) as important psychological variables for academics. In the same context, the paper examines the mediator role of gender. Design/methodology/approach – The hypotheses were tested using structural equation modelling analysis, on a sample population of 500 Spanish academics engaged in commercially oriented fields of research. Findings – The results obtained highlight the positive roles played by business (industrial and financial) networks, both directly in promoting AEI, and indirectly via EA and SOR. The paper finds that male and female academics differ in their perceptions of support from business and financial networks and in their use of these resources in business start-up. Practical implications – An understanding of these issues offers opportunities to shape government interventions to assist academic entrepreneurs embarking on a business venture, or those already active in this respect, increasing their effectiveness in building, utilizing and enhancing the quality of networking activities. Originality/value – The paper explores business networking for academics as a factor promoting entrepreneurship. Furthermore, the paper considers an under-researched area that of female entrepreneurship in what is traditionally considered a male-dominated activity.


2019 ◽  
Vol 7 (1) ◽  
pp. 13-27
Author(s):  
Safaa K. Kadhem ◽  
Sadeq A. Kadhim

"This paper aims at the modeling the crashes count in Al Muthanna governance using finite mixture model. We use one of the most common MCMC method which is called the Gibbs sampler to implement the Bayesian inference for estimating the model parameters. We perform a simulation study, based on synthetic data, to check the ability of the sampler to find the best estimates of the model. We use the two well-known criteria, which are the AIC and BIC, to determine the best model fitted to the data. Finally, we apply our sampler to model the crashes count in Al Muthanna governance.


Author(s):  
Yingzi Jin ◽  
Yutaka Matsuo

Previous chapters focused on the models of static networks, which consider a relational network at a given point in time. However, real-world social networks are dynamic in nature; for example, friends of friends become friends. Social network research has, in recent years, paid increasing attention to dynamic and longitudinal network analysis in order to understand network evolution, belief formation, friendship formation, and so on. This chapter focuses mainly on the dynamics and evolutional patterns of social networks. The chapter introduces real-world applications and reviews major theories and models of dynamic network mining.


2020 ◽  
Vol 32 (3) ◽  
pp. 714-729
Author(s):  
Fan Zhou ◽  
Kunpeng Zhang ◽  
Shuying Xie ◽  
Xucheng Luo

Cross-site account correlation correlates users who have multiple accounts but the same identity across online social networks (OSNs). Being able to identify cross-site users is important for a variety of applications in social networks, security, and electronic commerce, such as social link prediction and cross-domain recommendation. Because of either heterogeneous characteristics of platforms or some unobserved but intrinsic individual factors, the same individuals are likely to behave differently across OSNs, which accordingly causes many challenges for correlating accounts. Traditionally, account correlation is measured by analyzing user-generated content, such as writing style, rules of naming user accounts, or some existing metadata (e.g., account profile, account historical activities). Accounts can be correlated by de-anonymizing user behaviors, which is sometimes infeasible since such data are not often available. In this work, we propose a method, called ACCount eMbedding (ACCM), to go beyond text data and leverage semantics of network structures, a possibility that has not been well explored so far. ACCM aims to correlate accounts with high accuracy by exploiting the semantic information among accounts through random walks. It models and understands latent representations of accounts using an embedding framework similar to sequences of words in natural language models. It also learns a transformation matrix to project node representations into a common dimensional space for comparison. With evaluations on both real-world and synthetic data sets, we empirically demonstrate that ACCM provides performance improvement compared with several state-of-the-art baselines in correlating user accounts between OSNs.


2020 ◽  
Vol 6 (19) ◽  
pp. eaax7310 ◽  
Author(s):  
Aili Asikainen ◽  
Gerardo Iñiguez ◽  
Javier Ureña-Carrión ◽  
Kimmo Kaski ◽  
Mikko Kivelä

Social network structure has often been attributed to two network evolution mechanisms—triadic closure and choice homophily—which are commonly considered independently or with static models. However, empirical studies suggest that their dynamic interplay generates the observed homophily of real-world social networks. By combining these mechanisms in a dynamic model, we confirm the longheld hypothesis that choice homophily and triadic closure cause induced homophily. We estimate how much observed homophily in friendship and communication networks is amplified due to triadic closure. We find that cumulative effects of homophily amplification can also lead to the widely documented core-periphery structure of networks, and to memory of homophilic constraints (equivalent to hysteresis in physics). The model shows that even small individual bias may prompt network-level changes such as segregation or core group dominance. Our results highlight that individual-level mechanisms should not be analyzed separately without considering the dynamics of society as a whole.


Climate ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 4 ◽  
Author(s):  
Md Masud Hasan ◽  
Barry F. W. Croke ◽  
Fazlul Karim

Probabilistic models are useful tools in understanding rainfall characteristics, generating synthetic data and predicting future events. This study describes the results from an analysis on comparing the probabilistic nature of daily, monthly and seasonal rainfall totals using data from 1327 rainfall stations across Australia. The main objective of this research is to develop a relationship between parameters obtained from models fitted to daily, monthly and seasonal rainfall totals. The study also examined the possibility of estimating the parameters for daily data using fitted parameters to monthly rainfall. Three distributions within the Exponential Dispersion Model (EDM) family (Normal, Gamma and Poisson-Gamma) were found to be optimal for modelling the daily, monthly and seasonal rainfall total. Within the EDM family, Poisson-Gamma distributions were found optimal in most cases, whereas the normal distribution was rarely optimal except for the stations from the wet region. Results showed large differences between regional and seasonal ϕ-index values (dispersion parameter), indicating the necessity of fitting separate models for each season. However, strong correlations were found between the parameters of combined data and those derived from individual seasons (0.70–0.81). This indicates the possibility of estimating parameters of individual season from the parameters of combined data. Such relationship has also been noticed for the parameters obtained through monthly and daily models. Findings of this research could be useful in understanding the probabilistic features of daily, monthly and seasonal rainfall and generating daily rainfall from monthly data for rainfall stations elsewhere.


Author(s):  
Gordon Burtch ◽  
Diwakar Gupta ◽  
Paola Martin

Problem definition: Crowdfunding, a relatively new approach for raising capital for early-stage ventures, has grown by leaps and bounds in the past few years. Entrepreneurs launch a campaign on a web platform and solicit contributions from many potential backers. A primary way that entrepreneurs affect fundraising is by leveraging their social networks to drive traffic to their campaign. We address the following question: When should an entrepreneur send out referral links to impel traffic to the campaign web page? Academic/practical relevance: Prior capital accumulation serves as social proof of the project’s “quality,” which can result in herding. However, prior capital accumulation can also lead to crowding out and bystander effects. Entrepreneurs’ social networks strongly affect their chances of success, but they often do not know when to solicit contacts’ involvement. We investigate this question via a combination of empirical and analytical methods, providing guidance for platform owners and entrepreneurs. Methodology: The social proof/herding mechanism leads to a convex-shaped effect of current accumulation on future contributions, the crowding out scenario leads to a concave-shaped effect, and the initial dominance of herding giving way to the later dominance of crowding out leads to a sigmoidal effect (S-shaped curve). We use a Markov decision process model to derive three alternative optimal referral policies, which we fit to proprietary data from a large crowdfunding platform. We explore heterogeneity in relative model fit across different subsamples of our data, demonstrating that our conclusion is stable over a range of scenarios. Results: Using mathematical models, we identify optimal referral strategies under the concave, convex, and S-curve assumptions. Estimating these models on the proprietary data, we show that the S-curve model exhibits the best fit. Based on estimated model parameters, our simulations show that a nonoptimal (e.g., myopic) expenditure of referrals can lead to a substantially smaller accumulation of funds. Managerial implications: The results of this paper help inform both platform owners and entrepreneurs. Platform owners can perform this sort of analysis to provide guidance to entrepreneurs about referral strategy. The entrepreneurs, in turn, learn that in an environment similar to that represented in our data, they will benefit from concentrating their referrals earlier in the fundraising process, while retaining some portion for the final stages of fundraising. The mix of this early versus late referral allocation within the campaign duration may vary depending on the entrepreneurs’ social capital and referral cost.


2016 ◽  
Vol 43 (3) ◽  
pp. 342-355 ◽  
Author(s):  
Liyuan Sun ◽  
Yadong Zhou ◽  
Xiaohong Guan

Understanding information propagation in online social networks is important in many practical applications and is of great interest to many researchers. The challenge with the existing propagation models lies in the requirement of complete network structure, topic-dependent model parameters and topic isolated spread assumption, etc. In this paper, we study the characteristics of multi-topic information propagation based on the data collected from Sina Weibo, one of the most popular microblogging services in China. We find that the daily total amount of user resources is finite and users’ attention transfers from one topic to another. This shows evidence on the competitions between multiple dynamical topics. According to these empirical observations, we develop a competition-based multi-topic information propagation model without social network structure. This model is built based on general mechanisms of resource competitions, i.e. attracting and distracting users’ attention, and considers the interactions of multiple topics. Simulation results show that the model can effectively produce topics with temporal popularity similar to the real data. The impact of model parameters is also analysed. It is found that topic arrival rate reflects the strength of competitions, and topic fitness is significant in modelling the small scale topic propagation.


2009 ◽  
Vol 48 (2) ◽  
pp. 317-329 ◽  
Author(s):  
Lance O’Steen ◽  
David Werth

Abstract It is shown that a simple evolutionary algorithm can optimize a set of mesoscale atmospheric model parameters with respect to agreement between the mesoscale simulation and a limited set of synthetic observations. This is illustrated using the Regional Atmospheric Modeling System (RAMS). A set of 23 RAMS parameters is optimized by minimizing a cost function based on the root-mean-square (rms) error between the RAMS simulation and synthetic data (observations derived from a separate RAMS simulation). It is found that the optimization can be done with relatively modest computer resources; therefore, operational implementation is possible. The overall number of simulations needed to obtain a specific reduction of the cost function is found to depend strongly on the procedure used to perturb the “child” parameters relative to their “parents” within the evolutionary algorithm. In addition, the choice of meteorological variables that are included in the rms error and their relative weighting are also found to be important factors in the optimization.


Sign in / Sign up

Export Citation Format

Share Document