Related papers: The heat semigroup and Brownian motion on strip co…
Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of…
The class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the…
Fluid properties near rough surfaces are crucial in describing fundamental surface phenomena and modern industrial material design implementations. One of the most powerful approaches to model real rough materials is based on the surface…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
I propose a superconductivity model, which is based on the assumption that stripes in high-Tc cuprates (a) exist and (b) organize themselves in a two-dimensional superstructure. The model describes hole states, which are localized either…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…
We consider Schroedinger operators on compact and non-compact (finite) metric graphs. For such operators we analyse their spectra, prove that their resolvents can be represented as integral operators and introduce trace-class…
We study the effect of domain growth on the orientation of striped phases in a Swift-Hohenberg equation. Domain growth is encoded in a step-like parameter dependence that allows stripe formation in a half plane, and suppresses patterns in…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
Separable coordinate systems are introduced in the complex and real four-dimensional flat spaces. We use maximal Abelian subgroups to generate coordinate systems with a maximal number of ignorable variables. The results are presented (also…
We propose a theoretical framework of multi-way similarity to model real-valued data into hypergraphs for clustering via spectral embedding. For graph cut based spectral clustering, it is common to model real-valued data into graph by…
The Computation of discrete Contractive semigroups becomes necessary when we deal with several types of evolution equations in Discretizable Hilbert spaces, in this work we study some properties of the discrete forms of the contractive…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
Given a smooth closed manifold M, the Morse-Witten complex associated to a Morse function f and a Riemannian metric g on M consists of chain groups generated by the critical points of f and a boundary operator counting isolated flow lines…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…
We study a family of graphs with diameter two and asymptotically optimal order for their maximum degree, obtained from perfect difference sets. We show that for all known examples of perfect difference sets, the graph we obtain is…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…