ID: 1403.5884

Entropy distribution and condensation in random networks with a given degree distribution

March 24, 2014

View on ArXiv

Similar papers 5

Statistical physics of social networking

June 2, 2020

86% Match
Vaibhav Wasnik
Physics and Society
Statistical Mechanics
Social and Information Netwo...

In this work we make an attempt to understand social networks from a mathematical viewpoint. In the first instance we consider a network where each node representing an individual can connect with a neighbouring node with a certain probability along with connecting with individuals who are friends of friends. We find that above a particular value of a chosen combination of parameters, the probability of connection between two widely separated nodes is a scale free. We next co...

Find SimilarView on arXiv

Distinct Degrees and Their Distribution in Complex Networks

April 7, 2013

86% Match
P. L. Krapivsky, S. Redner
Statistical Mechanics
Data Analysis, Statistics an...

We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an ensemble in which the number of nodes of degree k has an algebraic tail, N_k ~ N/k^nu for k>>1, the number of distinct degrees grows as N^{1/nu}. Such an algebraic growth is also observed in scientific citation data. We also determine the N dep...

Find SimilarView on arXiv

Network-ensemble comparisons with stochastic rewiring and von Neumann entropy

April 4, 2017

86% Match
Zichao Li, Peter J. Mucha, Dane Taylor
physics.soc-ph
cond-mat.dis-nn
cs.IT
math.IT
math.PR
stat.ME

Assessing whether a given network is typical or atypical for a random-network ensemble (i.e., network-ensemble comparison) has widespread applications ranging from null-model selection and hypothesis testing to clustering and classifying networks. We develop a framework for network-ensemble comparison by subjecting the network to stochastic rewiring. We study two rewiring processes, uniform and degree-preserved rewiring, which yield random-network ensembles that converge to t...

Find SimilarView on arXiv

Entropy Rate of Diffusion Processes on Complex Networks

December 3, 2007

86% Match
Jesus Gomez-Gardenes, Vito Latora
Statistical Mechanics
Data Analysis, Statistics an...

The concept of entropy rate for a dynamical process on a graph is introduced. We study diffusion processes where the node degrees are used as a local information by the random walkers. We describe analitically and numerically how the degree heterogeneity and correlations affect the diffusion entropy rate. In addition, the entropy rate is used to characterize complex networks from the real world. Our results point out how to design optimal diffusion processes that maximize the...

Find SimilarView on arXiv

Realistic network growth using only local information: From random to scale-free and beyond

August 31, 2006

86% Match
David M. D. Smith, Chiu Fan Lee, Neil F. Johnson
Statistical Mechanics
Disordered Systems and Neura...
Physics and Society

We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment probabilities. Scale-free networks arise at the transition point between quasi-random and quasi-ordered networks. We provide a detailed formalism which accurately describes the entire network range, including this critical point. Our formalis...

Find SimilarView on arXiv

Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution

May 29, 2017

86% Match
der Hoorn Pim van, Gabor Lippner, Dmitri Krioukov
math.PR
cond-mat.stat-mech
cs.SI
math.ST
physics.soc-ph
stat.TH

Even though power-law or close-to-power-law degree distributions are ubiquitously observed in a great variety of large real networks, the mathematically satisfactory treatment of random power-law graphs satisfying basic statistical requirements of realism is still lacking. These requirements are: sparsity, exchangeability, projectivity, and unbiasedness. The last requirement states that entropy of the graph ensemble must be maximized under the degree distribution constraints....

Find SimilarView on arXiv

Entropy rate of non-equilibrium growing networks

September 5, 2011

86% Match
Kun Zhao, Arda Halu, ... , Bianconi Ginestra
Disordered Systems and Neura...
Statistical Mechanics

New entropy measures have been recently introduced for the quantification of the complexity of networks. Most of these entropy measures apply to static networks or to dynamical processes defined on static complex networks. In this paper we define the entropy rate of growing network models. This entropy rate quantifies how many labeled networks are typically generated by the growing network models. We analytically evaluate the difference between the entropy rate of growing tre...

Find SimilarView on arXiv

A surrogate for networks -- How scale-free is my scale-free network?

June 18, 2013

86% Match
Michael Small, Kevin Judd, Thomas Stemler
Physics and Society
Social and Information Netwo...
Adaptation and Self-Organizi...
Data Analysis, Statistics an...

Complex networks are now being studied in a wide range of disciplines across science and technology. In this paper we propose a method by which one can probe the properties of experimentally obtained network data. Rather than just measuring properties of a network inferred from data, we aim to ask how typical is that network? What properties of the observed network are typical of all such scale free networks, and which are peculiar? To do this we propose a series of methods t...

Find SimilarView on arXiv

Asymptotic entropy of the Gibbs state of complex networks

March 18, 2020

86% Match
Adam Glos, Aleksandra Krawiec, Łukasz Pawela
Probability

In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. We illustrate our analytical results with numerical simulations for Erd\H{o}s-R\'enyi, Watts-Strogatz, Barab\'asi-Albert and Chung-Lu graph mo...

Find SimilarView on arXiv

Exchangeable Random Networks

July 24, 2007

86% Match
F. Bassetti, M. Cosentino Lagomarsino, S. Mandrá
Probability
Statistics Theory
Statistics Theory

We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that carachterize the degree distribution of the ensemble graphs, together with some features that are important for applications, such as subgraph distributions and kernel of the adjacency matrix. These results are used to compare to other models of simple and compl...

Find SimilarView on arXiv