Relevant bibliographies by topics / Overlapping graphs

Academic literature on the topic 'Overlapping graphs'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Overlapping graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Overlapping graphs"

1

HARALAMBIDES, JAMES, and SPYROS TRAGOUDAS. "BIPARTITIONING INTO OVERLAPPING SETS." International Journal of Foundations of Computer Science 06, no. 01 (March 1995): 67–88. http://dx.doi.org/10.1142/s0129054195000068.

Full text
Abstract:
We consider a generalization of the min-cut partitioning problem where we partition a graph G=(V,E) into two sets V1 and V2 such that |V1∩V2|≤d, d<|V|, and such that |{(u, v)|u∈V1−V2, v∈V2−V1}| is minimized. The problem is trivially solvable using flow techniques for any fixed d, but we show that it is NP-hard for integer values of d. It remains NP-hard if we impose restrictions on the size of V1, i.e., |V1|=k, k∈Z+. The latter problem variation may apply in VLSI layout and hypertext partitioning. We present polynomial time algorithms for the special cases of solid grids and series-parallel graphs. Series-parallel graphs find applications in hypertext partitioning whereas grid graphs model the mapping of a class of Partial Differential Equation computations into parallel machines.
APA, Harvard, Vancouver, ISO, and other styles
2

Bhagavathi, D., H. Gurla, S. Olariu, J. L. Schwing, and J. Zhang. "Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs." VLSI Design 4, no. 1 (January 1, 1996): 33–40. http://dx.doi.org/10.1155/1996/40175.

Full text
Abstract:
The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ(log n) time using n processors in the CREW model.
APA, Harvard, Vancouver, ISO, and other styles
3

Evans, T. S. "Clique graphs and overlapping communities." Journal of Statistical Mechanics: Theory and Experiment 2010, no. 12 (December 23, 2010): P12037. http://dx.doi.org/10.1088/1742-5468/2010/12/p12037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Galbrun, Esther, Aristides Gionis, and Nikolaj Tatti. "Overlapping community detection in labeled graphs." Data Mining and Knowledge Discovery 28, no. 5-6 (August 2, 2014): 1586–610. http://dx.doi.org/10.1007/s10618-014-0373-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

CRAMPES, MICHEL, and MICHEL PLANTIÉ. "A UNIFIED COMMUNITY DETECTION, VISUALIZATION AND ANALYSIS METHOD." Advances in Complex Systems 17, no. 01 (February 2014): 1450001. http://dx.doi.org/10.1142/s0219525914500015.

Full text
Abstract:
With the widespread social networks on the Internet, community detection in social graphs has recently become an important research domain. Interest was initially limited to unipartite graph inputs and partitioned community outputs. More recently, bipartite graphs, directed graphs and overlapping communities have all been investigated. Few contributions however have encompassed all three types of graphs simultaneously. In this paper, we present a method that unifies community detection for these three types of graphs while at the same time it merges partitioned and overlapping communities. Moreover, the results are visualized in a way that allows for analysis and semantic interpretation. For validation purposes this method is experimented on some well-known simple benchmarks and then applied to real data: photos and tags in Facebook and Human Brain Tractography data. This last application leads to the possibility of applying community detection methods to other fields such as data analysis with original enhanced performances.
APA, Harvard, Vancouver, ISO, and other styles
6

Miro, Eden Delight, Aliw-iw Zambrano, and Agnes Garciano. "Construction of weavings in the plane." Acta Crystallographica Section A Foundations and Advances 74, no. 1 (January 1, 2018): 25–35. http://dx.doi.org/10.1107/s205327331701422x.

Full text
Abstract:
This work develops, in graph-theoretic terms, a methodology for systematically constructing weavings of overlapping nets derived from 2-colorings of the plane. From a 2-coloring, two disjoint simple, connected graphs called nets are constructed. The union of these nets forms an overlapping net, and a weaving map is defined on the intersection points of the overlapping net to form a weaving. Furthermore, a procedure is given for the construction of mixed overlapping nets and for deriving weavings from them.
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Guishen, Yuanwei Wang, Kaitai Wang, Zhihua Liu, Lijuan Zhang, Yu Zhou, and Qinan Yao. "An overlapping community detection algorithm based on node distance of line graph." Modern Physics Letters B 33, no. 26 (September 20, 2019): 1950322. http://dx.doi.org/10.1142/s0217984919503226.

Full text
Abstract:
Overlapping community detection is a hot topic in research of complex networks. Link community detection is a popular approach to discover overlapping communities. Line graph is a widely used model in link community detection. In this paper, we propose an overlapping community detection algorithm based on node distance of line graph. Considering topological structure of links in graphs, we use line graph to transform links of graph into nodes of line graph. Then, we calculate node distance of line graph according to their dissimilarity. After getting distance matrix, we proposed a new [Formula: see text] measure based on nodes of line graph and combine it with clustering algorithm by fast search and density peak to identify node communities of line graph. Finally, we acquire overlapping node communities after transforming node communities of line graph back to graph. The experimental results show that our algorithm achieves a higher performance on normalized mutual information metric.
APA, Harvard, Vancouver, ISO, and other styles
8

Yoshida, Tetsuya. "Weighted line graphs for overlapping community discovery." Social Network Analysis and Mining 3, no. 4 (March 21, 2013): 1001–13. http://dx.doi.org/10.1007/s13278-013-0104-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Zhenkun, and Hongjian Lai. "On Critical Unicyclic Graphs with Cutwidth Four." AppliedMath 2, no. 4 (November 17, 2022): 621–37. http://dx.doi.org/10.3390/appliedmath2040036.

Full text
Abstract:
The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph G on a line Pn with n=|V(G)| vertices in such a way that the maximum number of overlapping edges (i.e., the congestion) is minimized. A graph G with a cutwidth of k is k-cutwidth critical if every proper subgraph of G has a cutwidth less than k and G is homeomorphically minimal. In this paper, we first verified some structural properties of k-cutwidth critical unicyclic graphs with k>1. We then mainly investigated the critical unicyclic graph set T with a cutwidth of four that contains fifty elements, and obtained a forbidden subgraph characterization of 3-cutwidth unicyclic graphs.
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Sakshi. "Algorithm and Techniques for Overlapping Community Detection." International Journal of Advance Research and Innovation 2, no. 2 (2014): 52–60. http://dx.doi.org/10.51976/ijari.221408.

Full text
Abstract:
A lot of phenomenon, real world and otherwise can be conveniently represented as graphs, with the nodes corresponding to the entities and the edges representing the interaction be- tween those entities. Communities or modules, which are groups of nodes densely connected to each other within the community but sparsely linked to other communities and the rest of the graph, often having similar structural and functional properties. A lot of algorithms have been proposed to partition the set of vertices into communities; such a partition exclusively puts a node into one community or the other. But in real life a node can belong to multiple communities simultaneously, i.e. the communities can overlap. Different metrics have been proposed. We reduce the modularity maximization problem for splitting the graph into two communities to the MAX-CUT problem with both positive and negative weights. We introduce and analyze three approximation algorithms to maximize modularity for the two community case; recursive bi-partitioning can be carried out as long as modularity increases to split into more than two communities.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Overlapping graphs"

1

Sardana, Divya. "Analysis of Meso-scale Structures in Weighted Graphs." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Attal, Jean-Philippe. "Nouveaux algorithmes pour la détection de communautés disjointes et chevauchantes basés sur la propagation de labels et adaptés aux grands graphes." Thesis, Cergy-Pontoise, 2017. http://www.theses.fr/2017CERG0842/document.

Full text
Abstract:
Les graphes sont des structures mathématiques capable de modéliser certains systèmes complexes.Une des nombreuses problématiques liée aux graphes concerne la détection de communautés qui vise à trouver une partition en sommet d'un graphe en vue d'en comprendre la structure. A titre d'exemple, en représentant des contratsd'assurances par des noeuds et leurs degrés de similarité par une arête,détecter des groupes de noeuds fortement connectésconduit à détecter des profils similaires, et donc a voir des profils à risques.De nombreux algorithmes ont essayé de répondreà ce problème.Une des méthodes est la propagation de labels qui consiste à ce quechaque noeud puisse recevoir un label par un vote majoritaire de ses voisins.Bien que cette méthode soit simple à mettre en oeuvre,elle présente une grande instabilité due au non déterminisme del'algorithme et peut dans certains cas ne pas détecter de structures communautaires.La première contribution de cette thèse sera de i) proposerune méthode de stabilisation de la propagation de labelstout en appliquant des barrages artificiels pour limiter les possibles mauvaises propagations.Les réseaux complexes ont également comme caractéristique que certains noeuds puissent appartenir à plusieurs communautés, on parle alors de recouvrements. C'est en ce sens que la secondecontribution de cette thèse portera sur ii) la créationd'un algorithme auquel seront adjointes des fonctions d'appartenancespour détecter de possibles recouvrements via des noeuds candidats au chevauchement.La taille des graphes est également une notion à considérer dans la mesure où certains réseaux peuvent contenir plusieursmillions de noeuds et d'arêtes.Nous proposons iii) une version parallèleet distribuée de la détection de communautés en utilisant la propagation de labels par coeur.Une étude comparative sera effectuée pour observerla qualité de partitionnement et de recouvrement desalgorithmes proposés
Graphs are mathematical structures amounting to a set of nodes (objects or persons) in which some pairs are in linked with edges. Graphs can be used to model complex systems.One of the main problems in graph theory is the community detection problemwhich aims to find a partition of nodes in the graph to understand its structure.For instance, by representing insurance contracts by nodes and their relationship by edges,detecting groups of nodes highly connected leads to detect similar profiles and to evaluate risk profiles. Several algorithms are used as aresponse to this currently open research field.One of the fastest method is the label propagation.It's a local method, in which each node changes its own label according toits neighbourhood.Unfortunately, this method has two major drawbacks. The first is the instability of the method. Each trialgives rarely the same result.The second is a bad propagation which can lead to huge communities without sense (giant communities problem).The first contribution of the thesis is i) proposing a stabilisation methodfor the label propagation with artificial dams on edges of some networks in order to limit bad label propagations. Complex networks are also characterized by some nodes which may belong to several communities,we call this a cover.For example, in Protein–protein interaction networks, some proteins may have several functions.Detecting these functions according to their communities could help to cure cancers. The second contribution of this thesis deals with the ii)implementation of an algorithmwith functions to detect potential overlapping nodes .The size of the graphs is also to be considered because some networks contain several millions of nodes and edges like the Amazon product co-purchasing network.We propose iii) a parallel and a distributed version of the community detection using core label propagation.A study and a comparative analysis of the proposed algorithms will be done based on the quality of the resulted partitions and covers
APA, Harvard, Vancouver, ISO, and other styles
3

Das, Nivedita. "Modeling three-dimensional shape of sand grains using Discrete Element Method." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Azevedo, Vinicius da Costa. "Efficient smoke simulation on curvilinear grids." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/78361.

Full text
Abstract:
This thesis present an efficient approach for performing smoke simulation on curvilinear grids. The solution of the Navier-Stokes equations on curvilinear is made on three steps: advection, pressure solving and velocity projection. The proposed advection method is simple, fast and unconditionally-stable. Our solution is able to maintain a staggered-grid variable arrangement, and includes an efficient solution to enforce mass conservation. Compared to approaches based on regular grids traditionally used in computer graphics, our method allows for better representation of boundary conditions, lending to more realistic results, with just a small increment in computational cost. Moreover, we are able to condensate cells where interesting artifacts tend to appear, like swirling vortices or turbulence. We demonstrate the effectiveness of our approach, both in 2-D and 3-D, through a variety of high-quality smoke simulations and animations. These examples show the integration of our method with overlapping grids and multigrid techniques.
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Xufei. "Efficient Community Detection." Thesis, 2015. http://hdl.handle.net/1885/16471.

Full text
Abstract:
Given a large network, local community detection aims at finding the community that contains a set of query nodes and also maximises (minimises) a goodness metric. Furthermore, due to the inconvenience or impossibility of obtaining the complete network information in many situations, the detection becomes more challenging. This problem has recently drawn intense research interest. Various goodness metrics have been proposed. And most of them base on the statistical features of community structures, such as the internal density or external spareness. However, the metrics often result in unsatisfactory results by either including irrelevant subgraphs of high density, or pulling in outliers which accidentally match the metric for the time being. Further more, when in a highly overlapping environment such as social networks, the unconventional community structures make these metrics usually end up with a quite trivial detection result. In our work, we go for a alternative point of view on the formation of the communities, namely the assembly of nodes with different roles in the structure. With the new view point, we present two metrics which are proved to perform superiorly in traditional and complex environment respectively. Moreover, on realising a single metric is whatsoever limited in effectiveness as well as scope of application, we raise up a complete framework for the collaboration ofmetrics in the field, which also lands a base-stone for future innovations. The experiment results collected from Amazon, DBLP, Youtube and LivingJournal well certifies the effectiveness of the metrics.
APA, Harvard, Vancouver, ISO, and other styles
6

Malema, Gabofetswe Alafang. "Low-density parity-check codes : construction and implementation." 2007. http://hdl.handle.net/2440/45525.

Full text
Abstract:
Low-density parity-check (LDPC) codes have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication. However, a LDPC code decoding algorithm needs to be executed efficiently to meet cost, time, power and bandwidth requirements of target applications. The constructed codes should also meet error rate performance requirements of those applications. Since their rediscovery, there has been much research work on LDPC code construction and implementation. LDPC codes can be designed over a wide space with parameters such as girth, rate and length. There is no unique method of constructing LDPC codes. Existing construction methods are limited in some way in producing good error correcting performing and easily implementable codes for a given rate and length. There is a need to develop methods of constructing codes over a wide range of rates and lengths with good performance and ease of hardware implementability. LDPC code hardware design and implementation depend on the structure of target LDPC code and is also as varied as LDPC matrix designs and constructions. There are several factors to be considered including decoding algorithm computations,processing nodes interconnection network, number of processing nodes, amount of memory, number of quantization bits and decoding delay. All of these issues can be handled in several different ways. This thesis is about construction of LDPC codes and their hardware implementation. LDPC code construction and implementation issues mentioned above are too many to be addressed in one thesis. The main contribution of this thesis is the development of LDPC code construction methods for some classes of structured LDPC codes and techniques for reducing decoding time. We introduce two main methods for constructing structured codes. In the first method, column-weight two LDPC codes are derived from distance graphs. A wide range of girths, rates and lengths are obtained compared to existing methods. The performance and implementation complexity of obtained codes depends on the structure of their corresponding distance graphs. In the second method, a search algorithm based on bit-filing and progressive-edge growth algorithms is introduced for constructing quasi-cyclic LDPC codes. The algorithm can be used to form a distance or Tanner graph of a code. This method could also obtain codes over a wide range of parameters. Cycles of length four are avoided by observing the row-column constraint. Row-column connections observing this condition are searched sequentially or randomly. Although the girth conditions are not sufficient beyond six, larger girths codes were easily obtained especially at low rates. The advantage of this algorithm compared to other methods is its flexibility. It could be used to construct codes for a given rate and length with girths of at least six for any sub-matrix configuration or rearrangement. The code size is also easily varied by increasing or decreasing sub-matrix size. Codes obtained using a sequential search criteria show poor performance at low girths (6 and 8) while random searches result in good performing codes. Quasi-cyclic codes could be implemented in a variety of decoder architectures. One of the many options is the choice of processing nodes interconnect. We show how quasi-cyclic codes processing could be scheduled through a multistage network. Although these net-works have more delay than other modes of communication, they offer more flexibility at a reasonable cost. Banyan and Benes networks are suggested as the most suitable networks. Decoding delay is also one of several issues considered in decoder design and implementation. In this thesis, we overlap check and variable node computations to reduce decoding time. Three techniques are discussed, two of which are introduced in this thesis. The techniques are code matrix permutation, matrix space restriction and sub-matrix row-column scheduling. Matrix permutation rearranges the parity-check matrix such that rows and columns that do not have connections in common are separated. This techniques can be applied to any matrix. Its effectiveness largely depends on the structure of the code. We show that its success also depends on the size of row and column weights. Matrix space restriction is another technique that can be applied to any code and has fixed reduction in time or amount of overlap. Its success depends on the amount of restriction and may be traded with performance loss. The third technique already suggested in literature relies on the internal cyclic structure of sub-matrices to achieve overlapping. The technique is limited to LDPC code matrices in which the number of sub-matrices is equal to row and column weights. We show that it can be applied to other codes with a lager number of sub-matrices than code weights. However, in this case maximum overlap is not guaranteed. We calculate the lower bound on the amount of overlapping. Overlapping could be applied to any sub-matrix configuration of quasi-cyclic codes by arbitrarily choosing the starting rows for processing. Overlapping decoding time depends on inter-iteration waiting times. We show that there are upper bounds on waiting times which depend on the code weights. Waiting times could be further reduced by restricting shifts in identity sub-matrices or using smaller sub-matrices. This overlapping technique can reduce the decoding time by up to 50% compared to conventional message and computation scheduling. Techniques of matrix permutation and space restriction results in decoder architectures that are flexible in LDPC code design in terms of code weights and size. This is due to the fact that with these techniques, rows and columns are processed in sequential order to achieve overlapping. However, in the existing technique, all sub-matrices have to be processed in parallel to achieve overlapping. Parallel processing of all code sub-matrices requires the architecture to have the number of processing units at least equal to the number sub-matrices. Processing units and memory space should therefore be distributed among the sub-matrices according to the sub-matrices arrangement. This leads to high complexity or inflexibility in the decoder architecture. We propose a simple, programmable and high throughput decoder architecture based on matrix permutation and space restriction techniques.
Thesis(Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2007
APA, Harvard, Vancouver, ISO, and other styles
7

Malema, Gabofetswe Alafang. "Low-density parity-check codes : construction and implementation." Thesis, 2007. http://hdl.handle.net/2440/45525.

Full text
Abstract:
Low-density parity-check (LDPC) codes have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication. However, a LDPC code decoding algorithm needs to be executed efficiently to meet cost, time, power and bandwidth requirements of target applications. The constructed codes should also meet error rate performance requirements of those applications. Since their rediscovery, there has been much research work on LDPC code construction and implementation. LDPC codes can be designed over a wide space with parameters such as girth, rate and length. There is no unique method of constructing LDPC codes. Existing construction methods are limited in some way in producing good error correcting performing and easily implementable codes for a given rate and length. There is a need to develop methods of constructing codes over a wide range of rates and lengths with good performance and ease of hardware implementability. LDPC code hardware design and implementation depend on the structure of target LDPC code and is also as varied as LDPC matrix designs and constructions. There are several factors to be considered including decoding algorithm computations,processing nodes interconnection network, number of processing nodes, amount of memory, number of quantization bits and decoding delay. All of these issues can be handled in several different ways. This thesis is about construction of LDPC codes and their hardware implementation. LDPC code construction and implementation issues mentioned above are too many to be addressed in one thesis. The main contribution of this thesis is the development of LDPC code construction methods for some classes of structured LDPC codes and techniques for reducing decoding time. We introduce two main methods for constructing structured codes. In the first method, column-weight two LDPC codes are derived from distance graphs. A wide range of girths, rates and lengths are obtained compared to existing methods. The performance and implementation complexity of obtained codes depends on the structure of their corresponding distance graphs. In the second method, a search algorithm based on bit-filing and progressive-edge growth algorithms is introduced for constructing quasi-cyclic LDPC codes. The algorithm can be used to form a distance or Tanner graph of a code. This method could also obtain codes over a wide range of parameters. Cycles of length four are avoided by observing the row-column constraint. Row-column connections observing this condition are searched sequentially or randomly. Although the girth conditions are not sufficient beyond six, larger girths codes were easily obtained especially at low rates. The advantage of this algorithm compared to other methods is its flexibility. It could be used to construct codes for a given rate and length with girths of at least six for any sub-matrix configuration or rearrangement. The code size is also easily varied by increasing or decreasing sub-matrix size. Codes obtained using a sequential search criteria show poor performance at low girths (6 and 8) while random searches result in good performing codes. Quasi-cyclic codes could be implemented in a variety of decoder architectures. One of the many options is the choice of processing nodes interconnect. We show how quasi-cyclic codes processing could be scheduled through a multistage network. Although these net-works have more delay than other modes of communication, they offer more flexibility at a reasonable cost. Banyan and Benes networks are suggested as the most suitable networks. Decoding delay is also one of several issues considered in decoder design and implementation. In this thesis, we overlap check and variable node computations to reduce decoding time. Three techniques are discussed, two of which are introduced in this thesis. The techniques are code matrix permutation, matrix space restriction and sub-matrix row-column scheduling. Matrix permutation rearranges the parity-check matrix such that rows and columns that do not have connections in common are separated. This techniques can be applied to any matrix. Its effectiveness largely depends on the structure of the code. We show that its success also depends on the size of row and column weights. Matrix space restriction is another technique that can be applied to any code and has fixed reduction in time or amount of overlap. Its success depends on the amount of restriction and may be traded with performance loss. The third technique already suggested in literature relies on the internal cyclic structure of sub-matrices to achieve overlapping. The technique is limited to LDPC code matrices in which the number of sub-matrices is equal to row and column weights. We show that it can be applied to other codes with a lager number of sub-matrices than code weights. However, in this case maximum overlap is not guaranteed. We calculate the lower bound on the amount of overlapping. Overlapping could be applied to any sub-matrix configuration of quasi-cyclic codes by arbitrarily choosing the starting rows for processing. Overlapping decoding time depends on inter-iteration waiting times. We show that there are upper bounds on waiting times which depend on the code weights. Waiting times could be further reduced by restricting shifts in identity sub-matrices or using smaller sub-matrices. This overlapping technique can reduce the decoding time by up to 50% compared to conventional message and computation scheduling. Techniques of matrix permutation and space restriction results in decoder architectures that are flexible in LDPC code design in terms of code weights and size. This is due to the fact that with these techniques, rows and columns are processed in sequential order to achieve overlapping. However, in the existing technique, all sub-matrices have to be processed in parallel to achieve overlapping. Parallel processing of all code sub-matrices requires the architecture to have the number of processing units at least equal to the number sub-matrices. Processing units and memory space should therefore be distributed among the sub-matrices according to the sub-matrices arrangement. This leads to high complexity or inflexibility in the decoder architecture. We propose a simple, programmable and high throughput decoder architecture based on matrix permutation and space restriction techniques.
Thesis(Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2007
APA, Harvard, Vancouver, ISO, and other styles
8

Rezvani, Mojtaba. "Community Structure in Large-Scale Complex Networks." Phd thesis, 2019. http://hdl.handle.net/1885/187032.

Full text
Abstract:
Vertices in complex networks can be grouped into communities, where vertices inside communities are densely connected to each other and vertices from one community are sparsely connected to vertices in other communities. This is the so-called community structure in complex networks. Identifying the community structure of networks has many applications, ranging from data mining, webpage clustering and market- ing to extracting proteins with the same functionality in protein-protein-interaction networks and beyond. This thesis addresses a number of the primary problems surrounding community structure in large-scale networks. These problems generally revolve around two of the principal challenges of the area, accuracy and soundness of modelling and scala- bility to real-world networks. The problems include identifying top-k structural hole spanners, detecting the hierarchy of communities, detecting overlapping communi- ties, and community search in large-scale complex networks. The thesis formally de- fines the cohesive hierarchies of communities in complex networks. Since scalability is a major challenge for cohesive hierarchical community detection, the thesis incor- porates a network sparsification technique to leverage the network size and finds co- hesive hierarchies of communities in large-scale complex networks. The problem of identifying top-k structural hole spanners is formally defined in this thesis and several scalable algorithms have been presented for this problem. Furthermore, the thesis delves into the problem of overlapping community detection and proposes an accu- rate fitness metric to find overlapping communities in large-scale complex networks. The thesis finally studies the problem of community search and introduces a new al- gorithm for community search in complex networks. The thesis develops novel models, algorithms, and evaluation measures for these problems, and presents the experimental results of these algorithms using real-world datasets, which outperform considerably on the scalability and accuracy of the state of the art, in several cases.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Overlapping graphs"

1

Waldmann, Carl, Neil Soni, and Andrew Rhodes. Neurological disorders. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780199229581.003.0022.

Full text
Abstract:
Agitation and confusion 360Status epilepticus 362Meningitis 364Intracerebral haemorrhage 366Subarachnoid haemorrhage 368Ischaemic stroke 370Guillain–Barre syndrome 372Myasthenia gravis 374ICU neuromuscular disorders 376Tetanus 378Botulism 380Neurorehabilitation 382Hyperthermias 384Agitation and confusion are common features in critical illness. Agitation is a symptom or sign of numerous acute and chronic disease states that include pain, anxiety and delirium. Agitation is present in around half of ICU patients, with 15% experiencing severe agitation. Confusion may also be chronic or acute and arise from an overlapping set of pathological processes that includes hypoxia, hypotension, hypoglycaemia and dementia. It is possible to be agitated and not confused, and vice versa. Recognition and treatment of the underlying condition is of utmost importance, rather than treating the symptoms alone....
APA, Harvard, Vancouver, ISO, and other styles
2

Lézine, Anne-Marie. Vegetation at the Time of the African Humid Period. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190228620.013.530.

Full text
Abstract:
An orbitally induced increase in summer insolation during the last glacial-interglacial transition enhanced the thermal contrast between land and sea, with land masses heating up compared to the adjacent ocean surface. In North Africa, warmer land surfaces created a low-pressure zone, driving the northward penetration of monsoonal rains originating from the Atlantic Ocean. As a consequence, regions today among the driest of the world were covered by permanent and deep freshwater lakes, some of them being exceptionally large, such as the “Mega” Lake Chad, which covered some 400 000 square kilometers. A dense network of rivers developed.What were the consequences of this climate change on plant distribution and biodiversity? Pollen grains that accumulated over time in lake sediments are useful tools to reconstruct past vegetation assemblages since they are extremely resistant to decay and are produced in great quantities. In addition, their morphological character allows the determination of most plant families and genera.In response to the postglacial humidity increase, tropical taxa that survived as strongly reduced populations during the last glacial period spread widely, shifting latitudes or elevations, expanding population size, or both. In the Saharan desert, pollen of tropical trees (e.g., Celtis) were found in sites located at up to 25°N in southern Libya. In the Equatorial mountains, trees (e.g., Olea and Podocarpus) migrated to higher elevations to form the present-day Afro-montane forests. Patterns of migration were individualistic, with the entire range of some taxa displaced to higher latitudes or shifted from one elevation belt to another. New combinations of climate/environmental conditions allowed the cooccurrences of taxa growing today in separate regions. Such migrational processes and species-overlapping ranges led to a tremendous increase in biodiversity, particularly in the Saharan desert, where more humid-adapted taxa expanded along water courses, lakes, and wetlands, whereas xerophytic populations persisted in drier areas.At the end of the Holocene era, some 2,500 to 4,500 years ago, the majority of sites in tropical Africa recorded a shift to drier conditions, with many lakes and wetlands drying out. The vegetation response to this shift was the overall disruption of the forests and the wide expansion of open landscapes (wooded grasslands, grasslands, and steppes). This environmental crisis created favorable conditions for further plant exploitation and cereal cultivation in the Congo Basin.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Overlapping graphs"

1

Marik, Radek, and Tomas Zikmund. "Overlapping Communities in Bipartite Graphs." In Studies in Computational Intelligence, 207–18. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05411-3_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Slavnov, Konstantin, and Maxim Panov. "Overlapping Community Detection in Weighted Graphs: Matrix Factorization Approach." In Communications in Computer and Information Science, 3–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35400-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yoshida, Tetsuya. "Overlapping Community Discovery via Weighted Line Graphs of Networks." In Lecture Notes in Computer Science, 895–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32695-0_94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yoshida, Tetsuya. "Weighted Line Graphs for Overlapping Community Discovery and their Evaluation." In Communications in Computer and Information Science, 121–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40140-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bijlsma, Tjerk, Marco J. G. Bekooij, and Gerard J. M. Smit. "Circular Buffers with Multiple Overlapping Windows for Cyclic Task Graphs." In Transactions on High-Performance Embedded Architectures and Compilers V, 39–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-58834-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chykhradze, Kyrylo, Anton Korshunov, Nazar Buzun, Roman Pastukhov, Nikolay Kuzyurin, Denis Turdakov, and Hangkyu Kim. "Distributed Generation of Billion-node Social Graphs with Overlapping Community Structure." In Complex Networks V, 199–208. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05401-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mallot, Hanspeter A., Gerrit A. Ecke, and Tristan Baumann. "Dual Population Coding for Path Planning in Graphs with Overlapping Place Representations." In Lecture Notes in Computer Science, 3–17. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57983-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gabardo, Ademir, Regina Berretta, and Pablo Moscato. "Overlapping Communities in Co-purchasing and Social Interaction Graphs: A Memetic Approach." In Business and Consumer Analytics: New Ideas, 435–66. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-06222-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Palazuelos, Camilo, and Marta Zorrilla. "FRINGE: A New Approach to the Detection of Overlapping Communities in Graphs." In Computational Science and Its Applications - ICCSA 2011, 638–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21931-3_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Angelelli, Jean-Baptiste, Alain Guénoche, and Laurence Reboul. "Detection of Disjoint or Overlapping Communities in Networks." In Graph Partitioning, 297–314. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118601181.ch12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Overlapping graphs"

1

Held, Pascal, and Rudolf Kruse. "Detecting overlapping community hierarchies in dynamic graphs." In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2016. http://dx.doi.org/10.1109/asonam.2016.7752373.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jian, Xun, Xiang Lian, and Lei Chen. "On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs." In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 2018. http://dx.doi.org/10.1109/icde.2018.00142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kumar, Pushpa, Kang Zhang, and Yuke Wang. "Visualization of Clustered Directed Acyclic Graphs without Node Overlapping." In 2008 12th International Conference Information Visualisation (IV). IEEE, 2008. http://dx.doi.org/10.1109/iv.2008.85.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Srimathy, S., and Andrew Thangaraj. "Codes that have tanner graphs with non-overlapping cycles." In 2008 5th International Symposium on Turbo Codes and Related Topics. IEEE, 2008. http://dx.doi.org/10.1109/turbocoding.2008.4658715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xinhua, E., Song Junde, Xu Ke, and Tong Junjie. "Overlapping Community Detection in Directed Graphs with Considering Local Fitness." In 5th IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.2421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Qin, Zunying, Liyuan Huang, Bo She, Qiang Wang, Jingru Cui, and Guodong Li. "Detecting Overlapping Communities in Knowledge Graphs: A Density Optimization Based Approach." In 2018 IEEE International Conference on Big Knowledge (ICBK). IEEE, 2018. http://dx.doi.org/10.1109/icbk.2018.00010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tautenhain, Camila, and Mariá Nascimento. "Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks." In 11th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007403803060317.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arora, Gundeep, Anupreet Porwal, Kanupriya Agarwal, Avani Samdariya, and Piyush Rai. "Small-Variance Asymptotics for Nonparametric Bayesian Overlapping Stochastic Blockmodels." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/276.

Full text
Abstract:
The latent feature relational model (LFRM) for graphs represents each node as having binary memberships in one or more communities. The community memberships can be represented in form of a binary vector and LFRM defines the link probability between any pair of nodes as a bilinear function of their community membership vectors. Moreover, using nonparametric Bayesian prior - Indian Buffet Process - on the community membership matrix enables learning the number of communities automatically from the data. However, despite its modeling flexibility, strong link predictive performance, and nice interpretability of binary embeddings, inference in LFRM remains a challenge and is typically done via MCMC or variational methods. These methods can be slow and may take a long time to converge. In this work, we apply the small variance asymptotics idea to the non-parametric Bayesian LFRM, utilizing the connection between exponential families and Bregman divergence. This leads to an overlapping k-means like objective function for the nonparametric Bayesian LFRM, which can be optimized using generic or specialized solvers. We also propose an iterative greedy algorithm to optimize the objective function and compare our approach with other inference methods on several benchmark datasets. Our results demonstrate that our inference algorithm is competitive to methods such as MCMC while being much faster.
APA, Harvard, Vancouver, ISO, and other styles
9

Bijlsma, Tjerk, Marco J. G. Bekooij, and Gerard J. M. Smit. "Inter-task communication via overlapping read and write windows for deadlock-free execution of cyclic task graphs." In 2009 International Symposium on Systems, Architectures, Modeling, and Simulation (SAMOS). IEEE, 2009. http://dx.doi.org/10.1109/icsamos.2009.5289225.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vickers, Paul, and Robert Höldrich. "Direct Segmented Sonification of Characteristic Features of the Data Domain." In ICAD 2019: The 25th International Conference on Auditory Display. Newcastle upon Tyne, United Kingdom: Department of Computer and Information Sciences, Northumbria University, 2019. http://dx.doi.org/10.21785/icad2019.043.

Full text
Abstract:
Like audification, auditory graphs maintain the temporal relationships of data while using parameter mappings to represent the ordinate values. Such direct approaches have the advantage of presenting the data stream ‘as is’ without the imposed interpretations or accentuation of particular features found in indirect approaches. However, datasets can often be subdivided into short non-overlapping variable length segments that each encapsulate a discrete unit of domain-specific significant information and current direct approaches cannot represent these. We present Direct Segmented Sonification (DSSon) for highlighting the segments’ data distributions as individual sonic events. Using domain knowledge DSSon presents segments as discrete auditory gestalts while retaining the overall temporal regime and relationships of the dataset. The method’s structural decoupling from the sound stream’s formation means playback speed is independent of the individual sonic event durations, thereby offering highly flexible time compression/stretching to allow zooming into or out of the data. DSSon displays high directness, letting the data ‘speak’ for themselves.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Overlapping graphs"

1

Kellett, D. A., and A. Zagorevski. Overlap assemblages: Laberge Group of the Whitehorse Trough, northern Canadian Cordillera. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/326064.

Full text
Abstract:
The Laberge Group was deposited during the Early to Middle Jurassic in a marginal marine environment, in the northern Canadian Cordillera. It occurs as a narrow, elongated siliciclastic unit along more than 600 km of strike length, overlapping the Intermontane terranes of southern Yukon and northwestern British Columbia. The Laberge Group was deposited on the Late Triassic Stuhini and Lewes River groups, a volcano-plutonic complex of the Stikine terrane (Stikinia), and, locally, the Kutcho Arc. It is overlain by Middle Jurassic to Cretaceous clastic units. The variations in clast composition and detrital zircon populations among these units indicate major changes in depositional environment, basin extent, and sources during the latest Triassic to Middle Jurassic. Detrital zircon populations are dominated by near contemporary Stuhini-Lewes River arc grains, consistent with dissection of an active arc. Detrital rutile and muscovite data show rapid cooling and exhumation of metamorphic rocks during the Early Jurassic. Thermochronological data indicate that basin thermal evolution was domainal, with at least five regional temperature-time histories.
APA, Harvard, Vancouver, ISO, and other styles
2

Weiss, David, and Neil Olszewski. Manipulation of GA Levels and GA Signal Transduction in Anthers to Generate Male Sterility. United States Department of Agriculture, 2000. http://dx.doi.org/10.32747/2000.7580678.bard.

Full text
Abstract:
The original objectives of the research were: i. To study the role of GA in anther development, ii. To manipulate GA and/or GA signal transduction levels in the anthers in order to generate male sterility. iii. To characterize the GA signal transduction repressor, SPY. Previous studies have suggested that gibberellins (GAs) are required for normal anther development. In this work, we studied the role of GA in the regulation of anther development in petunia. When plants were treated with the GA-biosynthesis inhibitor paclobutrazol, anther development was arrested. Microscopic analysis of these anthers revealed that paclobutrazol inhibits post-meiotic developmental processes. The treated anthers contained pollen grains but the connective tissue and tapetum cells were degenerated. The expression of the GA-induced gene, GIP, can be used in petunia as a molecular marker to: study GA responses. Analyses of GIP expression during anther development revealed that the gene is induced only after microsporogenesis. This observation further suggests a role for GA in the regulation of post-meiotic processes during petunia anther development. Spy acts as a negative regulator of gibberellin (GA) action in Arabidopsis. We cloned the petunia Spy homologue, PhSPY, and showed that it can complement the spy-3 mutation in Arabidopsis. Overexpression of Spy in transgenic petunia plants affected various GA-regulated processes, including seed germination, shoot elongation, flower initiation, flower development and the expression of a GA- induced gene, GIP. In addition, anther development was inhibited in the transgenic plants following microsporogenesis. The N-terminus of Spy contains tetratricopeptide repeats (TPR). TPR motifs participate in protein-protein interactions, suggesting that Spy is part of a multiprotein complex. To test this hypothesis, we over-expressed the SPY's TPR region without the catalytic domain in transgenic petunia and generated a dominant- negative Spy mutant. The transgenic seeds were able to germinate on paclobutrazol, suggesting an enhanced GA signal. Overexpression of PhSPY in wild type Arabidopsis did not affect plant stature, morphology or flowering time. Consistent with Spy being an O-GlcNAc transferase (OGT), Spy expressed in insect cells was shown to O-GlcNAc modify itself. Consistent with O-GlcNAc modification playing a role in GA signaling, spy mutants had a reduction in the GlcNAc modification of several proteins. After treatment of the GA deficient, gal mutant, with GA3 the GlcNAc modification of proteins of the same size as those affected in spy mutants exhibited a reduction in GlcNAcylation. GA-induced GlcNAcase may be responsible for this de-GlcNAcylation because, treatment of gal with GA rapidly induced an increase in GlcNAcase activity. Several Arabidopsis proteins that interact with the TPR domain of Spy were identified using yeast two-hybrids screens. One of these proteins was GIGANTEA (GI). Consistent with GI and Spy functioning as a complex in the plant the spy-4 was epistatic to gi. These experiments also demonstrated that, in addition to its role in GA signaling, Spy functions in the light signaling pathways controlling hypocotyl elongation and photoperiodic induction of flowering. A second Arabidopsis OGT, SECRET AGENT (SCA), was discovered. Like SPY, SCA O-GlcNAc modifies itself. Although sca mutants do not exhibit dramatic phenotypes, spy/sca double mutants exhibit male and female gamete and embryo lethality, indicating that Spy and SCA have overlapping functions. These results suggest that O-GlcNAc modification is an essential modification in plants that has a role in multiple signaling pathways.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Overlapping graphs' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography