30,399 research outputs found
Mixed unit interval graphs
AbstractThe class of intersection graphs of unit intervals of the real line whose ends may be open or closed is a strict superclass of the well-known class of unit interval graphs. We pose a conjecture concerning characterizations of such mixed unit interval graphs, verify parts of it in general, and prove it completely for diamond-free graphs. In particular, we characterize diamond-free mixed unit interval graphs by means of an infinite family of forbidden induced subgraphs, and we show that a diamond-free graph is mixed unit interval if and only if it has intersection representations using unit intervals such that all ends of the intervals are integral
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
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. Here we prove that the hypersoft
configuration model (HSCM), belonging to the class of random graphs with latent
hyperparameters, also known as inhomogeneous random graphs or -random
graphs, is an ensemble of random power-law graphs that are sparse, unbiased,
and either exchangeable or projective. The proof of their unbiasedness relies
on generalized graphons, and on mapping the problem of maximization of the
normalized Gibbs entropy of a random graph ensemble, to the graphon entropy
maximization problem, showing that the two entropies converge to each other in
the large-graph limit
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
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. Here we prove that the hypersoft
configuration model (HSCM), belonging to the class of random graphs with latent
hyperparameters, also known as inhomogeneous random graphs or -random
graphs, is an ensemble of random power-law graphs that are sparse, unbiased,
and either exchangeable or projective. The proof of their unbiasedness relies
on generalized graphons, and on mapping the problem of maximization of the
normalized Gibbs entropy of a random graph ensemble, to the graphon entropy
maximization problem, showing that the two entropies converge to each other in
the large-graph limit
Functionals of the Brownian motion, localization and metric graphs
We review several results related to the problem of a quantum particle in a
random environment.
In an introductory part, we recall how several functionals of the Brownian
motion arise in the study of electronic transport in weakly disordered metals
(weak localization).
Two aspects of the physics of the one-dimensional strong localization are
reviewed : some properties of the scattering by a random potential (time delay
distribution) and a study of the spectrum of a random potential on a bounded
domain (the extreme value statistics of the eigenvalues).
Then we mention several results concerning the diffusion on graphs, and more
generally the spectral properties of the Schr\"odinger operator on graphs. The
interest of spectral determinants as generating functions characterizing the
diffusion on graphs is illustrated.
Finally, we consider a two-dimensional model of a charged particle coupled to
the random magnetic field due to magnetic vortices. We recall the connection
between spectral properties of this model and winding functionals of the planar
Brownian motion.Comment: Review article. 50 pages, 21 eps figures. Version 2: section 5.5 and
conclusion added. Several references adde
- …