Results 11 to 20 of about 55,177 (267)
Graph-based methods for discrete choice
Network Science, 2023 AbstractChoices made by individuals have widespread impacts—for instance, people choose between political candidates to vote for, between social media posts to share, and between brands to purchase—moreover, data on these choices are increasingly abundant.
Kiran Tomlinson, Austin R. Benson
openaire +2 more sources
Discrete Signal Processing on Graphs [PDF]
IEEE Transactions on Signal Processing, 2013 In social settings, individuals interact through webs of relationships. Each individual is a node in a complex network (or graph) of interdependencies and generates data, lots of data. We label the data by its source, or formally stated, we index the data by the nodes of the graph.
Aliaksei Sandryhaila, José M. F. Moura
openaire +2 more sources
Not all planar graphs are in PURE-4-DIR
Journal of Graph Algorithms and Applications, 2020 We prove that some planar graphs are not intersection graphs of segments if only four slopes are allowed for the segments, and if parallel segments do not intersect. This refutes a conjecture of D. West [D. West, SIAM J. Discrete Math. Newsletter, 1991].
Daniel Gonçalves
doaj +1 more source
Discrete Random Walks on One-Sided ``Periodic'' Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way.
Michael Drmota
doaj +1 more source
Discrete Integral and Discrete Derivative on Graphs and Switch Problem of Trees
Mathematics, 2023 For a vertex and edge weighted (VEW) graph G with a vertex weight function fG let Wα,β(G)=∑{u,v}⊆V(G)[αfG(u)×fG(v)+β(fG(u)+fG(v))]dG(u,v) where, α,β∈ℝ and dG(u,v) denotes the distance, the minimum sum of edge weights across all the paths connecting u,v∈V(
M. H. Khalifeh, Abdol-Hossein Esfahanian
doaj +1 more source
Discrete linear canonical transform on graphs
Digital Signal Processing, 2023 With the wide application of spectral and algebraic theory in discrete signal processing techniques in the field of graph signal processing, an increasing number of signal processing methods have been proposed, such as the graph Fourier transform, graph wavelet transform and windowed graph Fourier transform.
Yu Zhang 0228, Bing-Zhao Li 0001
openaire +2 more sources
Discrete Knowledge Graph Embedding based on Discrete Optimization
CoRR, 2021 This paper proposes a discrete knowledge graph (KG) embedding (DKGE) method, which projects KG entities and relations into the Hamming space based on a computationally tractable discrete optimization algorithm, to solve the formidable storage and computation cost challenges in traditional continuous graph embedding methods.
Yunqi Li 0003 +6 more
openaire +2 more sources
On the Inverse Symmetric Division Deg Index of Unicyclic Graphs
Computation, 2022 The symmetric division deg (SDD) index is among the 148 discrete Adriatic indices that were developed about a decade ago. Motivated by the success of the SDD index, Ghorbani et al.
Abeer M. Albalahi, Akbar Ali
doaj +1 more source
Graph matching with hierarchical discrete relaxation [PDF]
Pattern Recognition Letters, 1999 Summary: Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt for this study is provided by iterative discrete relaxation.
Richard C. Wilson 0001, Edwin R. Hancock
openaire +2 more sources
Discrete Morse Inequalities on Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 The goal of this paper is to extend to infinite graphs the known Morse inequalities for discrete Morse functions proved by R. Forman in the finite case. In order to get this result we shall use a special kind of infinite subgraphs on which a discrete Morse function is monotonous, namely, decreasing rays.
Fernández Fernández, Luis Manuel +2 more
openaire +4 more sources