دسترسی نامحدود
برای کاربرانی که ثبت نام کرده اند
برای ارتباط با ما می توانید از طریق شماره موبایل زیر از طریق تماس و پیامک با ما در ارتباط باشید
در صورت عدم پاسخ گویی از طریق پیامک با پشتیبان در ارتباط باشید
برای کاربرانی که ثبت نام کرده اند
درصورت عدم همخوانی توضیحات با کتاب
از ساعت 7 صبح تا 10 شب
ویرایش: نویسندگان: Naoki Masuda (editor), Kwang-Il Goh (editor), Tao Jia (editor), Junichi Yamanoi (editor), Hiroki Sayama (editor) سری: ISBN (شابک) : 3030389642, 9783030389642 ناشر: Springer سال نشر: 2020 تعداد صفحات: 267 زبان: English فرمت فایل : PDF (درصورت درخواست کاربر به PDF، EPUB یا AZW3 تبدیل می شود) حجم فایل: 35 مگابایت
در صورت تبدیل فایل کتاب Proceedings of NetSci-X 2020: Sixth International Winter School and Conference on Network Science (Springer Proceedings in Complexity) به فرمت های PDF، EPUB، AZW3، MOBI و یا DJVU می توانید به پشتیبان اطلاع دهید تا فایل مورد نظر را تبدیل نمایند.
توجه داشته باشید کتاب مجموعه مقالات NetSci-X 2020: ششمین مدرسه بین المللی زمستانی و کنفرانس علوم شبکه (مجموعه مقالات اسپرینگر در پیچیدگی) نسخه زبان اصلی می باشد و کتاب ترجمه شده به فارسی نمی باشد. وبسایت اینترنشنال لایبرری ارائه دهنده کتاب های زبان اصلی می باشد و هیچ گونه کتاب ترجمه شده یا نوشته شده به فارسی را ارائه نمی دهد.
Preface Program Committee Organizing Committee Contents Part I Structure Latent Space Generative Model for Bipartite Networks 1 Introduction 2 Null Models 2.1 Erdős–Rényi 2.2 Preferential Attachment 3 Hyperbolic Geometry 4 Bipartite Generative Model 5 Conclusion References BiMLPA: Community Detection in Bipartite Networks by Multi-Label Propagation 1 Introduction 2 Related Work 2.1 LPA 2.2 Variants of LPA 3 BiMLPA 3.1 Extension to Multi-Labels 3.2 Label Propagation Procedure 3.3 Algorithm 3.4 Complexity Analysis 4 Experiments 4.1 Datasets 4.2 Baselines 4.3 Settings 4.4 Results 5 Conclusion References Connected Graphs with a Given Degree Sequence: Efficient Sampling, Correlations, Community Detection and Robustness 1 Connected Configuration Model and Related Work 2 Efficient Heuristic 3 On the Impact of Being Connected 3.1 Assortativity in Connected Graphs 3.2 Community Detection in Connected Graphs 3.3 Robustness of Connected Graphs 4 Discussion References An Allometric Scaling for the Number of Representative Nodes in Social Networks 1 Introduction 2 Preliminary 3 Model 3.1 Conjecture 1 (Small-World Phenomenon on κ): κlogn 3.2 Conjecture 2: Existence of Pyramid Structure of Representing 3.3 An Allometry on the Size of Representative Nodes 4 Empirical Study 4.1 On the Pyramid Structure of Social Networks 4.2 On the Congressional Representatives 5 Conclusion and Future Work References NeXLink: Node Embedding Framework for Cross-Network Linkages Across Social Networks 1 Introduction 2 Related Work 3 Proposed Approach 3.1 Problem Statement 3.2 NeXLink Framework 4 Data 4.1 Augmented Dataset 4.2 Real-World Dataset 5 Experiments 5.1 Effect of Sparsity and Overlap levels 5.2 Effect of Cross-Network Node Embedding 5.3 Comparison with the Baselines 6 Limitations, Discussions and Future Work References Improved Algorithm for Neuronal Ensemble Inference by Monte Carlo Method 1 Introduction 2 Theory 2.1 Bayesian Inference Model 2.2 Improvement of Inference Algorithm for the Number of Neuronal Ensembles 3 Experiment 3.1 Generative Model for Synthetic Data 3.2 Numerical Validation 3.3 Comparison with the Original Algorithm 4 Discussion and Perspective References Testing for Network and Spatial Autocorrelation 1 Introduction 2 Methods 2.1 Moran\'s I 2.2 New Methods for Categorical Random Variables 2.3 Choosing the Weight Matrix W 3 Simulations 3.1 Testing for Spatial Autocorrelation in Categorical Variables 3.2 Testing for Network Dependence 4 Applications 4.1 Spatial Data 4.2 Network Data 5 Concluding Remarks Appendix 1 Moments of Φ Asymptotic Distribution of Φ Under the Null Appendix 2: Simulation of Categorical Observations Over Network Direct Transmission Simulations References Part II Dynamics Approximate Identification of the Optimal Epidemic Source in Complex Networks 1 Introduction 2 Source Detection in SI Epidemics 2.1 Time and Rate Invariant Analysis 2.2 Statistical Inference 3 Exact Likelihood Computation 4 Approximations 5 Simulations Appendix 1: Multi-Source Extension Appendix 2: Proofs Proof of Proposition 1 Proof of Proposition 2 References Maxwell\'s Demon: Controlling Entropy via Discrete Ricci Flow over Networks 1 Introduction 2 Preliminaries: Entropy and Curvature 3 Proposed Framework 3.1 Open-Loop View: Discrete Ollivier-Ricci Flow 3.2 Control Law Construction and Existence 3.3 ``Non-Perfect Demonic\'\' Input 4 Results 5 Conclusions and Future Work References Two Dimensional Opinion Dynamics of Real Opinionand Official Stance 1 Introduction 2 Theory 2.1 One Dimensional Opinion Dynamics Theory 2.2 Multi-Dimensional Opinion Dynamics Theory 2.3 Two Dimensional Opinion Dynamics Theory 2.4 Discussion of Two-Dimensional Opinion Dynamics Theory 3 Results and Discussion 3.1 Real Opinion and Official Stance 3.2 Romeo and Juliet 3.3 Conflict of Two Countries 3.4 Discussion 4 Conclusion References On the Fundamental Equation of User Dynamics and the Structure of Online Social Networks 1 Introduction 2 Oscillation Model on Networks 3 Fundamental Equation of the Oscillation Model on Networks 4 Fundamental Equation and Quantum Theory 5 Problems with the Fundamental Equation of the Oscillation Model 6 Fundamental Equation Reflecting Social Network Structure 7 Conclusions References Beyond Social Fragmentation: Coexistence of Cultural Diversityand Structural Connectivity Is Possible with Social ConstituentDiversity 1 Introduction 2 Model 3 Experiments 4 Results 5 Conclusions References Part III Resilience and Robustness Complex Networks Antifragility under Sustained Edge Attack-Repair Mechanisms 1 Introduction 2 Methods 2.1 Edge Attacks 2.2 Edge Repairs 2.3 Network Topologies 2.4 Quantitative Characterization of Antifragility 2.5 Analytical Estimation of the Time to Network Dismantling 2.6 Cost-Optimality Considerations 3 Results 3.1 Paired Versus Non-paired Repairs on Synthetic Networks 3.2 Antifragility in Complex Synthetic and Real-World Networks 3.3 Antifragility Repair Costs 4 Conclusion References How to Collect Private Signals in Information Cascade: An Empirical Study 1 Introduction 2 Information Cascade Experiment and Bayesian Inference Formula 3 Bayesian Estimation of Private Signal 4 Choice Behaviors: Result I 5 Estimation of q: Results II 6 Conclusions References Space Geometry Effect over the Internet as a Physical-Logical Interdependent Network 1 Introduction 2 Related Work 3 Internet Modeling 3.1 Interdependencies Model 3.2 Logical Network Model 3.3 Physical Network Model 4 Results 4.1 Country Shape Effect 4.2 Effects of the Number of Edges 4.3 Adding Edges to the MRN-Based System 5 Discussion 6 Conclusion References Part IV Applications The Power of Communities: A Text Classification Model with Automated Labeling Process Using NetworkCommunity Detection 1 Introduction 2 Method 2.1 Data, Preprocessing and Representation 2.2 Sentence Network Construction 2.3 Network Community Detection and Classification Models 3 Result 4 Discussions and Conclusion References Effective Implementation of Energy Aware Polarization Diversity for IoT Networks Using Eigenvector Centrality 1 Introduction 2 Related Works 3 System Model 4 Distributed Eigenvector Centrality 4.1 Centrality Based Diversity Scheme 5 Performance Evaluation 5.1 Simulation Model 5.2 Simulation Results 6 Conclusion References Using Network Science to Quantify Economic Disruptions in Regional Input-Output Networks 1 Introduction 2 Background and Data 2.1 Level of Spatial and Industry Aggregation 2.2 Economic Network Setup 3 Method 3.1 Network Analysis 3.2 Multiplier Analysis 3.3 Comparing Network Centralities with IO and Disruption Multipliers 3.4 Comparing Spatial Aggregation 4 Results 4.1 Network Centrality Measures and Their Correlations 4.2 Comparing Multiplier and Centrality Measures 4.3 Impact of Spatial Aggregation 5 Discussion References Correction to: An Allometric Scaling for the Number of Representative Nodes in Social Networks