‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
FREE Two-Day Shipping for Students. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
3 of 3 people found the following review helpful:
4.0 out of 5 stars
Great book, as long as you avoid the 1st printing,
By
This review is from: Network Analysis: Methodological Foundations (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) (Paperback)
The book gives thorough and up-to-date coverage of network analysis methods, and is the best book I have found in that regard. But the first printing is unreadable due to typos, eg a computer glitch replaced all "fi"'s with a wingding symbol! A typo in every line, I can't see how Springer released it in this form. But the typos are removed in the 2nd printing. So new copies of the book are OK, but beware of used copies.
3 of 3 people found the following review helpful:
5.0 out of 5 stars
Great book!,
By
Amazon Verified Purchase(What's this?)
This review is from: Network Analysis: Methodological Foundations (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) (Paperback)
Generally, edited books are not good. But, this one is different as the editors
did a good job in organizing the topic in such way that you will not realize that different chapters are written by different authors. A great book for data mining students who are interested in social networks.
2 of 2 people found the following review helpful:
1.0 out of 5 stars
disapointing edition,
This review is from: Network Analysis: Methodological Foundations (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) (Paperback)
The book is well organized and discusses most basic topics about networks. However, I was really disappointed with the edition. How is it possible that equations are unreadable, most symbols missing and some words incomplete or combining letters and symbols. It is impossible to read two lines without a typing error or a missing "something". No matter how hard you try, you will not be able to enjoy or to follow the text. I cannot believe Springer allows this. I was very frustrated and I DO NOT recommend this book to anyone, unless of course, you want to waste your money.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
regular role assignments, vertex centrality, centrality indices, feedback centralities, relative regular equivalence, feedback centrality, conditional connectivity, coarsest stable refinement, web centralities, vertex centralities, adjacency spectrum, maximal regular equivalence, strong structural equivalence, preferential attachment model, circular partition, unit capacity networks, densest subgraph, closeness centrality, betweenness centrality, hop plot, centrality index, polynomial total time, distinct shortest paths, reliability polynomial, regular equivalences Key Phrases - Capitalized Phrases (CAPs): (learn more)
Springer-Verlag Berlin Heidelberg, Menger's Theorem, Sketch of Proof, Linearized Chord Diagram, Hakimi Input, Katharina Anna Lehmann, Las Vegas, Year Author New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
regular role assignments, vertex centrality, centrality indices, feedback centralities, relative regular equivalence, feedback centrality, conditional connectivity, coarsest stable refinement, web centralities, vertex centralities, adjacency spectrum, maximal regular equivalence, strong structural equivalence, preferential attachment model, circular partition, unit capacity networks, densest subgraph, closeness centrality, betweenness centrality, hop plot, centrality index, polynomial total time, distinct shortest paths, reliability polynomial, regular equivalences Key Phrases - Capitalized Phrases (CAPs): (learn more)
Springer-Verlag Berlin Heidelberg, Menger's Theorem, Sketch of Proof, Linearized Chord Diagram, Hakimi Input, Katharina Anna Lehmann, Las Vegas, Year Author New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 75
books:
See all 75 books this book cites
2
books
cite this book:
- Computer Science: A Concise Introduction by Ian Robertson Sinclair in Back Matter (1), Back Matter (2), and Back Matter (3)
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel in Back Matter (1), Back Matter (2), and Back Matter (3)
- Handbook of Graphs and Networks: From the Genome to the Internet by Stefan Bornholdt in Back Matter (1), and Back Matter (2)
- Research Methods in Social Network Analysis by Linton C. Freeman in Back Matter (1), and Back Matter (2)
- Research Methods (with InfoTrac) by Donald H. McBurney in Back Matter (1), and Back Matter (2)
See all 75 books this book cites
- Strukturanalyse sozialer Netzwerke by Mark Trappmann on page 220, and Back Matter
- Mining Graph Data by Diane J. Cook on page 58
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Certification
- Books > Computers & Technology > Computer Science > Modeling & Simulation
- Books > Computers & Technology > Hardware > Internet & Networking
- Books > Computers & Technology > Networking > Networks, Protocols & APIs
- Books > Computers & Technology > Programming > Algorithms
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Networking
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Professional & Technical > Engineering
- Books > Science & Math > Mathematics
