Related papers: Topological Resonances in Scattering on Networks (…
The surface states of intrinsic higher order topological phases are protected by the spatial symmetries of a finite sample. This property makes the existing scattering theory of topological invariants inapplicable because the scattering…
We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…
Self-organized network dynamics prevails for systems across physics, biology and engineering. How external signals generate distributed responses in networked systems fundamentally underlies their function, yet is far from fully understood.…
Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…
Learning graphs from sets of nodal observations represents a prominent problem formally known as graph topology inference. However, current approaches are limited by typically focusing on inferring single networks, and they assume that…
A non-unitary version of quantum scattering is studied via an exactly solvable toy model. The model is merely asymptotically local since the smooth path of the coordinate is admitted complex in the non-asymptotic domain. At any real…
Many complex networks, ranging from social to biological systems, exhibit structural patterns consistent with an underlying hyperbolic geometry. Revealing the dimensionality of this latent space can disentangle the structural complexity of…
Scattering resonances play a central role in collision processes in physics and chemistry. They help building an intuitive understanding of the collision dynamics due to the spatial localization of the scattering wavefunctions. For…
The topology of any complex system is key to understanding its structure and function. Fundamentally, algebraic topology guarantees that any system represented by a network can be understood through its closed paths. The length of each path…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present…
We consider wave propagation across an infinite waveguide of an arbitrary bounded cross-section, whose interior is blocked by two identical thick barriers with holes. When the holes are small, the waves over a broad range of frequencies are…
The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing…
Flow networks are essential for both living organisms and enginneered systems. These networks often present complex dynamics controlled, at least in part, by their topology. Previous works have shown that topologically complex networks…
The question of how network topology influences emergent synchronized oscillations in excitable media is addressed. Coupled van der Pol-FitzHugh-Nagumo elements arranged either on regular rings or on clusters of the square lattice are…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
Topology is a fundamental aspect of quantum physics, and it has led to key breakthroughs and results in various fields of quantum materials. In condensed matters, this has culminated in the recent discovery of symmetry-protected topological…