000845769 000__ 04789cam\a2200529Ii\4500
000845769 001__ 845769
000845769 005__ 20230306145036.0
000845769 006__ m\\\\\o\\d\\\\\\\\
000845769 007__ cr\cn\nnnunnun
000845769 008__ 180828s2018\\\\sz\\\\\\ob\\\\001\0\eng\d
000845769 019__ $$a1050336988
000845769 020__ $$a9783319967462$$q(electronic book)
000845769 020__ $$a3319967460$$q(electronic book)
000845769 020__ $$z9783319967455
000845769 020__ $$z3319967452
000845769 035__ $$aSP(OCoLC)on1050110412
000845769 035__ $$aSP(OCoLC)1050110412$$z(OCoLC)1050336988
000845769 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dGW5XE$$dN$T$$dEBLCP$$dNLE$$dYDX$$dUAB
000845769 049__ $$aISEA
000845769 050_4 $$aHM742
000845769 08204 $$a006.7/54$$223
000845769 1001_ $$aM., Krishnaraj P.,$$d1980-$$eauthor.
000845769 24510 $$aPractical social network analysis with Python /$$cKrishna Raj P.M., Ankith Mohan, K.G. Srinivasa.
000845769 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2018]
000845769 300__ $$a1 online resource.
000845769 336__ $$atext$$btxt$$2rdacontent
000845769 337__ $$acomputer$$bc$$2rdamedia
000845769 338__ $$aonline resource$$bcr$$2rdacarrier
000845769 4901_ $$aComputer communications and networks,$$x1617-7975
000845769 504__ $$aIncludes bibliographical references and index.
000845769 5050_ $$aIntro; Preface; Network; Graph; Organization of the Book; Network Datasets; Contents; List of Figures; List of Tables; 1 Basics of Graph Theory; 1.1 Choice of Representation; 1.1.1 Undirected Graphs; 1.1.2 Directed Graphs; 1.2 Degree of a Vertex; 1.3 Degree Distribution; 1.4 Average Degree of a Graph; 1.5 Complete Graph; 1.6 Regular Graph; 1.7 Bipartite Graph; 1.8 Graph Representation; 1.8.1 Adjacency Matrix; 1.8.2 Edge List; 1.8.3 Adjacency List; 1.9 Edge Attributes; 1.9.1 Unweighted Graph; 1.9.2 Weighted Graph; 1.9.3 Self-looped Graph; 1.9.4 Multigraphs; 1.10 Path; 1.11 Cycle
000845769 5058_ $$a1.12 Path Length1.13 Distance; 1.14 Average Path Length; 1.15 Diameter; 1.16 Connectedness of Graphs; 1.17 Clustering Coefficient; 1.18 Average Clustering Coefficient; Reference; 2 Graph Structure of the Web; 2.1 Algorithms; 2.1.1 Breadth First Search (BFS) Algorithm; 2.1.2 Strongly Connected Components (SCC) Algorithm; 2.1.3 Weakly Connected Components (WCC) Algorithm; 2.2 First Set of Experiments-Degree Distributions; 2.3 Second Set of Experiments-Connected Components; 2.4 Third Set of Experiments-Number of Breadth First Searches; 2.5 Rank Exponent mathcalR; 2.6 Out-Degree Exponent mathcalO
000845769 5058_ $$a2.7 Hop Plot Exponent mathcalH2.8 Eigen Exponent mathcalE; References; 3 Random Graph Models; 3.1 Random Graphs; 3.2 Erdös-Rényi Random Graph Model; 3.2.1 Properties; 3.2.2 Drawbacks of Gn,p; 3.2.3 Advantages of Gn,p; 3.3 Bollobás Configuration Model; 3.4 Permutation Model; 3.5 Random Graphs with Prescribed Degree Sequences; 3.5.1 Switching Algorithm; 3.5.2 Matching Algorithm; 3.5.3 ``Go with the Winners'' Algorithm; 3.5.4 Comparison; References; 4 Small World Phenomena; 4.1 Small World Experiment; 4.2 Columbia Small World Study; 4.3 Small World in Instant Messaging; 4.4 Erdös Number
000845769 5058_ $$a4.5 Bacon Number4.6 Decentralized Search; 4.7 Searchable; 4.8 Other Small World Studies; 4.9 Case Studies; 4.9.1 HP Labs Email Network; 4.9.2 LiveJournal Network; 4.9.3 Human Wayfinding; 4.10 Small World Models; 4.10.1 Watts-Strogatz Model; 4.10.2 Kleinberg Model; 4.10.3 Destination Sampling Model; References; 5 Graph Structure of Facebook; 5.1 HyperANF Algorithm; 5.2 Iterative Fringe Upper Bound (iFUB) Algorithm; 5.3 Spid; 5.4 Degree Distribution; 5.5 Path Length; 5.6 Component Size; 5.7 Clustering Coefficient and Degeneracy; 5.8 Friends-of-Friends; 5.9 Degree Assortativity
000845769 5058_ $$a5.10 Login Correlation5.11 Other Mixing Patterns; 5.11.1 Age; 5.11.2 Gender; 5.11.3 Country of Origin; References; 6 Peer-To-Peer Networks; 6.1 Chord; 6.2 Freenet; Problems; References; 7 Signed Networks; 7.1 Theory of Structural Balance; 7.2 Theory of Status; 7.3 Conflict Between the Theory of Balance and Status; 7.4 Trust in a Network; 7.4.1 Atomic Propagations; 7.4.2 Propagation of Distrust; 7.4.3 Iterative Propagation; 7.4.4 Rounding; 7.5 Perception of User Evaluation; 7.6 Effect of Status and Similarity on User Evaluation; 7.6.1 Effect of Similarity on Evaluation
000845769 506__ $$aAccess limited to authorized users.
000845769 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 29, 2018).
000845769 650_0 $$aOnline social networks.
000845769 650_0 $$aPython (Computer program language)
000845769 7001_ $$aMohan, Ankith,$$eauthor.
000845769 7001_ $$aSrinivasa, K. G.,$$eauthor.
000845769 77608 $$iPrint version: $$z3319967452$$z9783319967455$$w(OCoLC)1042085250
000845769 830_0 $$aComputer communications and networks.
000845769 852__ $$bebk
000845769 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-96746-2$$zOnline Access$$91397441.1
000845769 909CO $$ooai:library.usi.edu:845769$$pGLOBAL_SET
000845769 980__ $$aEBOOK
000845769 980__ $$aBIB
000845769 982__ $$aEbook
000845769 983__ $$aOnline
000845769 994__ $$a92$$bISE