The aim of this book is to report on the progress realized in probability theory in the field of dynamic random walks and to present applications in computer science, mathematical physics and finance. Each chapter contains didactical material as well as more advanced technical sections. Few appendices will help refreshing memories (if necessary!).· New probabilistic model, new results in probability theory· Original applications in computer science· Applications in mathematical physics· Applications in finance

Most networks and databases that humans have to deal with contain large, albeit finite number of units. Their structure, for maintaining functional consistency of the components, is essentially not random and calls for a precise quantitative description of relations between nodes (or data units) and all network components. This book is an introduction, for both graduate students and newcomers to the field, to the theory of graphs and random walks on such graphs. The methods based on random walks and diffusions for exploring the structure of finite connected graphs and databases are reviewed (Markov chain analysis). This provides the necessary basis for consistently discussing a number of applications such diverse as electric resistance networks, estimation of land prices, urban planning, linguistic databases, music, and gene expression regulatory networks.

The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

Galileo Unbound traces the journey that brought us from Galileo's law of free fall to today's geneticists measuring evolutionary drift, entangled quantum particles moving among many worlds, and our lives as trajectories traversing a health space with thousands of dimensions. Remarkably, common themes persist that predict the evolution of species as readily as the orbits of planets or the collapse of stars into black holes. This book tells the history of spaces of expanding dimension and increasing abstraction and how they continue today to give new insight into the physics of complex systems. Galileo published the first modern law of motion, the Law of Fall, that was ideal and simple, laying the foundation upon which Newton built the first theory of dynamics. Early in the twentieth century, geometry became the cause of motion rather than the result when Einstein envisioned the fabric of space-time warped by mass and energy, forcing light rays to bend past the Sun. Possibly more radical was Feynman's dilemma of quantum particles taking all paths at once — setting the stage for the modern fields of quantum field theory and quantum computing. Yet as concepts of motion have evolved, one thing has remained constant, the need to track ever more complex changes and to capture their essence, to find patterns in the chaos as we try to predict and control our world.

Random walks are stochastic processes formed by successive summation of independent, identically distributed random variables and are one of the most studied topics in probability theory. This contemporary introduction evolved from courses taught at Cornell University and the University of Chicago by the first author, who is one of the most highly regarded researchers in the field of stochastic processes. This text meets the need for a modern reference to the detailed properties of an important class of random walks on the integer lattice. It is suitable for probabilists, mathematicians working in related fields, and for researchers in other disciplines who use random walks in modeling.

This book analyzes stochastic processes on networks and regular structures such as lattices by employing the Markovian random walk approach. Part 1 is devoted to the study of local and non-local random walks. It shows how non-local random walk strategies can be defined by functions of the Laplacian matrix that maintain the stochasticity of the transition probabilities. A major result is that only two types of functions are admissible: type (i) functions generate asymptotically local walks with the emergence of Brownian motion, whereas type (ii) functions generate asymptotically scale-free non-local “fractional” walks with the emergence of Lévy flights. In Part 2, fractional dynamics and Lévy flight behavior are analyzed thoroughly, and a generalization of Pólya's classical recurrence theorem is developed for fractional walks. The authors analyze primary fractional walk characteristics such as the mean occupation time, the mean first passage time, the fractal scaling of the set of distinct nodes visited, etc. The results show the improved search capacities of fractional dynamics on networks.

Social network analysis applications have experienced tremendous advances within the last few years due in part to increasing trends towards users interacting with each other on the internet. Social networks are organized as graphs, and the data on social networks takes on the form of massive streams, which are mined for a variety of purposes. Social Network Data Analytics covers an important niche in the social network analytics field. This edited volume, contributed by prominent researchers in this field, presents a wide selection of topics on social network data mining such as Structural Properties of Social Networks, Algorithms for Structural Discovery of Social Networks and Content Analysis in Social Networks. This book is also unique in focussing on the data analytical aspects of social networks in the internet scenario, rather than the traditional sociology-driven emphasis prevalent in the existing books, which do not focus on the unique data-intensive characteristics of online social networks. Emphasis is placed on simplifying the content so that students and practitioners benefit from this book. This book targets advanced level students and researchers concentrating on computer science as a secondary text or reference book. Data mining, database, information security, electronic commerce and machine learning professionals will find this book a valuable asset, as well as primary associations such as ACM, IEEE and Management Science.