ID: cond-mat/0312494

Statistical mechanics of random graphs

December 18, 2003

View on ArXiv
Zdzislaw Burda, Jerzy Jurkiewicz, Andre Krzywicki
Condensed Matter
Statistical Mechanics

We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.

Similar papers 1

Random walks on graphs: ideas, techniques and results

July 6, 2005

91% Match
R. Burioni, D. Cassi
Statistical Mechanics

Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and new ideas have been introduced, which can be fruitfully extended to different areas and disciplines. Here we aim at giving a brief but comprehensive perspective of these progresses, with a particular emphasis on physical aspects.

Find SimilarView on arXiv

Principles of statistical mechanics of random networks

April 4, 2002

91% Match
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin
Statistical Mechanics
Networking and Internet Arch...
Mathematical Physics
Adaptation and Self-Organizi...

We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple dynamical construction procedures that produce equilibrium uncorrelated random graphs with an arbitrary degree distribution. In particular, we show that in equilibrium uncorrelated networks, fat-tailed degree distributions may exist only starting...

Find SimilarView on arXiv

Defining statistical ensembles of random graphs

October 27, 2001

91% Match
A. Krzywicki
Statistical Mechanics
Disordered Systems and Neura...

The problem of defining a statistical ensemble of random graphs with an arbitrary connectivity distribution is discussed. Introducing such an ensemble is a step towards uderstanding the geometry of wide classes of graphs independently of any specific model. This research was triggered by the recent interest in the so-called scale-free networks.

Find SimilarView on arXiv

Kinetic Theory of Random Graphs

March 17, 2005

91% Match
E. Ben-Naim, P. L. Krapivsky
Statistical Mechanics
Disordered Systems and Neura...

Statistical properties of evolving random graphs are analyzed using kinetic theory. Treating the linking process dynamically, structural characteristics such as links, paths, cycles, and components are obtained analytically using the rate equation approach. Scaling laws for finite systems are derived using extreme statistics and scaling arguments.

Find SimilarView on arXiv

Networks, Random Graphs and Percolation

September 8, 2014

91% Match
Philippe Deprez, Mario V. Wüthrich
Probability

The theory of random graphs goes back to the late 1950s when Paul Erd\H{o}s and Alfr\'ed R\'enyi introduced the Erd\H{o}s-R\'enyi random graph. Since then many models have been developed, and the study of random graph models has become popular for real-life network modelling such as social networks and financial networks. The aim of this overview is to review relevant random graph models for real-life network modelling. Therefore, we analyse their properties in terms of styli...

Find SimilarView on arXiv

Random Graph Models and Matchings

September 2, 2019

90% Match
Lucas Rooney
Statistics Theory
Statistics Theory

In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent recent results and provide a basis of further exploration.

Find SimilarView on arXiv

Random graphs as models of networks

February 12, 2002

90% Match
M. E. J. Newman
Statistical Mechanics
Disordered Systems and Neura...

The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks such as the Internet, social networks or biological networks it leaves a lot to be desired. In particular, it differs from real networks in two crucial ways: it lacks network clustering or transitivity, and it has an unrealistic Poissonian...

Find SimilarView on arXiv

Equilibrium statistical mechanics of network structures

January 30, 2004

89% Match
I. Farkas, I. Derenyi, ... , Vicsek T.
Statistical Mechanics

In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on the classical random graph model and then survey a large variety of recently studied network models. Next, we analyze the structural properties of the graphs in these ensembles in terms of both local and global characteristics, such as degree...

Find SimilarView on arXiv

How to calculate the main characteristics of random graphs - a new approach

August 29, 2003

89% Match
Agata Fronczak, Piotr Fronczak, Janusz A. Holyst
Statistical Mechanics
Disordered Systems and Neura...

The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the main network characteristics like: the position of the phase transition at which a giant component first forms, the mean component size below the phase transition, the size of the giant component and the average path length above the phase ...

Find SimilarView on arXiv

Extremal results in random graphs

February 9, 2013

89% Match
Vojtěch Rödl, Mathias Schacht
Combinatorics

According to Paul Erd\H{o}s [Some notes on Tur\'an's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur\'an who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd\H{o}s popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his influence on discrete mathematicians in Hungary and all over the world. In fact, most of the early contributions in this fiel...

Find SimilarView on arXiv