Related papers: The 27 geodesic networks in the directed landscape
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
We show that the directed landscape is a black noise in the sense of Tsirelson and Vershik. As a corollary, we show that for any microscopic system in which the height profile converges in law to the directed landscape, the driving noise is…
We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…
The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in…
We consider Teichm\"uller geodesics in strata of translation surfaces. We prove lower and upper bounds for the Hausdorff dimension of the set of parameters generating a geodesic bounded in some compact part of the stratum. Then we compute…
For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…
The trophic levels of nodes in directed networks can reveal their functional properties. Moreover, the trophic coherence of a network, defined in terms of trophic levels, is related to properties such as cycle structure, stability and…
We provide a framework for proving convergence to the directed landscape, the central object in the Kardar-Parisi-Zhang universality class. For last passage models, we show that compact convergence to the Airy line ensemble implies…
Complex systems are made up of many interacting components. Network science provides the tools to analyze and understand these interactions. Community detection is a key technique in network science for uncovering the structures that shape…
Network embedding is a fervid topic in current networks science and observes that most real complex systems can be embedded in hidden metrics space and emerge as the geometrical property, where the geometric distance between nodes…
We generalize the degree-organizational view of real-world networks with broad degree-distributions in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent…
We derive a general system of ODEs and associated explicit solutions in a special case for geodesics between full rank matrices in the deep linear network geometry. In the process, we find horizontal straight lines in the invariant balanced…
We construct an almost sure bijection that recovers the directed landscape on the half-plane from a sequence of independent Brownian motions. This map is the natural scaling limit of the Robinson--Schensted--Knuth (RSK) correspondence. The…
A general class of Lorentzian metrics, $M_0 x R^2$, $ds^2 = <.,.> + 2 du dv + H(x,u) du^2$, with $(M_0, <.,.>$ any Riemannian manifold, is introduced in order to generalize classical exact plane fronted waves. Here, we start a systematic…
Directed networks are ubiquitous and are necessary to represent complex systems with asymmetric interactions---from food webs to the World Wide Web. Despite the importance of edge direction for detecting local and community structure, it…
The Brownian map is a random geodesic metric space arising as the scaling limit of random planar maps. We strengthen the so-called confluence of geodesics phenomenon observed at the root of the map, and with this, reveal several properties…
Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…
Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane…