Handbook of Large-Scale Random Networks: Bolyai Society Mathematical Studies, cartea 18
Editat de Bela Bollobas, Robert Kozma, Dezso Miklosen Limba Engleză Paperback – 30 noi 2011
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 642.66 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 30 noi 2011 | 642.66 lei 6-8 săpt. | |
Hardback (1) | 647.96 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 20 iul 2009 | 647.96 lei 6-8 săpt. |
Din seria Bolyai Society Mathematical Studies
- Preț: 394.10 lei
- 18% Preț: 783.73 lei
- 20% Preț: 602.83 lei
- 20% Preț: 481.50 lei
- 24% Preț: 1737.66 lei
- 15% Preț: 639.80 lei
- 18% Preț: 770.91 lei
- 15% Preț: 644.11 lei
- 15% Preț: 641.52 lei
- 15% Preț: 632.73 lei
- 20% Preț: 569.84 lei
- 15% Preț: 643.15 lei
- 20% Preț: 581.62 lei
- 24% Preț: 838.75 lei
- 15% Preț: 644.92 lei
- Preț: 387.90 lei
- 18% Preț: 1115.40 lei
- 18% Preț: 726.23 lei
Preț: 642.66 lei
Preț vechi: 756.07 lei
-15% Nou
Puncte Express: 964
Preț estimativ în valută:
122.98€ • 129.38$ • 101.82£
122.98€ • 129.38$ • 101.82£
Carte tipărită la comandă
Livrare economică 14-28 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642242298
ISBN-10: 3642242294
Pagini: 540
Ilustrații: 600 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.85 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Bolyai Society Mathematical Studies
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642242294
Pagini: 540
Ilustrații: 600 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.85 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Bolyai Society Mathematical Studies
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Random Graphs and Branching Processes.- Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs.- Scaling Properties of Complex Networks and Spanning Trees.- Random Tree Growth with Branching Processes — A Survey.- Reaction-diffusion Processes in Scale-free Networks.- Toward Understanding the Structure and Function of Cellular Interaction Networks.- Scale-Free Cortical Planar Networks.- Reconstructing Cortical Networks: Case of Directed Graphs with High Level of Reciprocity.- k-Clique Percolation and Clustering.- The Inverse Problem of Evolving Networks — with Application to Social Nets.- Learning and Representation: From Compressive Sampling to the ‘Symbol Learning Problem’.- Telephone Call Network Data Mining: A Survey with Experiments.
Recenzii
From the reviews:
“It is a collection of papers on advances in the field of large-scale networks … . The material presented here is based on a workshop organized in Budapest in 2006. … An ideal reader of the book may be a mathematician … .” (Miklós Bóna, The Mathematical Association of America, February, 2010)
“The volume is an outcome of a U.S.-Hungarian workshop on complex networks held at the Rényi Istitute in Budapest in 2006. … I quite enjoyed reading the book. The choice of topics and presentations is illustrative of the type of work taking place in this area … . are likely to be useful to the theoretical computer scientist interested in random structures and algorithms, but most of the chapters were reasonably interesting to me.” (Gabriel Istrate, SIGACT News, April, 2012)
“It is a collection of papers on advances in the field of large-scale networks … . The material presented here is based on a workshop organized in Budapest in 2006. … An ideal reader of the book may be a mathematician … .” (Miklós Bóna, The Mathematical Association of America, February, 2010)
“The volume is an outcome of a U.S.-Hungarian workshop on complex networks held at the Rényi Istitute in Budapest in 2006. … I quite enjoyed reading the book. The choice of topics and presentations is illustrative of the type of work taking place in this area … . are likely to be useful to the theoretical computer scientist interested in random structures and algorithms, but most of the chapters were reasonably interesting to me.” (Gabriel Istrate, SIGACT News, April, 2012)
Textul de pe ultima copertă
This handbook describes advances in large scale network studies that have taken place in the past 5 years since the publication of the Handbook of Graphs and Networks in 2003. It covers all aspects of large-scale networks, including mathematical foundations and rigorous results of random graph theory, modeling and computational aspects of large-scale networks, as well as areas in physics, biology, neuroscience, sociology and technical areas. Applications range from microscopic to mesoscopic and macroscopic models.
The book is based on the material of the NSF workshop on Large-scale Random Graphs held in Budapest in 2006, at the Alfréd Rényi Institute of Mathematics, organized jointly with the University of Memphis.
The book is based on the material of the NSF workshop on Large-scale Random Graphs held in Budapest in 2006, at the Alfréd Rényi Institute of Mathematics, organized jointly with the University of Memphis.
Caracteristici
Offers a comprehensive overview of random graphs and networks Emphasis on modelling complex real-world networks such as brains, biological and physical memories, computer systems and communication New conjectures are outlined and new directions for future research are defined A link is established between the fundamental mathematical, graph theoretical approach and the approach based on methods of statistical physics Contains a detailed methodological description of various applications, such as reaction-diffusion equations, cellular regulation and intracellular networks, neural networks and brain networks, social networks, telecommunication and learning behaviors in networks