Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1809.08148

Towards a classification of planar maps

Alexandre Diet·Marc Barthelemy
View original source ↗Read source document ↗Export metadata ↓

Abstract

Planar graphs and their spatial embedding -- planar maps -- are used in many different fields due to their ubiquity in the real world (leaf veins in biology, street patterns in urban studies, etc.) and are also fundamental objects in mathematics and combinatorics. These graphs have been well described in the literature, but we do not have so far a clear way to cluster them in different families. A typology of planar maps would be very useful and would allow to monitor their changes, to compare them with each other, or to correlate their structure with other properties. Using an algorithm which merges recursively the smallest areas in the graph with the largest ones, we plot the Gini coefficient of areas of cells and obtain a profile associated to each network. We test the relevance of these `Gini profiles' on simulated networks and on real street networks of Barcelona (Spain), New York City (USA), Tokyo (Japan), and discuss their main properties. We also apply this method to the case of Paris (France) at different dates which allows us to follow the structural changes of this system. Finally, we discuss the important ingredient of spatial heterogeneity of real-world planar graphs and test some ideas on Manhattan and Tokyo. Our results show that the Gini profile encodes various informations about the structure of the corresponding planar map and represents a good candidate for constructing relevant classes of these objects.

Explore related subjects

cond-mat.stat-mechphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandre Diet, Marc Barthelemy. 2018-09-21. Towards a classification of planar maps. https://doi.org/10.1103/physreve.98.062304

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗