Zobrazeno 1 - 10
of 16
pro vyhledávání: '"AKTAŞ, Mehmet Emin"'
Hypergraphs, with their capacity to depict high-order relationships, have emerged as a significant extension of traditional graphs. Although Graph Neural Networks (GNNs) have remarkable performance in graph representation learning, their extension to
Externí odkaz:
http://arxiv.org/abs/2310.09657
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including clustering, grap
Externí odkaz:
http://arxiv.org/abs/2306.11484
Detecting influential users, called the influence maximization problem on social networks, is an important graph mining problem with many diverse applications such as information propagation, market advertising, and rumor controlling. There are many
Externí odkaz:
http://arxiv.org/abs/2203.11275
Information diffusion on networks is an important concept in network science observed in many situations such as information spreading and rumor controlling in social networks, disease contagion between individuals, cascading failures in power grids.
Externí odkaz:
http://arxiv.org/abs/2105.02763
Autor:
Aktas, Mehmet Emin, Akbas, Esra
Networks are important structures used to model complex systems where interactions take place. In a basic network model, entities are represented as nodes, and interaction and relations among them are represented as edges. However, in a complex syste
Externí odkaz:
http://arxiv.org/abs/2102.08867
Autor:
Aktas, Mehmet Emin, Akbas, Esra
In this paper, we study the graph classification problem in vertex-labeled graphs. Our main goal is to classify the graphs comparing their higher-order structures thanks to heat diffusion on their simplices. We first represent vertex-labeled graphs a
Externí odkaz:
http://arxiv.org/abs/2007.00434
Information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, and biological networks. The primary challenge in this domain is measuring similarity or d
Externí odkaz:
http://arxiv.org/abs/1907.08708
We use the Krammer representation of the braid group in Libgober's invariant and construct a new multivariate polynomial invariant for curve complements: Krammer polynomial. We show that the Krammer polynomial of an essential braid is equal to zero.
Externí odkaz:
http://arxiv.org/abs/1707.05585
Autor:
Aktas, Mehmet Emin
In this paper, we focus on properties of dessins d'enfants associated to trigonal curves. Degtyarev studied dessins d'enfants to compute braid monodromies and fundamental groups of trigonal curves using their combinatorial data. We first classify all
Externí odkaz:
http://arxiv.org/abs/1706.09956
Publikováno v:
Gazi University Journal of Gazi Educational Faculty (GUJGEF); Apr2024, Vol. 44 Issue 1, p567-599, 33p
