Print

Print


*****  To join INSNA, visit http://www.insna.org  *****

You can do this easily in ORA.
use the Locate Groups report, and then the Local Patterns algorithm tab.
It is the top option.

Note you can import UCINET files into ORA - use the import wizard.

Also - yes there is a free academic version on the CASOS website.
www.casos.cs.cmu.edu

On 4/17/2016 6:55 PM, rick davies wrote:
> ***** To join INSNA, visit http://www.insna.org *****
> Hi all
> 
> Is it possible to construct a minimum spanning tree for a network, using
> Ucinet?
> 
> If so, how?
> 
> If not, what is the best alternative that involves reasonably user
> friendly software (=Ucinet or easier)
> 
> with thanks, rick davies
> 
> Rick Davies (Dr), Monitoring and Evaluation Consultant, Cambridge,
> United Kingdom | UK. Websites: http://www.mande.co.uk
> <http://www.mande.co.uk/> 
> and http://richardjdavies.wordpress.com/ FIRST CONTACT:
> [log in to unmask] <mailto:[log in to unmask]> THEN UK
> landline: +44 (0) 1223 841 367 | THEN UK mobile:+44 (0) 7855 766 354
> OTHER OPTIONS: Skype: rickjdavies OR +44(0)1223 96 8819 OR Australia
> landline +61(0)359 884 574 | 
> 
> "“/There is a great satisfaction in building good tools for other people
> to use/”
> – Freeman Dyson, Disturbing the Universe
> 
> On Sun, Apr 17, 2016 at 10:29 PM, Moses Boudourides
> <[log in to unmask] <mailto:[log in to unmask]>> wrote:
> 
>     *****  To join INSNA, visit http://www.insna.org  *****
> 
>     Hello,
> 
>     Just to inform at least those of you who are considering their
>     participation at our workshop "Extracting Social Networks from
>     Literary Text" at the Paris June 2016 EUSN that an example of the
>     computations we will be doing at this workshop is posted at my github
>     blog:
> 
>     http://mboudour.github.io/2016/04/17/Arthur-Conan-Doyle's-A-Study-in-Scarlet-Network-&-Trajectories.html
> 
>     It is about the network of sententially co-occurrent characters in
>     Arthur Conan Doyle's "A Study in Scarlet." In particular, our emphasis
>     is given in the computation of trajectories/transitions of Sherlock
>     Holme's sentential co-occurrences with other characters of the book,
>     according to the methodology of transitions/trajectories in temporal
>     networks originally developed by Borgatti & Halgin. Those interested
>     in this methodology might also want to read our presentation at the
>     Brighton 2015 Sunbelt:
> 
>     http://www.slideshare.net/MosesBoudourides/trajectories1
> 
>     Best,
> 
>     --Moses
> 
>     _____________________________________________________________________
>     SOCNET is a service of INSNA, the professional association for social
>     network researchers (http://www.insna.org). To unsubscribe, send
>     an email message to [log in to unmask]
>     <mailto:[log in to unmask]> containing the line
>     UNSUBSCRIBE SOCNET in the body of the message.
> 
> 
> _____________________________________________________________________
> SOCNET is a service of INSNA, the professional association for social
> network researchers (http://www.insna.org). To unsubscribe, send an
> email message to [log in to unmask] containing the line UNSUBSCRIBE
> SOCNET in the body of the message.

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.