Re: [Jung-support] TriadicCensus

[Joshua O'M. <jos...@gm...>]

Nivaldo:

This is not properly a triadic census, but just looking for triangles
(3-cliques) in a graph.  In any case, it's trivial to write JUNG code
that records for vertex triples A,B,C whether they're mutually
connected or not, but the problem is inherently O(n^3) where n is the
number of vertices in the graph, unless there are special properties
of the graph that you can exploit.  (For example, if your graph is
sparse, you can for instance eliminate all vertices with degree < 2.)
But basically it's going to be a triply nested loop with three edge
checks.

Joshua

On Wed, Feb 24, 2010 at 10:36 AM, Nivaldo Vasconcelos
<nap...@gm...> wrote:
> Hi Joshua,
>
> Thank you.
>
> In my application, given the undirected graph, G, in which there are the
> following nodes: A,B,C; there is a triadic closure between them if there are
> the edges AB,BC and AC. I'm looking for an method to get (fast) this
> information from G.
>
> May I find this in Jung ?
>
> Best regards,
> Nivaldo
> On Wed, Feb 24, 2010 at 2:33 PM, Joshua O'Madadhain
> <jos...@gm...> wrote:
>>
>> On Wed, Feb 24, 2010 at 4:45 AM, Nivaldo Vasconcelos
>> <nap...@gm...> wrote:
>> > Hi,
>> >
>> > is there any example to use the TriadicCensus Class ?
>>
>> The Javadoc provides an example of its use.
>>
>> > Is it possible to use it with undirected graphs ?
>>
>> No.  Triadic census is not defined on undirected graphs; the
>> directionality of an edge is critical to the measurement.  If you want
>> to apply it to the directed analogue of an undirected graph (i.e., in
>> which each undirected edge is replaced by two directed antiparallel
>> edges) then you can use a transformation (see
>> algorithms.transformation) to accomplish this.
>>
>> Joshua
>>
>> >
>> > Best regards,
>> > --
>> > Nivaldo Vasconcelos
>> > http://jeitosdeveravida.blogspot.com
>> >
>> >
>> > ------------------------------------------------------------------------------
>> > Download Intel&#174; Parallel Studio Eval
>> > Try the new software tools for yourself. Speed compiling, find bugs
>> > proactively, and fine-tune applications for parallel performance.
>> > See why Intel Parallel Studio got high marks during beta.
>> > http://p.sf.net/sfu/intel-sw-dev
>> > _______________________________________________
>> > Jung-support mailing list
>> > Jun...@li...
>> > https://lists.sourceforge.net/lists/listinfo/jung-support
>> >
>> >
>>
>>
>>
>> --
>>  jos...@gm......................www.ics.uci.edu/~jmadden
>>   Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
>> It's that moment of dawning comprehension that I live for.  -- Bill
>> Watterson
>>  My opinions are too rational and insightful to be those of any
>> organization.
>
>
>
> --
> Nivaldo Vasconcelos
> http://jeitosdeveravida.blogspot.com
>



-- 
  jos...@gm......................www.ics.uci.edu/~jmadden
   Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
It's that moment of dawning comprehension that I live for.  -- Bill Watterson
 My opinions are too rational and insightful to be those of any organization.